Search results
Jump to navigation
Jump to search
- newtype DRMonad e s w a = DRMonad {runDRMonad :: s -> (Either e a,s,w)} instance (Monoid m, Error e) => Monad (DRMonad e s w) where6 KB (995 words) - 23:51, 16 April 2021
- Here's a simple test for object orientation (for some reasonable definition): ...Haskell's <tt>[[Dynamic]]</tt>, where you only have to deal with <tt>B</tt>s that are instances of <tt>Typeable</tt>. But even with that, note that <tt>4 KB (587 words) - 11:16, 28 March 2018
- ...GPU's. It's about unsupervised machine learning. Later: Convolutional RBM's. || Markus Liedl || BSD3 || https://github.com/haskell-munich/accelerate-rb3 KB (355 words) - 14:25, 30 May 2015
- ...Moreover it is able to interface with third party EDA tools such as Altera's [http://www.model.com/ Modelsim] and [http://www.altera.com/products/softwa :David J. King and John O'Donnell's digital circuit simulator2 KB (333 words) - 11:47, 4 November 2014
- The following is a list of previous documents and discussions about Haskell's module system: * Iavor S. Diatchki et al's formal specification of the Haskell 98 module system: http://purely-functio3 KB (368 words) - 22:21, 24 February 2016
- ...fine, but alas not always. Perhaps this is a deficiency in GHC, but here's one way it can happen: What's going on? GHC knows, from the type signature that <tt>x::a</tt>. Then appl4 KB (716 words) - 11:30, 24 January 2016
- ...sing from the ordering of external events to a functional language. Burton's technique uses abstract values contained in an (theoretically) infinite str ...d with <code>contents</code> to retrieve the abstract <code>Decision</code>s for use by <code>choice</code>:2 KB (341 words) - 09:18, 22 February 2022
- | Holiday Inn Express, Penn's Landing | Holiday Inn Express, Penn's Landing1 KB (190 words) - 14:59, 21 October 2016
- ...convert the problem to the equivalent problem for n > 0 by adding the list's length to n. | otherwise = let (f,s) = splitAt n xs in s ++ f3 KB (474 words) - 20:35, 23 May 2021
- * <code>ST s a</code>, the type of encapsulated-state actions. The condition that an action's effects only occur if performed prevents their use in otherwise-ordinary Ha3 KB (428 words) - 04:08, 12 April 2024
- For now we refer to Wikipedia's article about [http://en.wikipedia.org/wiki/Type_class type classes].322 bytes (46 words) - 10:06, 3 August 2015
- As an illustration, let's take the function <haskell>div :: Int -> Int -> Int -- which is actually But there's more going on here than immediately meets the untrained eye. It could be a4 KB (669 words) - 02:17, 3 November 2023
- Lazy Mom : Here's a credit card, Son. Just charge what you need. from myself. What's the use pretending I'm getting them from you?3 KB (445 words) - 15:19, 6 February 2021
- toHTML s = MkHTML s fromHTML (MkHTML s) = s5 KB (887 words) - 06:53, 12 June 2023
- ...hask> keyword with <hask>data</hask> and it'll still compile, indeed there's even a good chance your program will still work. The converse is not true, newtype State s a = State { runState :: s -> (s, a) }6 KB (1,007 words) - 15:57, 22 May 2016
- ...utation of type <code>Cont r s</code>. That's a bit brain-twisting, so let's think about how we might do it... ...is going to receive a question <code>q</code> about a value of type <code>s</code>, and has to answer it somehow.7 KB (1,253 words) - 23:34, 25 June 2021
- Let's untangle that, and then test the referentially transparent isolation. Let's use QuickCheck. First we need an Arbitrary instance for8 KB (1,214 words) - 00:46, 23 October 2017
- = GHC's switch from darcs to git =571 bytes (77 words) - 18:50, 18 June 2014
- Here's one to show it done in a fold just for the fun of it. Do note that it is le Here's one that does half as many compares:2 KB (320 words) - 00:08, 8 July 2019
- Spare {frameScore=s} -> [[s-10]] Strike {frameScore=s,next=10} -> [[10],[s-20]]4 KB (555 words) - 15:19, 6 February 2021