[Haskell-cafe] Combining computations

Brandon S. Allbery KF8NH allbery at ece.cmu.edu
Sun May 3 17:15:03 EDT 2009

On May 3, 2009, at 16:59 , Claus Reinke wrote:
> Perhaps the question should be: is there an interesting structure
> that would allow us to capture when this kind of merging Monads
> is possible? We can convert every 'Maybe a' to a '[] a', but the  
> other way round is partial or loses information, so lets focus on  
> the first direction. Should there be a

It feels to me kinda like numeric upconversion.

brandon s. allbery [solaris,freebsd,perl,pugs,haskell] allbery at kf8nh.com
system administrator [openafs,heimdal,too many hats] allbery at ece.cmu.edu
electrical and computer engineering, carnegie mellon university    KF8NH

-------------- next part --------------
A non-text attachment was scrubbed...
Name: PGP.sig
Type: application/pgp-signature
Size: 195 bytes
Desc: This is a digitally signed message part
Url : http://www.haskell.org/pipermail/haskell-cafe/attachments/20090503/2e393410/PGP.bin

More information about the Haskell-Cafe mailing list