Unifying structured recursion schemes. An extended study

DOI10.1017/S0956796815000258MaRDI QIDQ5371980zbMATH OpenFDO

Authors Ralf Hinze, Nicolas Wu

Publication date 23 October 2017

Published in Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0956796815000258

Mathematics Subject Classification ID

Eilenberg-Moore and Kleisli constructions for monads (18C20) Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)

Recommendations

• Unifying structured recursion schemes
• Adjoint folds and unfolds. Or: Scything through the thicket of morphisms
• Conjugate hylomorphisms -- or: the mother of all structured recursion schemes
• Recursion schemes from comonads
• Generic programming with adjunctions

Cites work

• A fixpoint theorem for complete categories
• Adjoint Functors
• Adjoint functors and triples
• Categorical fixed point calculus
• Comonadic notions of computation
• Conjugate hylomorphisms -- or: the mother of all structured recursion schemes
• Data structures and program transformation
• Every Standard Construction is Induced by a Pair of Adjoint Functors
• Functional programming with apomorphisms (corecursion)
• Generalised coinduction
• Generalised folds for nested datatypes
• Generic downwards accumulations
• Homotopy theory in general categories
• scientific article; zbMATH DE number 1216133 (Why is no real title available?)
• scientific article; zbMATH DE number 1343506 (Why is no real title available?)
• scientific article; zbMATH DE number 977284 (Why is no real title available?)
• scientific article; zbMATH DE number 2100544 (Why is no real title available?)
• scientific article; zbMATH DE number 1400097 (Why is no real title available?)
• scientific article; zbMATH DE number 3296291 (Why is no real title available?)
• scientific article; zbMATH DE number 3414497 (Why is no real title available?)
• Inductive types and type constraints in the second-order lambda calculus
• Kleisli and Eilenberg-Moore constructions as parts of biadjoint situations
• Paramorphisms
• Proving the unique fixed-point principle correct: an adventure with category theory
• Recursion schemes from comonads
• Recursive coalgebras from comonads
• Substitution in non-wellfounded syntax with variable binding
• The Recursion Scheme from the Cofree Recursive Comonad
• Unifying structured recursion schemes

Cited in

(7)

• Unraveling recursion: compiling an IR with recursion to System F
• Recursion schemes from comonads
• Conjugate hylomorphisms -- or: the mother of all structured recursion schemes
• Adjoint folds and unfolds. Or: Scything through the thicket of morphisms
• Generic programming with adjunctions
• Unifying structured recursion schemes
• Fantastic morphisms and where to find them. A guide to recursion schemes

This page was built for publication: Unifying structured recursion schemes. An extended study

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5371980)