Unifying structured recursion schemes

DOI10.1017/S0956796815000258zbMath1420.68039MaRDI QIDQ5371980

Ralf Hinze, Nicolas Wu

Publication date: 23 October 2017

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

Mathematics Subject Classification ID

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

Related Items

Fantastic morphisms and where to find them. A guide to recursion schemes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Substitution in non-wellfounded syntax with variable binding
• Data structures and program transformation
• Homotopy theory in general categories
• Paramorphisms
• Generic downwards accumulations
• Generalised folds for nested datatypes
• Recursive coalgebras from comonads
• Adjoint functors and triples
• A fixpoint theorem for complete categories
• Inductive types and type constraints in the second-order lambda calculus
• Conjugate Hylomorphisms -- Or
• Comonadic Notions of Computation
• Adjoint Functors
• Generalised coinduction
• Categorical fixed point calculus
• The Recursion Scheme from the Cofree Recursive Comonad
• Proving the unique fixed-point principle correct
• Unifying structured recursion schemes
• Every Standard Construction is Induced by a Pair of Adjoint Functors