When is a function a fold or an unfold?

DOI10.1016/S1571-0661(04)80906-XMaRDI QIDQ4917036zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Jeremy Gibbons, Graham 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

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

Recommendations

• Logic Based Program Synthesis and Transformation
• Fold and unfold for program semantics
• Fold and unfold for program semantics
• Theory and applications of inverting functions as folds
• scientific article; zbMATH DE number 2090028

Cites work

• A tutorial on the universality and expressiveness of fold
• Coalgebraic methods in computer science, CMCS '98. Proceedings of the 1st workshop, Lisbon, Portugal, March 28--29, 1998
• Data structures and program transformation
• Deforestation: Transforming programs to eliminate trees
• Deriving structural hylomorphisms from recursive definitions
• Extracting and implementing list homomorphisms in parallel program development
• Fold and unfold for program semantics
• Functional programming with apomorphisms (corecursion)
• scientific article; zbMATH DE number 977284 (Why is no real title available?)
• scientific article; zbMATH DE number 1064116 (Why is no real title available?)
• scientific article; zbMATH DE number 1552770 (Why is no real title available?)
• scientific article; zbMATH DE number 1380900 (Why is no real title available?)
• scientific article; zbMATH DE number 2087343 (Why is no real title available?)
• scientific article; zbMATH DE number 2087345 (Why is no real title available?)
• scientific article; zbMATH DE number 3367095 (Why is no real title available?)
• Paramorphisms
• Proof methods for corecursive programs
• The under-appreciated unfold

Cited in

(16)

• See more through lenses than bananas
• Theory and applications of inverting functions as folds
• Towards a linear algebra of programming
• Kernels, in a nutshell
• When is a function not flat
• When is a functional program not a functional program?
• From grammars and automata to algebras and coalgebras
• scientific article; zbMATH DE number 177790 (Why is no real title available?)
• scientific article; zbMATH DE number 2090028 (Why is no real title available?)
• A tutorial on the universality and expressiveness of fold
• Coroutining folds with hyperfunctions
• The under-appreciated unfold
• Fold and unfold for program semantics
• The under-appreciated unfold
• Fold and unfold for program semantics
• Logic Based Program Synthesis and Transformation

Describes a project that uses

Uses Software

• Haskell
• QuickCheck

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

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