When is a function a fold or an unfold?

DOI10.1016/S1571-0661(04)80906-XzbMath1260.68096OpenAlexW2167373162WikidataQ61583967 ScholiaQ61583967MaRDI QIDQ4917036

Jeremy Gibbons, G. Hutton, Thorsten Altenkirch

Publication date: 26 April 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1571-0661(04)80906-x

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

Kernels, in a nutshell ⋮ Towards a linear algebra of programming ⋮ From Grammars and Automata to Algebras and Coalgebras

Uses Software

• Haskell
• QuickCheck

Cites Work

• Data structures and program transformation
• Deforestation: Transforming programs to eliminate trees
• Paramorphisms
• Coalgebraic methods in computer science, CMCS '98. Proceedings of the 1st workshop, Lisbon, Portugal, March 28--29, 1998
• Extracting and implementing list homomorphisms in parallel program development
• Deriving structural hylomorphisms from recursive definitions
• A tutorial on the universality and expressiveness of fold
• The under-appreciated unfold
• Fold and unfold for program semantics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: When is a function a fold or an unfold?