Meta-programming through typeful code representation

ACM SIGPLAN Notices

Volumn 38, Issue 9, 2003, Pages 275-286

  Chen, Chiyan ^a   Xi, Hongwei ^a  

^a BOSTON UNIVERSITY   (United States)

Author keywords

Meta programming; Multi level staged programming; Typeful code representation

Indexed keywords

CODES (SYMBOLS); COMPUTER PROGRAMMING; ERRORS; POLYNOMIALS; THEOREM PROVING;

DEBRUJIN INDICES; META PROGRAMMING; MULTI LEVEL STAGED PROGRAMMING; TYPEFUL CODE REPRESENTATION;

COMPUTER PROGRAMMING LANGUAGES;

EID: 1442264189     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/944746.944730     Document Type: Conference Paper

References (35)

1. C. Calcagno, E. Moggi, and T. Sheard. Closed Types for a Safe Imperative MetaML. Journal of Functional Programming, 2003. (to appear).
2. C. Chambers and D. Ungar. Customization: Optimizing Compiler Technology for SELF. In Proceedings of 16th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI '89), pages 146-160, 1989.
3. A. Church. A formulation of the simple type theory of types. Journal of Symbolic Logic, 5:56-68, 1940.
4. L. Damas and R. Milner. Principal type-schemes for functional programs. In Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages, pages 207-212, Albuquerque, New Mexico, 1982.
5. O. Danvy and M. Rhiger. A Simple Take on Typed Abstract Syntax in Haskell-like Languages. In Proceedings of the 5th International Symposium on Functional and Logic Programming (FLOPS '01), pages 343-358, Tokyo, Japan, March 2001.
6. R. Davies. A temporal logic approach to binding-time analysis. In Symposium on Logic in Computer Science (LICS '96), pages 184-195, 1996.
7. R. Davies and F. Pfenning. A Modal Analysis of Staged Computation. Journal of ACM, 48(3):555-604, 2001.
8. N. G. de Bruijn. Lambda calculus notation with nameless dummies. Indagationes mathematicae, 34:381-392, 1972.
9. L. P. Deutsch and A. M. Schiffman. Efficient Implementation of Smalltalk-80 System. In Proceedings of 11th ACM SIGPLAN Symposium on Principles of Programming Languages, pages 297-302, Salt Lake City, Utah, 1984.
10. S. Draves. Partial evaluation for media processing. ACM Computing Surveys (CSUR), 30(3es):21, 1998.
11. R. Kent Dybvig. Writing hygienic macros in Scheme with syntax-case Technical Report #356, Computer Science Department, Indiana University, 1992.
12. A. Ershov. On the partial computation principle. Information Processing Letters, 6(2):38-41, 1977.
13. Y. Futamara. Partial evaluation of computation process. Systems, computers, controls, 2(5):45-50, 1971.
14. R. Glück and J. Jørgensen. An automatic program generator for multi-level specialization. Lisp and Symbolic Computation, 10(2):113-158, 1997.
15. N. D. Jones, P. Sestoft, and H. Søndergaard. An experiment in partial evaluation: the generation of a compiler generator. In Rewriting Techniques and Applications, pages 124-140. Springer-Verlag LNCS 202, 1985.
16. J. Launchbury and S. Peyton-Jones. State in Haskell. Lisp and Symbolic Computation, pages 293-342, 1995.
17. M. Leone and P. Lee. Optimizing ml with run-time code generation. In ACM SIGPLAN '96 Conference on Programming Language Design and Implementation, pages 137-148, Philadelphia, PA, June 1996. ACM Press.
18. H. Massalin. An Efficient Implementation of Fundamental Operating System Services. Ph. D. dissertation, Columbia University, 1992.
19. R. Milner, M. Tofte, R. W. Harper, and D. MacQueen. The Definition of Standard ML (Revised). MIT Press, Cambridge, Massachusetts, 1997.
20. E. Moggi, W. Taha, Z.-E.-A. Benaissa, and T. Sheard. An Idealized Metal ML: Simpler, and More Expressiove. In European Symposium on Programming (ESOP '99), pages 193-207. Springer-Verlag LNCS 1576, 1999
21. A. Nanevski and F. Pfenning. Meta-Programming with Names and Necessity. A previous version appeared in the Proceedings of the International Conference on Functional Programming (ICFP 2002), pp. 206-217.
22. S. Peyton Jones et al. Haskell 98 - A non-strict, purely functional language. Available at http://www.haskell.org/onlinereport/, Feb. 1999.
23. F. Pfenning. Computation and Deduction. Cambridge University Press. (to appear).
24. F. Pfenning and C. Elliott. Higher-order abstract syntax. In Proceedings of the ACM SIGPLAN '88 Symposium on Language Design and Implementation, pages 109-208, Atlanta, Georgia, June 1988.
25. F. Pfenning and P. Lee. A Language with Evail and Polymorphism. In International Joint Conference on Theory and Practice in Software Development, pages 345-359, Barcelona, Spain, March 1989. Springer-Verlag LNCS 352.
26. R. Pike, B. Locanthi, and J. Reiser. Hardware/Software Trade-offs for Bitmap Graphics on the Blit. Software - Practice and Experience, 15(2):131-151, February 1985.
27. A. M. Pitts. Nominal logic, a first order theory of names and binding. Information and Computation. To appear. (A preliminary version appeared in the Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software (TACS 2001), LNCS 2215, Springer-Verlag, 2001, pp 219-242.).
28. A. M. Pitts and M. J. Gabbay. A metalanguage for programming with bound mass modulo renaming. In R. Backhouse and J. N. Oliveira, editors, Mathematics of Program Construction. 5th International Conference, MPC2000, Ponte de Lima, Portugal, July 2000. Proceedings, volume 1837 of Lecture Notes in Computer Science, pages 230-255. Springer-Verlag, Heidelberg, 2000.
29. T. Sheard, W. Taha, Z. Benaissa, and E. Pasalic. MetaML. Available at http://www.cse.ogi.edu/PacSoft/projects/metaml/.
30. W. Taha, C. Calcagno, L. Huang, and X. Leroy. MetaOCaml. Available at http://www.cs.rice.edu/~taha/MetaOCaml/.
31. W. Taha and M. F. Nielsen. Environment classifiers. In Proceedings of the 30th ACM SIGPLAN Symposium on Principles of Programming Languages, pages 26-37, New Orleans, January 2003.
32. W. Taha and T. Sheard. Multi-Stage Programming with Explicit Annotations. In Proceedings of the Symposium on Partial Evaluation and Semantic-Based Program Manipulation (PEPM), pages 203-217, Amsterdam, 1997.
33. W. Taha and T. Sheard. MetaML and multi-stage programming with explicit annotations. Theoretical Computer Science, 248(1-2):211-242, 2000.
34. A. Wright. Simple imperative polymorphism. Journal of Lisp and Symbolic Computation, 8(4):343-355, 1995.
35. H. Xi, C. Chen, and G. Chen. Guarded recursive datatype constructors. In Proceedings of the 30th ACM SIGPLAN Symposium on Principles of Programming Languages, pages 224-235, New Orleans, January 2003.