Hinze, Ralf

Wu, Nicolas

Folds and unfolds have been understood as fundamental building blocks for total programming, and have been extended to form an entire zoo of specialised structured recursion schemes. A great number of these schemes were unified by the introduction of adjoint folds, but more exotic beasts such as recursion schemes from comonads proved to be elusive. In this paper, we show how the two canonical derivations of adjunctions from (co)monads yield recursion schemes of significant computational importance: monadic catamorphisms come from the Kleisli construction, and more astonishingly, the elusive recursion schemes from comonads come from the Eilenberg-Moore construction. Thus we demonstrate that adjoint folds are more unifying than previously believed.<br/

Explore Bristol Research

Unifying Structured Recursion Schemes

https://research-information.bris.ac.uk/files/65842535/Nicolas_Wu_Unifying_Structured_Recursion_Schemes.pdf

Unifying Structured Recursion Schemes

Abstract

Similar works

Full text

Available Versions

Explore Bristol Research