When is a function a fold or an unfold (2001)

by Jeremy Gibbons , Graham Hutton , Thorsten Altenkirch
Venue:Coalgebraic Methods in Computer Science, number 44.1 in Electronic Notes in Theoretical Computer Science
Citations:9 - 3 self

Active Bibliography

2 Program fusion with paramorphisms – Facundo Domínguez, Alberto Pardo - 2006
14 Fusion of Recursive Programs with Computational Effects – Alberto Pardo - 2000
40 Google’s MapReduce Programming Model — Revisited – Ralf Lämmel
3 Constructively characterizing fold and unfold – Tjark Weber, James Caldwell - 2003
33 A Calculational Fusion System HYLO – Yoshiyuki Onoue, Zhenjiang Hu, Hideya Iwasaki, Masato Takeichi - 1997
4 An Extension Of The Acid Rain Theorem – Zhenjiang Hu, Hideya Iwasaki, Masato Takeichi - 1996
12 Proof Methods for Structured Corecursive Programs – Jeremy Gibbons, Graham Hutton - 1999
Exploiting algebra/coalgebra duality for program fusion extensions – Facundo Domínguez, Alberto Pardo - 2011
60 A tutorial on the universality and expressiveness of fold – Graham Hutton - 1999
33 Tupling Calculation Eliminates Multiple Data Traversals – Zhenjiang Hu, Hideya Iwasaki, Masato Takeichi, Akihiko Takano - 1997
15 Declarative Program Transformation: a Deforestation case-study – Loïc Correnson, Etienne Duris, Didier Parigot, Gilles Roussel - 1999
23 Warm Fusion in Stratego: A Case Study in Generation of Program Transformation Systems – Patricia Johann, Eelco Visser - 2000
The Under-Performing Unfold A new approach to optimising corecursive programs – Jennifer Hackett, Graham Hutton, Mauro Jaskelioff
2 Towards polytypic parallel programming – Zhenjiang Hu, Masato Takeichi, Hideya Iwasaki - 1998
Theoretical Foundations for Practical ‘Totally Functional Programming’ – Colin Kemp - 2007
Generic Accumulations for Program Calculation – Mauro Jaskelioff - 2004
3 Recursion Schemes for Dynamic Programming – Jevgeni Kabanov, Varmo Vene
1 The expression lemma ⋆ – Ralf Lämmel, Ondrej Rypacek
Draft, submitted for review Conjugate Hylomorphisms Or: The Mother of All Structured Recursion Schemes – Ralf Hinze, Nicolas Wu, Jeremy Gibbons