Eliminating intermediate lists in pH

The author hereby grants to MIT permission to reproduce and distribute publicly paper and electronic copies of this thesis and to grant others the right to do so.

[1]  Masato Takeichi,et al.  A calculational fusion system HYLO , 1997, Algorithmic Languages and Calculi.

[2]  Leonidas Fegaras.  Fusion for Free , 1996 .

[3]  Jan-Willem Maessen,et al.  Eliminating Intermediate Lists in pH using Local Transformations , 1994 .

[4]  Richard S. Bird,et al.  Algebra of programming , 1997, Prentice Hall International series in computer science.

[5]  Maarten M. Fokkinga,et al.  Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire , 1991, FPCA.

[6]  Richard S. Bird,et al.  An introduction to the theory of lists , 1987 .

[7]  Jan-Willem Maessen,et al.  Simplifying Parallel List Traversal Simplifying Parallel List Traversal , 1995 .

[8]  Lennart Augustsson,et al.  PH Language Reference Manual, Version 1.0---preliminary , 1995 .

[9]  Erik Poll,et al.  Algebra of Programming by Richard Bird and Oege de Moor, Prentice Hall, 1996 (dated 1997). , 1999 .

[10]  Jeremy Gibbons,et al.  The under-appreciated unfold , 1998, ICFP '98.

[11]  Olaf Chitil,et al.  Typer inference builds a short cut to deforestation , 1999, ICFP '99.

[12]  Masato Takeichi,et al.  Deriving structural hylomorphisms from recursive definitions , 1996, ICFP '96.

[13]  Andrew John Gill,et al.  Cheap deforestation for non-strict functional languages , 1996 .

[14]  Masato Takeichi,et al.  Towards Manipulation of Mutually Recursive Functions , 1998, Fuji International Symposium on Functional and Logic Programming.

[15]  John Launchbury,et al.  Warm fusion: deriving build-catas from recursive definitions , 1995, FPCA '95.

[16]  Mark P. Jones,et al.  Functional Programming with Overloading and Higher-Order Polymorphism , 1995, Advanced Functional Programming.

[17]  Richard S. Bird,et al.  Relational program derivation and context-free language recognition , 1994 .

[18]  Akihiko Takano,et al.  Program transformation in calculational form , 1998, CSUR.

[19]  Olaf Chitil,et al.  Type-Inference Based Short Cut Deforestation (Nearly) without Inlining , 1999, IFL.

[20]  Akihiko Takano,et al.  Shortcut deforestation in calculational form , 1995, FPCA '95.

[21]  Joyce L. Vedral,et al.  Functional Programming Languages and Computer Architecture , 1989, Lecture Notes in Computer Science.

[22]  Alberto Pardo,et al.  Fusion of recursive programs with computational effects , 2001, Theor. Comput. Sci..

[23]  Simon L. Peyton Jones,et al.  A short cut to deforestation , 1993, FPCA '93.

[24]  Philip Wadler,et al.  Theorems for free! , 1989, FPCA.

[25]  Wei-Ngan Chin,et al.  Parallelization in calculational forms , 1998, POPL '98.