Deriving Structural Hylomorphisms From Recursive Definitions (1996)

by Zhenjiang Hu , Hideya Iwasaki , Masato Takeichi
Venue:In ACM SIGPLAN International Conference on Functional Programming
Citations:46 - 17 self

Documents Related by Co-Citation

299 Programming with bananas, lenses, envelopes and barbed wire – Erik Meijer, Maarten Fokkinga, Ross Paterson - 1991
193 A Short Cut to Deforestation – Andrew Gill, John Launchbury, Simon L Peyton Jones - 1993
113 A Fold for All Seasons – Tim Sheard , Leonidas Fegaras - 1993
72 Warm Fusion: Deriving Build-Catas from Recursive Definitions – John Launchbury, Tim Sheard - 1995
91 Shortcut Deforestation in Calculational Form – Akihiko Takano, Erik Meijer - 1995
403 Deforestation: Transforming programs to eliminate trees – Philip Wadler - 1990
574 A Transformation System for Developing Recursive Programs – R. M. Burstall, John Darlington - 1977
60 Safe fusion of functional expressions – Wei-Ngan Chin - 1992
97 and Order in Algorithmics – Law - 1992
64 Cheap Deforestation for Non-strict Functional Languages – Andrew John Gill, Andrew John Gill - 1996
215 An introduction to the theory of lists – R S Bird - 1987
33 Tupling Calculation Eliminates Multiple Data Traversals – Zhenjiang Hu, Hideya Iwasaki, Masato Takeichi, Akihiko Takano - 1997
105 Data structures and program transformation – G Malcolm - 1990
326 Theorems for free! – Philip Wadler - 1989
95 Bananas in Space: Extending Fold and Unfold to Exponential Types – Erik Meijer, Graham Hutton - 1995
75 Parametric Polymorphism and Operational Equivalence – Andrew M. Pitts - 2000
54 Revisiting Catamorphisms over Datatypes with Embedded Functions (or, Programs from Outer Space) – Leonidas Fegaras, Tim Sheard - 1996
73 Towards an automated tupling strategy – Wei-Ngan Chin - 1993
25 Type Inference Builds a Short Cut to Deforestation – Olaf Chitil - 1999