Conjugate Hylomorphisms -- Or: The Mother of All Structured Recursion Schemes

Reference. Conjugate Hylomorphisms -- Or: The Mother of All Structured Recursion Schemes

Ralf Hinze, Nicolas Wu, Jeremy Gibbons · POPL · 2015 · program-calculation · PDF · DOI · pldb

Cite

Cite as @hinze-2015-conjugate (helia, typst) · \cite{hinze-2015-conjugate} (LaTeX)

BibTeX

bibtex · 1 line

@inproceedings{hinze-2015-conjugate, series={POPL ’15}, title={Conjugate Hylomorphisms -- Or: The Mother of All Structured Recursion Schemes}, url={http://dx.doi.org/10.1145/2676726.2676989}, DOI={10.1145/2676726.2676989}, booktitle={Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages}, publisher={ACM}, author={Hinze, Ralf and Wu, Nicolas and Gibbons, Jeremy}, year={2015}, month=Jan, pages={527–538}, collection={POPL ’15} }

hayagriva YAML (typst)

yaml · 19 lines

hinze-2015-conjugate:
  type: article
  title: 'Conjugate Hylomorphisms – Or: The Mother of All Structured Recursion Schemes'
  author:
  - Hinze, Ralf
  - Wu, Nicolas
  - Gibbons, Jeremy
  date: 2015-01
  page-range: 527-538
  url: http://dx.doi.org/10.1145/2676726.2676989
  serial-number:
    doi: 10.1145/2676726.2676989
  parent:
    type: proceedings
    title: Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
    publisher: ACM
    parent:
      type: proceedings
      title: POPL ’15

Download: hinze-2015-conjugate.bib · hinze-2015-conjugate.yml

Cited by (1)

Fantastic Morphisms and Where to Find Them: A Guide to Recursion Schemes yang-2022-fantasticMPC · 2022

DOI · arXiv

Cites 32 works (1 here)

With notes (1)

Adjoint folds and unfolds—An extended study hinze-2013-adjointSCP · 2013

DOI

External (31)

Histo- and dynamorphisms revisited (2013)
Unifying structured recursion schemes (2013)
The Recursion Scheme from the Cofree Recursive Comonad (2011)
Recursive coalgebras of finitary functors (2007)
Datatype-Generic Termination Proofs (2007)
Recursive coalgebras from comonads (2006)
Recursion Schemes for Dynamic Programming (2006)
Completely iterative algebras and completely iterative monads (2005)
Generic accumulations (2002)
Recursion schemes from comonads (2001)
Coding recursion à la Mendler (2000)
Generalised folds for nested datatypes (1999)
Coalgebra-to-Algebra Morphisms (1999)
Practical Foundations of Mathematics (1999)
Primitive (co)recursion and course-of-value (co)iteration, categorically (1999)
Categories for the Working Mathematician (1998)
Functional programming with apomorphisms (corecursion) (1998)
Algebra of Programming (1997)
Deriving structural hylomorphisms from recursive definitions (1996)
Categorical fixed point calculus (1995)
Paramorphisms (1992)
Algebraically complete categories (1991)
Functional programming with bananas, lenses, envelopes and barbed wire (1991)
Tupling and mutumorphisms (1990)
Data structures and program transformation (1990)
Algebraic data types and program transformation (1990)
Category theoretic approach to data types (1987)
Categorical set theory: A characterization of the category of sets (1974)
Notes on data structuring (1972)
A fixpoint theorem for complete categories (1968)
Adjoint functors (1958)