Fold and unfold for program semantics

DOI10.1145/289423.289457MaRDI QIDQ5348904zbMATH OpenOpenAlexFDO

Authors Graham Hutton

Publication date 21 August 2017

Published in Proceedings of the third ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL http://eprints.nottingham.ac.uk/230/

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Recommendations

• Fold and unfold for program semantics
• Logic Based Program Synthesis and Transformation
• When is a function a fold or an unfold?
• A tutorial on the universality and expressiveness of fold
• scientific article; zbMATH DE number 3924119

Cited in

(16)

• Programs for cheap!
• Logic Based Program Synthesis and Transformation
• When is a function a fold or an unfold?
• A tutorial on the universality and expressiveness of fold
• Fusion of recursive programs with computational effects
• Constructing language processors with algebra combinators
• Nondeterministic Folds
• Fold and unfold for program semantics
• Chromar, a language of parameterised agents
• Programming language semantics: It’s easy as 1,2,3
• Adjoint folds and unfolds. Or: Scything through the thicket of morphisms
• scientific article; zbMATH DE number 4106298 (Why is no real title available?)
• scientific article; zbMATH DE number 1088019 (Why is no real title available?)
• Modularity and implementation of mathematical operational semantics
• Tail recursion through universal invariants
• Unfolding for CHR programs

This page was built for publication: Fold and unfold for program semantics

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