I would recommend Ralf Hinze's ICFP00 Pearl
Deriving Backtracking Monad Transformers
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.4164
He starts with a monad transformer expressed as a free term algebra,
and shows step-by-step how to transform it to a more
Tim Baumgartner wrote:
Thanks a lot! Althaugh I have some understanding of the Haskell basics and
the most important monads, I feel that I have to see more well designed
code in order to become a good Haskeller. Can somebody make suggestions
what materials are best to work through in order to
I've read Martin Erwig and Steve Kollmansberger's *Probabilistic functional
programming in Haskell*.
Does someone know if the library they are talking about is available on
hackage?
2011/11/21 Heinrich Apfelmus apfel...@quantentunnel.de
Tim Baumgartner wrote:
Thanks a lot! Althaugh I have
On 21 November 2011 14:48, Yves Parès limestr...@gmail.com wrote:
I've read Martin Erwig and Steve Kollmansberger's Probabilistic functional
programming in Haskell.
Does someone know if the library they are talking about is available on
hackage?
Henning Thielemann has a batteries included
Free Monads. It's amazing to be confronted again with notions I learned
more than ten years ago for groups. I have to admit that I'm probably not
yet prepared for a deeper understanding of this, but hopefully I will
return to it later ;-)
Is Cont free as well? I guess so because I heard it's
Hi Heinrich,
I read your article about the operational monad and found it really very
enlightening. So I'm curious to work through the material you linked below.
Thanks!
Regards
Tim
2011/11/21 Heinrich Apfelmus apfel...@quantentunnel.de
Tim Baumgartner wrote:
Thanks a lot! Althaugh I have
On Mon, Nov 21, 2011 at 2:13 PM, Tim Baumgartner
baumgartner@googlemail.com wrote:
Free Monads. It's amazing to be confronted again with notions I learned more
than ten years ago for groups. I have to admit that I'm probably not yet
prepared for a deeper understanding of this, but hopefully
2011/11/21 David Menendez d...@zednenem.com
Here's how you might implement your monad using Cont,
type InteractionM a b = Cont (Interaction a b)
exit b = Cont $ \k - Exit b
output b = Cont $ \k - Output b (k ())
input= Cont $ \k - Input k
runM m = runCont m Exit
That's what I
You'll probably get answers from people who are more proficient with this,
but here's what I learned over the years.
Tim Baumgartner wrote:
Is Cont free as well?
No. In fact, free monads are quite a special case, many monads are not free,
e.g. the list monad. I believe what David Menendez
On Sat, Nov 19, 2011 at 3:29 PM, Felipe Almeida Lessa
felipe.le...@gmail.com wrote:
On Sat, Nov 19, 2011 at 6:08 PM, Tim Baumgartner
baumgartner@googlemail.com wrote:
I have not yet gained a good understanding of the continuation monad, but I
wonder if it could be used here. What would a
On Sat, Nov 19, 2011 at 6:08 PM, Tim Baumgartner
baumgartner@googlemail.com wrote:
I have not yet gained a good understanding of the continuation monad, but I
wonder if it could be used here. What would a clean solution look like?
Perhaps there are other things that need to be changed as
Thanks a lot! Althaugh I have some understanding of the Haskell basics and
the most important monads, I feel that I have to see more well designed
code in order to become a good Haskeller. Can somebody make suggestions
what materials are best to work through in order to achieve this? Are there
12 matches
Mail list logo
