Studying Wadler's "Comprehending Monads" and "Theorems for free!",
I've been unable to derive law (iv) and I'm not sure about (iii). Will
appreciate a pointer to similar examples or a massive hint. Here's my
attempt at (iii):
map f . unit x = map f [x]
= [f x]
Thanks for the info; that's good to know. The ICFP '01 version uses pairs;
not sure when the other came out or where.
On Wed, Aug 24, 2011 at 4:46 PM, wren ng thornton wrote:
> On 8/24/11 5:03 PM, Armando Blancas wrote:
>
>>
>>> I didn't see that clai
>
> > I didn't see that claim in the linked slides, and it's not Haskell '98
> (nor
> > Haskell 2010).
I didn't realize it linked to the slides; I thought that pointed to the
article. I just found another version of the paper, A Simple Implementation
Technique for Priority Search Queues, by Hinze
Studying the paper *A Simple Implementation for Priority Search Queues*, by
Ralf Hinze, I came across the following syntax that I didn't understand and
I couldn't use in GHCi 7.0.3 for defining a binding data type (page 3):
Bindings are represented by the following data type:
*data k -> p = k -> p
