ANN: Monad.Reader special Poetry and Fiction Edition
I am pleased to announce that the special Poetry and Fiction Edition of The Monad.Reader is now available [1]. Enjoy! Also, the submission deadline for Issue 18 has been extended one week, to Friday, April 8. Please get in touch if you would like to submit something! -Brent [1] http://themonadreader.files.wordpress.com/2011/03/specialissue.pdf
On 15/03/2011 11:35 PM, Brent Yorgey wrote:
I am pleased to announce that the special Poetry and Fiction Edition of The Monad.Reader is now available [1]. Enjoy!
I love exercise 8, "write a complete computer game using this idea" (!)
Concerning this exercise, would it be simply possible to take the most of
lazy evaluation and build a graph?
A node would be:
Node a = Node { data :: a,
parents :: [Node a],
children :: [Node a] }
Then, whichever node you are on, you can still directly find its
predecessors, i.e. your way back in the labyrinth.
I find it more simple than a zipper (of course, now you cannot serialize it,
due to the cross-references).
2011/3/16 Andrew Coppin
On 15/03/2011 11:35 PM, Brent Yorgey wrote:
I am pleased to announce that the special Poetry and Fiction Edition of The Monad.Reader is now available [1]. Enjoy!
I love exercise 8, "write a complete computer game using this idea" (!)
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
On Wed, Mar 16, 2011 at 03:03:20PM +0100, Yves Parès wrote:
Concerning this exercise, would it be simply possible to take the most of lazy evaluation and build a graph?
A node would be: Node a = Node { data :: a, parents :: [Node a], children :: [Node a] }
Then, whichever node you are on, you can still directly find its predecessors, i.e. your way back in the labyrinth. I find it more simple than a zipper (of course, now you cannot serialize it, due to the cross-references).
This kind of "knot-tying" approach is nice for static graphs. However, update is quite complicated and definitely not constant time (you essentially have to rebuild the entire graph). A zipper allows O(1) updates to the current location. -Brent
On 16/03/2011 03:05 PM, Brent Yorgey wrote:
This kind of "knot-tying" approach is nice for static graphs.
I think we should have a wiki page somewhere which explains what all the various Haskell-related terms mean. Terms like "typing the knot" and "finally tagless". (Not to mention "Oleg rating"...)
Knot-tying has a page [1].
-deech
[1] http://www.haskell.org/haskellwiki/Tying_the_Knot
On Wed, Mar 16, 2011 at 10:42 AM, Andrew Coppin
On 16/03/2011 03:05 PM, Brent Yorgey wrote:
This kind of "knot-tying" approach is nice for static graphs.
I think we should have a wiki page somewhere which explains what all the various Haskell-related terms mean. Terms like "typing the knot" and "finally tagless". (Not to mention "Oleg rating"...)
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
On Wed, 16 Mar 2011 16:42:09 +0100, Andrew Coppin
On 16/03/2011 03:05 PM, Brent Yorgey wrote:
This kind of "knot-tying" approach is nice for static graphs.
I think we should have a wiki page somewhere which explains what all the various Haskell-related terms mean. Terms like "typing the knot" and "finally tagless". (Not to mention "Oleg rating"...)
I have created such a page: http://www.haskell.org/haskellwiki/Terms Regards, Henk-Jan van Tuyl -- http://Van.Tuyl.eu/ http://members.chello.nl/hjgtuyl/tourdemonad.html --
I think we should have a wiki page somewhere which explains what all the various Haskell-related terms mean. Terms like "typing the knot" and "finally tagless". (Not to mention "Oleg rating"...)
I have created such a page: http://www.haskell.org/haskellwiki/Terms
Defining "unlifted type" without defining "bottom" probably isn't very helpful. (I'm sure there's already a wiki page for it though...)
Andrew Coppin schrieb:
On 16/03/2011 03:05 PM, Brent Yorgey wrote:
This kind of "knot-tying" approach is nice for static graphs.
I think we should have a wiki page somewhere which explains what all the various Haskell-related terms mean. Terms like "typing the knot" and "finally tagless". (Not to mention "Oleg rating"...)
participants (6)
-
aditya siram -
Andrew Coppin -
Brent Yorgey -
Henk-Jan van Tuyl -
Henning Thielemann -
Yves Parès