Efficient analyses for realistic off-line partial evaluation

Journal of Functional Programming

Volumn 3, Issue 3, 1993, Pages 315-346

  Bondorf, Anders ^a   Jorgensen, Jesper ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85010922848     PISSN: 09567968     EISSN: 14697653     Source Type: Journal    
DOI: 10.1017/S0956796800000769     Document Type: Article

References (20)

1. Bondorf, Anders. (1991a) Automatic autoprojection of higher order recursive equations. Science of computer programming„ 17(1-3), 3–34. Revision of paper in ESOP’90, LNCS 432, May 1990.
2. Bondorf, Anders. (1991b) (Sept.). Similix Manual, system version 4.0. DIKU, University of Copenhagen, Denmark.
3. Bondorf, Anders. (1992) (June). Improving binding times without explicit cps-conversion. Pages 1–10 of: 1992 ACM Conference on Lisp and Functional Programming. San Francisco, California. LISP Pointers V, 1.
4. Bondorf, Anders, & Danvy, Olivier. (1991) Automatic autoprojection of recursive equations with global variables and abstract data types. Science of computer programming, 16,151-195.
5. Bondorf, Anders, & Jorgensen, Jesper. (1993) Efficient analyses for realistic off-line partial evaluation: extended version. Tech. rept. 93/4. DIKU, University of Copenhagen, Denmark.
6. Consel, Charles. (1990) (June). Binding time analysis for higher order untyped functional languages. Pages 264–272 of: 1990 ACM Conference on Lisp and Functional Programming. Nice, France.
7. Gomard, Carsten K., & Jones, Neil D. (1991) A partial evaluator for the untyped lambda-calculus. Journal of functional programming, 1(1), 21–69.
8. Henglein, Fritz. (1991) Efficient type inference for higher-order binding-time analysis. Pages 448–472 of: Hughes, John (ed), Conference on Functional Programming and Computer Architecture, Cambridge, Massachusetts. Lecture Notes in Computer Science 523. Springer-Verlag.
9. Henglein, Fritz. (1992) (Mar.). Simple closure analysis. Working note.
10. Holst, Carsten Kehler. (1988) (Aug.). Poor man's generalization. Working note. IEEE standard for the Scheme programming language. IEEE Std 1178–1990. (1990) May.
11. Jones, Neil D., Sestoft, Peter, & Sondergaard, Harald. (1985) An experiment in partial evaluation: the generation of a compiler generator. Pages 124–140 of: Jouannaud, Jean-Pierre (ed), Rewriting Techniques and Applications, Dijon, France. Lecture Notes in Computer Science 202. Springer-Verlag.
12. Jones, Neil D., Sestoft, Peter, & Sondergaard, Harald. (1989) MIX: a self-applicable partial evaluator for experiments in compiler generation. Lisp and symbolic computation, 2(1), 9–50.
13. Jorgensen, Jesper. (1992) (Jan.). Generating a compiler for a lazy language by partial evaluation. Pages 258–268 of: Nineteenth Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages. Albuquerque, New Mexico.
14. Katz, Morry, & Weise, Daniel. (1992) (June). Towards a new perspective on partial evaluation. Pages 29–37 of: ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation, San Francisco, California. Yale University, report YALEU/DCS/RR-909.
15. Launchbury, John. (1991) Projection factorisations in partial evaluation. Distinguished Dissertations in Computer Science. Cambridge University Press.
16. Nielson, Hanne R., & Nielson, Flemming. (1988) Automatic binding time analysis for a typed λ-calculus. Pages 98–106 of: Fifteenth Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages. San Diego, California.
17. Palsberg, Jens. (1993) Correctness of binding time analysis. Journal of functional programming, special issue on partial evaluation.
18. Schmidt, David A. (1988) Static properties of partial evaluation. Pages 465–483 of: Bjorner, Dines, Ershov, Andrei P., & Jones, Neil D. (eds), Partial Evaluation and Mixed Computation. North-Holland.
19. Sestoft, Peter. (1988) (Student Report 88-7-2, October). Replacing function parameters by global variables. M.Phil. thesis, DIKU, University of Copenhagen, Denmark.
20. Wand, Mitchell. (1993) Specifying the correctness of binding-time analysis. Journal of functional programming, special issue on partial evaluation.