Hi,
Thanks all for your good help. I was caught up in sequential thinking about
monads so much so that I treated the lambda expressions as separate functions
rather than a nested big one.
That clears up a lot of nagging doubts.
Cheers,
Matt.
On 20 Jul 2013, at 00:18, Rogan Creswick
Matt
It is not return, but the bind the one that does the miracle of
multiplication.
By its definition for the list monad, it applies the second term once for
each element are in the first term.
So return is called many times. At the end, bind concat all the small
lists generated
2013/7/20 Matt
Hi café,
I just spent the whole day fighting ghc and cabal to get my program
compiled in windows (and I haven't succeeded yet :) )
realgcc is not very happy about paths with spaces in them (I think
there's an open bug about the way ghc calls realgcc, which manifests
if you use extra-lib-dirs in
On Tue, Jul 16, 2013 at 5:20 PM, Richard A. O'Keefe o...@cs.otago.ac.nz wrote:
Brian Marick sent me a couple of his stickers.
The one I have on my door reads to be less wrong than yesterday.
The other one I keep free to bring out and wave around:
An example would be handy about now.
On Sat, Jul 20, 2013 at 12:31 AM, Carter Schonwald
carter.schonw...@gmail.com wrote:
the tricky part then is to add support for other types.
another approach to existentially package type classes with the data type!
eg
data HasEq = forall a . HasEq ( Eq a = a)
or its siblinng
data HasEq a
On Sat, Jul 20, 2013 at 12:14 AM, Michael Orlitzky mich...@orlitzky.com wrote:
For posterity, I report failure =)
Hi Michael,
It's fairly straightforward to generate the new data with template
haskell [1], and on the same page, section 10.7 'generic' zipWith is
likely to be similar to your
For the sake of approaching this in yet another way, it can also be helpful
to substitute the definitions of bind and return in your expression. If we
start with the definitions:
instance Monad [] where
xs = f = concat (map f xs)
return x = [x]
Then we can make the following transformations:
Should be fixed now. The wiki was recently transferred to a new server and
this got unfortunately broken in the process.
On 18 Jul 2013 22:45, Henk-Jan van Tuyl hjgt...@chello.nl wrote:
L.S.,
It looks like the HaskellWiki images have disappeared; can anybody repair
this? (See for example
Hi all, here is a combined darcsden and darcs hub update.
darcsden 1.1 released
=
darcsden 1.1 is now available on hackage! This is the updated version
of darcsden which runs hub.darcs.net, so these changes are also
relevant to that site's users. (More darcs hub news below.)
-- data-fin 0.1.0
The data-fin package offers the family of totally ordered finite sets,
implemented as newtypes of Integer, etc. Thus, you get all the joys of:
data Nat = Zero | Succ !Nat
data Fin
10 matches
Mail list logo
