Abstract

This article presents a polymorphic modal type system and its principal type inference algorithm that conservatively extend ML by all of Lisp’s staging constructs (the quasi-quotation system). The combination is meaningful because ML is a practical higher-order, impure, and typed language, while Lisp’s quasi-quotation system has long evolved complying with the demands from multi-staged programming practices. Our type system supports open code, unrestricted operations on references, intentional variable-capturing substitution as well as capture-avoiding substitution, and lifting values into code, whose combination escaped all the previous systems.

Citations

593	Partial Evaluation and Automatic Program Generation - Jones, Gomard, et al. - 1993
195	Type-directed partial evaluation - Danvy - 1998
165	A modal analysis of staged computation - Davies, Pfenning
148	Optimizing ML with Run-Time Code Generation - Lee, Leone - 1996
133	Hygienic Macro Expansion - Kohlbecker, Friedman, et al. - 1986
89	Simple Imperative Polymorphism - Wright - 1995
79	Multi-stage programming: its theory and applications - Taha - 1999
77	A temporal-logic approach to binding-time analysis - Davies - 1996
77	The essence of principal typings - Wells - 2002
68	Type inference for records in natural extension of ml - Rémy - 1994
56	A simplified account of polymorphic references - Harper - 1994
43	Common Lisp the Language. 2nd Edition - Steele - 1990
35	Environment classifiers, in - Taha, Nielsen - 2003
31	Meta-programming with names and necessity - Nanevski - 2002
28	Closed types for a safe imperative MetaML - Calcagno, Moggi, et al. - 2003
22	ML-like inference for classifiers - Calcagno, Moggi, et al. - 2004
22	On LISP: Advanced Techniques for Common LISP - Graham - 1996
21	Syntactic theories and the algebra of record terms. Research Report 1869, Institut National de Recherche en Informatique et Automatisme - Rémy - 1993
18	Meta-programming through typeful code representation - Chen, Xi - 2005
5	Staged computation with names and necessity - Nanevski, Pfenning
2	A fresh calculus for name management - Ancona, Moggi - 2004
2	vcode: aretargetable, extensible, very fast dynamic code generation system - Poletto, Engler, et al. - 1996
2	First-class open and closed code fragments - Rhiger - 2005
1	An Efficient Implementation of Functional Operating System Services - Massalim - 1992
1	Kasshoek. C and tcc:a language and compiler for dynamic code generation - Poletto, Hsieh, et al. - 1999