Implementing multi-stage languages using ASTs, gensym, and reflection

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

Volumn 2830, Issue , 2003, Pages 57-76

  Calcagno, Cristiano ^a   Taha, Walid ^b   Huang, Liwen ^c   Leroy, Xavier ^d  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b RICE UNIVERSITY   (United States)

^c YALE UNIVERSITY   (United States)

^d INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; PROBLEM ORIENTED LANGUAGES; PROGRAM COMPILERS; TREES (MATHEMATICS); XML;

ABSTRACT SYNTAX TREES; BYTECODES; CURRENT PERFORMANCE; DOMAIN SPECIFIC LANGUAGES; MULTI STAGE;

COMPUTATIONAL LINGUISTICS;

EID: 35248851156     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39815-8_4     Document Type: Article

References (49)

1. BAWDEN, A. Quasiquotation in LISP. In Proceedings of the Workshop on Partial Evaluation and Semantics-Based Program Manipulation (San Antonio, 1999), O. Danvy, Ed., University of Aarhus, Dept. of Computer Science, pp. 88-99. Invited talk.
2. BENAISSA, Z. E.-A., MOGGI, E., TAHA, W., AND SHEARD, T. Logical modalities and multi-stage programming. In Federated Logic Conference (FLoC) Satellite Workshop on Intuitionistic Modal Logics and Applications (IMLA) (1999).
3. CALCAGNO, C., AND MOGGI, E. Adequacy and correctness for two-level languages. (Unpublished manuscript), 1998.
4. CALGAGNO, C., AND MOGGI, E. Multi-stage imperative languages: A conservative extension result. In [41] (2000), pp. 92-107.
5. CALCAGNO, C., MOGGI, E., AND SHEARD, T. Closed types for a safe imperative MetaML. Journal of Functional Programming (2003). To appear.
6. CALCAGNO, C., MOGGI, E., AND TAHA, W. Closed types as a simple approach to safe imperative multi-stage programming. In the International Colloquium on Automata, Languages, and Programming (ICALP '00) (Geneva, 2000), vol. 1853 of Lecture Notes in Computer Science, Springer-Verlag, pp. 25-36.
7. CLINGER, W., AND REES, J. Macros that work. In In proceedings of the ACM Symposium on Principles of Programming Languages (POPL) (Orlando, 1991), ACM Press, pp. 155-162.
8. CONSEL, C., AND NOËL, F. A general approach for run-time specialization and its application to C. In In proceedings of the ACM Symposium on Principles of Programming Languages (POPL) (St. Petersburg Beach, 1996), pp. 145-156.
9. CONSEL, C., PU, C., AND WALPOLE, J. Incremental specialization: The key to high performance, modularity, and portability in operating systems. In Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation (New York, 1993), ACM Press, pp. 44-16.
10. DANVY, O., AND MALMKJÆR, K. Intensions and extensions in a reflective tower. In Proceedings of the 1988 ACM Conference on LISP and Functional Programming (1988), ACM Press, pp. 327-341.
11. DAVIES, R. A temporal-logic approach to binding-time analysis. In the Symposium on Logic in Computer Science (LICS '96) (New Brunswick, 1996), IEEE Computer Society Press, pp. 184-195.
12. DAVIES, R., AND PFENNING, F. A modal analysis of staged computation. In the Symposium on Principles of Programming Languages (POPL '96) (St. Petersburg Beach, 1996), pp. 258-270.
13. DYBVIG, R. K., HIEB, R., AND BRUGGEMAN, C. Syntactic abstraction in Scheme. Lisp and Symbolic Computation 5, 4 (Dec. 1992), 295-326.
14. FILINSKI, A. A semantic account of type-directed partial evaluation. In Principles and Practice of Declarative Programming (PPDP) (1999), vol. 1702 of Lecture Notes in Computer Science, Springer-Verlag, pp. 378-395.
15. FILINSKI, A. Normalization by evaluation for the computational lambda-calculus. In Typed Lambda Calculi and Applications: 5th International Conference (TLCA) (2001), vol. 2044 of Lecture Notes in Computer Science, Springer-Verlag, pp. 151-165.
16. GANZ, S., SABRY, A., AND TAHA, W. Macros as multi-stage computations: Type-safe, generative, binding macros in MacroML. In the International Conference on Functional Programming (ICFP '01) (Florence, Italy, September 2001), ACM.
17. GLÜCK, R., AND JØRGENSEN, J. Efficient multi-level generating extensions for program specialization. In Programming Languages: Implementations, Logics and Programs (PULP'95) (1995), S. D. Swierstra and M. Hermenegildo, Eds., vol. 982 of Lecture Notes in Computer Science, Springer-Verlag, pp. 259-278.
18. GLÜCK, R., AND JØRGENSEN, J. Fast binding-time analysis for multi-level specialization. In Perspectives of System Informatics (1996), D. Bjørner, M. Broy, and I. V. Pottosin, Eds., vol. 1181 of Lecture Notes in Computer Science, Springer-Verlag, pp. 261-272.
19. GLÜCK, R., NAKASHIGE, R., AND ZÖCHLING, R. Binding-time analysis applied to mathematical algorithms. In System Modelling and Optimization (1995), J. Doležal and J. Fidler, Eds., Chapman & Hall, pp. 137-146.
20. GOMARD, C. K., AND JONES, N. D. A partial evaluator for untyped lambda calculus. Journal of Functional Programming 1, 1 (1991), 21-69.
21. HORNOF, L., AND JIM, T. Certifying compilation and run-time code generation. Higher-Order and Symbolic Computation 12, 4 (Dec. 1999), 337-375.
22. JONES, N. D., GOMARD, C. K., AND SESTOFT, P. Partial Evaluation and Automatic Program Generation. Prentice-Hall, 1993.
23. JONES, N. D., SESTOFT, P., AND SONDERGRAARD, H. An experiment in partial evaluation: The generation of a compiler generator. In Rewriting Techniques and Applications, J.-P. Jouannaud, Ed., vol. 202 of Lecture Notes in Computer Science. Springer-Verlag, 1985, pp. 124-140.
24. KEPPEL, D., EGGERS, S. J., AND HENRY, R. R. A case for runtime code generation. Tech. Rep. 91-11-04, University of Washington, 1991.
25. KOLHLBECKER, E. E. Syntactic Extensions in the Programming Language Lisp. PhD thesis, Indiana University, Bloomington, Indiana, 1986.
26. LEROY, X. Objective Caml, 2000. Available from http://caml.inria.fr/ocaml/.
27. MALMKJÆR, K. On some semantic issues in the reflective tower. In Mathematical Foundations of Programming Semantics. (Lecture Notes in Computer Science, vol. 442) (1989), M. Main, A. Melton, M. Mislove, and D. Schmidt, Eds., pp. 229-246.
28. MASUHARA, H., AND YONEZAWA, A. Run-time bytecode specialization. Lecture Notes in Computer Science 2053 (2001), 138-??
29. MetaOCaml: A compiled, type-safe multi-stage programming language. Available online from http://www.cs.rice.edu/∼taha/MetaOCaml/, 2003.
30. MOGGI, E. A categorical account of two-level languages. In Mathematics Foundations of Program Semantics (1997), Elsevier Science.
31. MOGGI, E. Functor categories and two-level languages. In Foundations of Software Science and Computation Structures (FoSSaCS) (1998), vol. 1378 of Lecture Notes in Computer Science, Springer Verlag.
32. MOGGI, E., TAHA, W., BENAISSA, Z. E.-A., AND SHEARD, T. An idealized MetaML: Simpler, and more expressive. In European Symposium on Programming (ESOP) (1999), vol. 1576 of Lecture Notes in Computer Science, Springer-Verlag, pp. 193-207.
33. Multi-stage programming. http://www.cs.rice.edu/∼taha/teaching/02F/511, 2003.
34. NOËL, F., HORNOF, L., CONSEL, C., AND LAWALL, J. L. Automatic, template-based run-time specialization: Implementation and experimental study. In Proceedings of the 1998 International Conference on Computer Languages (1998), IEEE Computer Society Press, pp. 132-142.
35. Oregon Graduate Institute Technical Reports. P.O. Box 91000, Portland, OR 97291-1000,USA. Available online from ftp://cse.ogi.edu/pub/tech-reports/README.html. Last viewed August 1999.
36. PU, C., AND WALPOLE, J. A study of dynamic optimization techniques: Lessons and directions in kernel design. Tech. Rep. CSE-93-007, Oregon Graduate Institute, 1993. Available from [35].
37. SMITH, B. C. Reflection and Semantics in a Procedural Language. PhD thesis, Massachusetts Institute of Technology, 1982.
38. SMITH, B. C. Reflection and semantics in LISP. In ACM Symposium on Principles of Programming Languages (1984), pp. 23-35.
39. SMITH, F., GROSSMAN, D., MORRISETT, G., HORNOF, L., AND JIM, T. Compiling for template-based run-time code generation. Journal of Functional Programming (2002). To appear.
40. TAHA, W. Multi-Stage Programming: Its Theory and Applications. PhD thesis, Oregon Graduate Institute of Science and Technology, 1999. Available from [35].
41. TAHA, W., Ed. Semantics, Applications, and Implementation of Program Generation (Montréal, 2000), vol. 1924 of Lecture Notes in Computer Science, Springer-Verlag.
42. TAHA, W. A sound reduction semantics for untyped CBN multi-stage computation. Or, the theory of MetaML is non-trivial. In Proceedings of the Workshop on Partial Evaluation and Semantics-Based Program Maniplation (PEPM) (Boston, 2000), ACM Press.
43. TAHA, W., BENAISSA, Z.-E.-A., AND SHEARD, T. Multi-stage programming: Axiomatization and type-safety. In 25th International Colloquium on Automata, Languages, and Programming (ICALP) (Aalborg, 1998), vol. 1443 of Lecture Notes in Computer Science, pp. 918-929.
44. TAHA, W., MAKHOLM, H., AND HUGHES, J. Tag elimination and Jones-optimality. In Programs as Data Objects (2001), O. Danvy and A. Filinksi, Eds., vol. 2053 of Lecture Notes in Computer Science, pp. 257-275.
45. TAHA, W., AND NIELSEN, M. F. Environment classifiers. In The Symposium on Principles of Programming Languages (POPL '03) (New Orleans, 2003).
46. TAHA, W., AND SHEARD, T. Multi-stage programming with explicit annotations. In Proceedings of the Symposium on Partial Evaluation and Semantic-Based Program Manipulation (PEPM) (Amsterdam, 1997), ACM Press, pp. 203-217.
47. TAHA, W., AND SHEARD, T. MetaML and multi-stage programming with explicit annotations. Tech. Rep. CSE-99-007, Department of Computer Science, Oregon Graduate Institute, 1999. Extended version of [46]. Available from [35].
48. TAHA, W., AND SHEARD, T. MetaML: Multi-stage programming with explicit annotations. Theoretical Computer Science 248, 1-2 (2000). Revision of [47].
49. THIBAULT, S., CONSEL, C., LAWALL, J. L., MARLET, R., AND MULLER, G. Static and dynamic program compilation by interpreter specialization. Higher-Order and Symbolic Computation 13, 3 (Sept. 2000), 161-178.