[Haskell-cafe] Higher-order algorithms

Stephen Tetley stephen.tetley at gmail.com
Tue Aug 24 02:13:27 EDT 2010


On 23 August 2010 14:03, Eugene Kirpichov <ekirpichov at gmail.com> wrote:

> Do there exist other nontrivial higher-order algorithms and datastructures?
> Is the field of higher-order algorithms indeed as unexplored as it seems?

Aren't higher order algorithms "functional pearls"? :-)

You might find Olivier Danvy and Michael Spivey's "On Barron and
Strachey’s Cartesian Product Function" (subtitle "Possibly the world’s
first functional pearl") a interesting read - BRICS Tech Report
RS-07-14.

Olivier Danvy has a lot of work on defunctionalization and
refunctionalization which may be relevant at the "meta level".

http://www.brics.dk/~danvy/
http://www.brics.dk/RS/07/14/BRICS-RS-07-14.pdf


More information about the Haskell-Cafe mailing list