The under-appreciated unfold

DOI10.1145/289423.289455zbMath1369.68099OpenAlexW1963928257MaRDI QIDQ5348903

Geraint Jones, Jeremy Gibbons

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: https://doi.org/10.1145/289423.289455

zbMATH Keywords

functional programmingfoldunfoldanamorphismprogram calculationtraversalco-inductionbreadth-firstlevel-order

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Data structures (68P05)

Related Items

Imperative abstractions for functional actions, Programming language semantics: It’s easy as 1,2,3, Breadth-first traversal via staging, A Duality of Sorts, When is a function a fold or an unfold?, Fusion of recursive programs with computational effects, Algebras for combinatorial search, Adapting functional programs to higher order logic, Two extensions of system F with (co)iteration and primitive (co)recursion principles