Lambda the Ultimate

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 ?