Fantastic Morphisms and Where to Find Them: A Guide to Recursion Schemes
Zhixuan Yang, Nicolas Wu

TL;DR
This paper provides a practical overview of structured recursion schemes, including their generalizations and categorical duals, with programming examples to make the concepts accessible beyond category theory experts.
Contribution
It introduces and explains various recursion schemes and their duals through concrete programming contexts, bridging theory and practice.
Findings
Multiple recursion schemes are motivated with programming examples
Categorical duals of recursion schemes are explained
Provides accessible explanations for practitioners without category theory background
Abstract
Structured recursion schemes have been widely used in constructing, optimising, and reasoning about programs over inductive and coinductive datatypes. Their plain forms, catamorphisms and anamorphisms, are restricted in expressiveness. Thus many generalisations have been proposed, which further lead to several unifying frameworks of structured recursion schemes. However, the existing work on unifying frameworks typically focuses on the categorical foundation, and thus is perhaps inaccessible to practitioners who are willing to apply recursion schemes in practice but are not versed in category theory. To fill this gap, this expository paper introduces structured recursion schemes from a practical point of view: a variety of recursion schemes are motivated and explained in contexts of concrete programming examples. The categorical duals of these recursion schemes are also explained.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Logic, programming, and type systems · Software Engineering Research
