Peter Verswyvelen wrote:
After my colleague explained me about zippers and how one could derive the
datatype using differential rules, I had to read about it.
So I started reading
http://en.wikibooks.org/wiki/Haskell/Zippers#Mechanical_Differentiation
This page contains the sentence:
On Thu, Jul 16, 2009 at 12:11 PM, Heinrich
Apfelmusapfel...@quantentunnel.de wrote:
Generic Programming: An introduction
http://www.cse.chalmers.se/~patrikj/poly/afp98/
It's a bit verbose at times, but you only need the first few chapters to
get an idea about polynomial functors (sums
Matthias Görgens matthias.goerg...@googlemail.com writes:
doesn't make much sense to me yet, although I suspect I can read the mu as a
lambda on types?
Not really. The mu has more to do with recursion.
I'd say it's entirely to do with recursion. It's like the Y combinator
(or fix) for
