Generalized partial computation for a lazy functional language

[1]  Anders Bondorf,et al.  Automatic Autoprojection of Higher Order Recursive Equations , 1990, Sci. Comput. Program..

[2]  Philip Wadler,et al.  Projections for strictness analysis , 1987, FPCA.

[3]  Charles Consel,et al.  New Insights into Partial Evaluation: the SCHISM Experiment , 1988, ESOP.

[4]  Valentin F. Turchin,et al.  The concept of a supercompiler , 1986, TOPL.

[5]  Lennart Augustsson,et al.  Compiling Pattern Matching , 1985, FPCA.

[6]  Yoshihiko Futamura.  Program Evaluation and Generalized Partial Computation , 1988, FGCS.

[7]  Philip Wadler,et al.  Backwards Strictness Analysis: Proved and Improved , 1989, Functional Programming.

[8]  Annalisa Bossi,et al.  A method for specializing logic programs , 1990, TOPL.

[9]  Sergei A. Romanenko.  Arity Raiser and its Use in Program Specialization , 1990, ESOP.

[10]  John Launchbury.  Dependent Sums Express Separation of Binding Times , 1989, Functional Programming.

[11]  Neil D. Jones,et al.  Mix: A self-applicable partial evaluator for experiments in compiler generation , 1989, LISP Symb. Comput..

[12]  Yoshihiko Futamura,et al.  Essence of Generalized Partial Computation , 1991, Theor. Comput. Sci..

[13]  Geoffrey L. Burn.  A relationship between abstract interpretation and projection analysis , 1989, POPL '90.

[14]  Philip Wadler,et al.  Deforestation: Transforming Programs to Eliminate Trees , 1990, Theor. Comput. Sci..

[15]  Peter Sestoft,et al.  An experiment in partial evaluation: the generation of a compiler generator , 1985, SIGP.

[16]  John Darlington,et al.  A Transformation System for Developing Recursive Programs , 1977, J. ACM.