Making Recursions Manipulable by Constructing Medio-types (1995)

by Zhenjiang Hu , Hideya Iwasaki , Masato Takeichi
Venue:University of Tokyo
Citations:2 - 2 self

Documents Related by Co-Citation

60 Safe fusion of functional expressions – Wei-Ngan Chin - 1992
25 Improving Programs which Recurse over Multiple Inductive Structures – Leonidas Fegaras, Tim Sheard, Tong Zhou - 1994
97 and Order in Algorithmics – Law - 1992
72 Warm Fusion: Deriving Build-Catas from Recursive Definitions – John Launchbury, Tim Sheard - 1995
299 Programming with bananas, lenses, envelopes and barbed wire – Erik Meijer, Maarten Fokkinga, Ross Paterson - 1991
113 A Fold for All Seasons – Tim Sheard , Leonidas Fegaras - 1993
193 A Short Cut to Deforestation – Andrew Gill, John Launchbury, Simon L Peyton Jones - 1993
91 Shortcut Deforestation in Calculational Form – Akihiko Takano, Erik Meijer - 1995
46 Deriving Structural Hylomorphisms From Recursive Definitions – Zhenjiang Hu, Hideya Iwasaki, Masato Takeichi - 1996
326 Theorems for free! – Philip Wadler - 1989
403 Deforestation: Transforming programs to eliminate trees – Philip Wadler - 1990
8 Algebraic design language – R B Kieburtz, J Lewis - 1994
9 Partial parametrization eliminates multiple traversals of data structures – M Takeichi - 1987
2 Transforming programs to eliminate trees – Deforestation - 1988
12 Relational Program Derivation and Context–free Language Recognition – R Bird, O de Moor - 1995
105 Data structures and program transformation – G Malcolm - 1990