Fast binding-time analysis for multi-level specialization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1181, Issue , 1996, Pages 261-272

  Glück, Robert ^a   Jørgensen, Jesper ^b  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

^b UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Functional languages; Generating extensions; Partial evaluation; Program analysis; Program transformation

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

FUNCTIONAL LANGUAGES; GENERATING EXTENSIONS; PARTIAL EVALUATION; PROGRAM ANALYSIS; PROGRAM TRANSFORMATIONS;

ARTIFICIAL INTELLIGENCE;

EID: 84955597134     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62064-8_22     Document Type: Conference Paper

References (21)

1. L.O. Andersen. Binding-time analysis and the taming of C pointers. In Partial Evaluation and Semantics-Based Program Manipulation, ACM Press, 1993.
2. L. Birkedal, M. Welinder. Binding-time analysis for Standard ML. Lisp and Symbolic Computation, 8(3): 191-208, 1995.
3. A. Bondorf. Automatic autoprojection of higher order recursive equations. Science of Computer Programming, 17(l-3):3-34, 1991.
4. A. Bondorf, J. Jørgensen. Efficient analyses for realistic off-line partial evaluation. J of Functional Programming, 3(3):315-346, 1993.
5. C. Consel. Binding time analysis for higher order untyped functional languages. In Conference on Lisp and Functional Languages. 264-272, ACM Press, 1990.
6. A. P. Ershov. On the essence of compilation. In E. J. Neuhold (ed.), Formal Description of Programming Concepts, 391-420. North-Holland, 1978.
7. R. Glück, J. Jørgensen. Generating optimizing specializers. In IEEE International Conference on Computer Languages, 183-194. 1994.
8. R. Glück, J. Jørgensen. Efficient multi-level generating extensions for program specialization. In M. Hermenegildo, S. D. Swierstra (eds.) Programming Languages, Implementations, Logics and Programs, LNCS 982, 259-278, Springer-Verlag, 1995.
9. C. K. Gomard. Partial type inference for untyped functional programs. In ACM Conference on Lisp and Functional Programming, 282-287, ACM Press, 1990.
10. C. K. Gomard, N. D. Jones. A partial evaluator for the untyped lambda calculus. J of Functional Programming, 1(1):21-69, 1991.
11. F. Henglein. Efficient type inference for higher-order binding-time analysis. In J. Hughes (ed.), Functional Programming and Computer Architecture, LNCS 523, 448-472, Springer-Verlag, 1991.
12. IEEE. Standard for the Scheme programming language, IEEE Std 1178-1990.
13. N. D. Jones, C. K. Gomard, P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice-Hall, 1993.
14. J. Jørgensen. Generating a compiler for a lazy language by partial evaluation. In Symposium on Principles of Programming Languages. 258-268, 1992.
15. F. Nielson, H. R. Nielson. Two-Level Functional Languages, volume 34 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1992.
16. F. Nielson, HI R. Nielson. Multi-level lambda-calculus: an algebraic description. In O. Danvy, R. Glück, P. Thiemann (eds.), Partial Evaluation. LNCS 1110, Springer-Verlag, 1996.
17. J. Palsberg, P. O'Keefe. A type system equivalent to flow analysis. TOPLAS, 17(4):576-599, 1995.
18. J. Rehof. Polymorphic dynamic typing. Master's thesis, Univ. of Copenhagen, Denmark, 1995.
19. R. Tarjan. Data Structures and Network Flow Algorithms, vol. CMBS 44 of Regional Conference Series in Applied Mathematics. SIAM, 1983.
20. P. Thiemann. Cogen in six lines. In International Conference on Functional Programming. 180-189, ACM Press, 1996.
21. M. Wand. Specifying the correctness of binding-time analysis. J of Functional Programming, 3(3):365-387, 1993.