monad

A question about "monad laws"
For example I'm also trying with a state compound monad along these lines: type 'am = Cons of 'am -> ('a * 'am) Mm where Mm is, for example a list monad, and I have the same problem. The lack of polymorphism may be acceptable at times. If not, we have to explicitly introduce typed prompts -- as was first proposed

A question about "monad laws"
John Jones jonescard...@aol.com sci logic Bill Taylor wrote: Could someone please give EXAMPLES of monads; [*] and also examples of things which might superficially be thought to be such, but which are NOT monads. [*] Leibnitzian. I confess I struggle to think of examples. Exactly! So all those websites are just as

JTK Stunner..."Smalltalk just as fast as C++"
a...@spamcop.net fa haskell G'day all. Quoting Thorkil Naur <n...@post11.tele.dk>: Finding the "machine epsilon", perhaps, that is, the smallest (floating point, surely) number for which 1.0+machine_eps==1.0 would be a candidate? The machine epsilon is the smallest relative separation between two adjacent normalised

A question about "monad laws"
I get an error that CircularFuncList funcList arg has kind * while Monad is looking for * -> *. This is a first attempt so it may be I'ma ways off from a monad that implements a circular list of functions. That is the goal though. What advice can you offer? I'm not sure how CircularFuncList is a monad.

Monad : Registry HKCR ?
Neil Mitchell ndmitch...@gmail.com fa haskell Hi The following is one of the laws. (x >>= f) >>= g == x >>= (\v -> fv >>= g) Or stated another way: (x >>= f) >>= g == x >>= (f >>= g) Now it should be easier to see that this is simply associativity. It's easy enough to violate, if you want to - but I don't have any

A question about "monad laws"
Goran Soderlind dfj9...@tninet.se swnet filosofi Hej Det Laurency kallar för monad ( uratom ) får här en något vidare förklaring. Jag har efter idogt sökande lyckats med att hitta denna vidare definition på monad från newsgruppen: alt.clearing.technology Eftersom det är offentligt material fritt tillgängligt för

Simple variable-state `monad'
Iavor Diatchki diatc...@cse.ogi.edu fa haskell hi, just a comment that the you can get more modular (and hence simpler) proofs by using monad transformers. than you can break down your proof in a number of steps: 1. prove that the identity monad is a monad 2. prove that the exception transformer: ErrorT xma = m

Typesafe MRef with a regular monad
Matt Harden ma...@mindspring.com comp lang functional Joachim Durchholz wrote: Matt Harden wrote: It is their ability to simply and succinctly express the sequencing of operations within a pure functional framework that makes monads desirable for tasks from performing IO, to List processing, to exception handling,

Is it an object? is it a monad? No! its ...
Wilhelm B. Kloke w...@arb-phys.uni-dortmund.de fa haskell Ben Franksen <ben.frank...@online.de> schrieb: Wilhelm B. Kloke wrote: a...@spamcop.net <a...@spamcop.net> schrieb: I would consider a good idea if ghc would provide language support to this sort of integers. No need, you can do that for yourself: {-# LANGUAGE

Is it an object? is it a monad? No! its ...
Thorkil Naur n...@post11.tele.dk fa haskell Hello, On a tangent, probably: On Thursday 14 February 2008 10:24, Roman Leshchinskiy wrote: ... Hmm. Personally, I've never seen an algorithm where comparing for exact equality was algorithmically necessary. Sometimes (rarely) it is acceptable but necessary?

What is a monad
#3 $40 $13 pin...@mindless.com Derek Jeter 97 New Pinnacle/Meuseum Collection #53 $30 $4 slfletc...@top.monad.net Derek Jeter 97 Flair Showcase/Diamond Cuts #13 Portraits #4 $20 $1.50 twi...@earthlink.net Derek Jeter 97 Donruss/Armed and Dangerous #11 $20 $1.50 slfletc...@top.monad.net Derek Jeter 96 Pinnacle

A question about "monad laws"
Jan-Willem Maessen jmaes...@alum.mit.edu fa haskell On Feb 12, 2008, at 1:50 AM, David Benbennick wrote: On Feb 11, 2008 10:18 PM, Uwe Hollerbach <uhollerb...@gmail.com> wrote: If I fire up ghci, import Data.Ratio and GHC.Real, and then ask about the type of "infinity", it tells me Rational, which as far as I can

What is a monad
1 *Main> putStrLn $ snd $ runWriter $ myfoldrW const 0 [1..] Interrupted. One of the good things from foldr is the possibility of "short-circuiting", so to speak. However I don't know if it is possible to show this using the writer monad, as is would involve observing if the function is strict or not in its second

A question about "monad laws"
Marcin 'Qrczak' Kowalczyk qrc...@knm.org.pl comp lang functional On Tue, 17 Feb 2004 13:43:52 -0800, Erann Gat wrote: My question is: is it possible to render and/or explain the concept of a monad in Scheme? Implementing them would be significantly more verbose than in Haskell, because Haskell has a powerful static

Is it an object? is it a monad? No! its ...
AFAIR, my train of thought was something like this: - I need both state and nondeterminism, so I have to combine the state monad and the list monad. This means I need a monad transformer and a monad (you need to have seen this before, but if you have once, it's easy to remember). - The state itself also has to be a

MY BROTHER'S AUCTION #6! MONAD, MELEE & MORE! LAST CHANCE! UPDATE #6!
I have very little experience with monads. However my first impression is that there is too much thinking process involved in programming with monads, and it is very time consuming, at least for a beginner like myself. I don't know how productivity changes once you get used to programming with them.

Monados : Find your Monad Twin's !
Trace.trace So, I would say this proves my main point, which was that you could accomplish the same thing using the writer monad that you could do using the more "ad hoc" trace function from Debug.Trace. It's good that you point this out though, because understanding that foldr can take an infinite list and foldl

What is a monad
Thomas Lee t...@psp.co.uk microsoft public windows server scripting With the move to this newsgroup for monad related posts (and it wasn't my idea!), I thought it might be useful to setup a couple of links for folks coming here to get more information regarding monad. I've got a couple of pages at my www.reskit.net

"Wrong kind" when attempting to build a monad ...
Grzegorz Staniak gstan...@wp.pl pl comp os advocacy http://news.yahoo. com/s/zd/20050609/tc_zd/153779&printer=1 'Monad' Scripting Shell Unlikely to Debut in Longhorn Yet another piece of technology originally expected to surface in Longhorn looks as if it won't make it into the product. The latest element to get the

A question about "monad laws"
That's just another monad (TX = supply->X*supply, gensym : Tname). If the = type you use for names isn't abstract (eg you just use int) then the resulting equational theory will be weak (because contexts can supply all the names). A more refined treatment is possible. If (and only if) you make the type of names and