adventures in uncertainty: An Introduction to Recursion Schemes

2014-02-15 In 1991, Erik Meijer, Maarten Fokkinga, and Ross Paterson published their now-classic paper Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire. Though this paper isn’t widely known outside of the functional programming community, its contributions are astonishing: the authors use category theory to express a set of simple, composable combinators, called recursion sch

[ilyaletre]

このFixedpointなデータ自身がFunctorの性質を持ってるとFreeとかになっていきそう。