Home » forums » LtU Forum

Help finding a (working ?) paper revisiting the Meijer-Fokkinga-Patterson classic

I remember reading a (probably unpublished) paper that re-worked the classic Functional Programming with Bananas, Lenses, Envelopes, and Barbed wire paper of Meijer, Fokkinga & Patterson, in Haskell. It simply noticed the original paper was notationally heavy,and tried to introduce the (cata|ana|hylo|para|...)morphisms using less symbols (though rarely less concepts), and with systematic code examples. I remember this paper had a single author, and I'm not sure it dealt with further extensions of the squiggol style.

Unfortunately, that's also about all I remember of the paper. Does this ring a bell for someone ? A pointer, maybe ?

By Francois Garillot at 2011-08-05 18:39 | LtU Forum | previous forum topic | next forum topic | other blogs | 5266 reads

Comment viewing options

Select your preferred way to display the comments and click "Save settings" to activate your changes.

Found it !

The paper I had in mind was Sorting morphisms, by Lex Augusteijn. Some other references share the same symbol-less approach to introducing recursion schemes:

By Francois Garillot at Fri, 2011-08-05 23:27 | login or register to post comments

Program Calculation Properties of Continuous Algebras

It's kind of going in the opposite direction to what you were asking for, but Fokkinga and Meijer's Program Calculation Properties of Continuous Algebras unpacks the fundamental constructions underlying the bananas paper. It was a big influence on me, and deserves to be better known.

By jeremygibbons at Sun, 2011-08-07 12:08 | login or register to post comments