A polymorphic modal type system for Lisp-like multi-staged languages. (English) Zbl 1369.68076
Proceedings of the 33rd ACM SIGPLAN-SIGACT symposium on principles of programming languages, POPL ’06, Charleston, SC, USA, January 11–13, 2006. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-59593-027-2). 257-268 (2006).
MSC:
| 68N15 | Theory of programming languages |
| 68N30 | Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) |
Keywords:
ML; let-polymorphism; Lisp; modal types; multi-staged languages; polymorphic types; quasi-quotation; record type; scheme; type inference; type systemsReferences:
| [1] | D. Ancona and E. Moggi. A fresh calculus for name management. In Proceedings of the International Conference on Generative Programming and Component Engineering, October 2004. |
| [2] | Cristiano Calcagno, Eugenio Moggi, and Tim Sheard. Closed types for a safe imperative MetaML. Journal of Functional Programming, 13(3), 2003. 10.1017/S0956796802004598 · Zbl 1036.68024 |
| [3] | Cristiano Calcagno, Eugenio Moggi, and Walid Taha. ML-like inference for classifiers. In Proceedings of the European Symposium on Programming 2004, pages 79-93. Springer, 2004. · Zbl 1126.68330 |
| [4] | Chiyan Chen and Hongwei Xi. Meta-programming through typeful code representation. In Proceedings of the International Conference on Functional Programming (ICFP ’02), pages 275-286. ACM, August 2003. 10.1145/944705.944730 · Zbl 1315.68038 |
| [5] | Olivier Danvy. Type-directed partial evaluation. In Proceedings of the Symposium on Principles of Programming Languages, pages 242-257. ACM, Jan 1996. 10.1145/237721.237784 |
| [6] | Rowan Davies. A temporal-logic approach to binding-time analysis. In Proceedings of the Symposium on Logic in Computer Science (LICS ’96), pages 184-195. IEEE Computer Society Press, 1996. |
| [7] | Rowan Davies and Frank Pfenning. A modal analysis of staged computation. In Proceedings of the Symposium on Principles of Programming Languages (POPL ’96), pages 258-270. ACM, 1996. 10.1145/237721.237788 |
| [8] | Rowan Davies and Frank Pfenning. A modal analysis of staged computation. Journal of the ACM, 48(3):555-604, 2001. 10.1145/382780.382785 · Zbl 1323.68107 |
| [9] | Dawson R. Engler. VCODE: A retargetable, extensible, very fast dynamic code generation system. In Proceedings of the Conference on Programming Language Design and Implementation, pages 160-170, New York, 1996. ACM. 10.1145/231379.231411 |
| [10] | Paul Graham. On Lisp: an advanced techniques for Common Lisp. Prentice Hall, 1994. |
| [11] | Robert Harper. A simplified account of polymorphic references. Information Processing Letters, 51:201-206, 1994. 10.1016/0020-0190(94)90120-1 · Zbl 0813.68131 |
| [12] | Neil D. Jones, Carsten K. Gomard, and Peter Sestoft. Partial evaluation and automatic program generation. Prentice-Hall, 1993. · Zbl 0875.68290 |
| [13] | Ik-Soon Kim, Kwangkeun Yi, and Cristiano Calcagno. A polymorphic modal type system for Lisp-like multi-staged languages. Technical Report ROPAS-2005-26, (ropas.snu.ac.kr/lib/dock/KiYiCa2005.pdf), 2005. |
| [14] | Eugene Kohlbecker, Daniel P. Friedman, Matthias Felleisen, and Bruce Duba. Hygienic macro expansion. In Proceedings of the 1986 ACM Conference on LISP and functional programming, pages 151-161. ACM, August 1986. 10.1145/319838.319859 |
| [15] | M. Leone and Peter Lee. Optimizing ML with run-time code generation. In Proceedings of the ACM SIGPLAN’96 Conference on Programming Language Design and Implementation, pages 137-148. ACM Press, June 1996. 10.1145/231379.231407 |
| [16] | H. Massalim. An Efficient Implementation of Functional Operating System Services. PhD thesis, Columbia University, 1992. |
| [17] | Aleksandar Nanevski. Meta-programming with names and necessity. In Proceedings of the International Conference on Functional Programming (ICFP ’02), pages 206-217. ACM, October 2002. 10.1145/581478.581498 · Zbl 1322.68045 |
| [18] | Aleksandar Nanevski and Frank Pfenning. Staged computation with names and necessity. to appear in Journal of Functional Programming. 10.1017/S095679680500568X |
| [19] | Massimilian Poletto, Wilson C. Hsieh, Dawson R. Engler, and M. Frans Kasshoek. C and tcc:a language and compiler for dynamic code generation. ACM Transactions on Programming Languages and Systems, 21:324-369, March 1999. 10.1145/316686.316697 |
| [20] | Didier Rémy. Syntactic theories and the algebra of record terms. Research Report 1869, Institut National de Recherche en Informatique et Automatisme, Rocquencourt, BP 105, 78 153 Le Chesnay Cedex, France, 1993. |
| [21] | Didier Rémy. Type inference for records in a natural extension of ML. In Carl A. Gunter and John C. Mitchell, editors, Theoretical Aspects Of Object-Oriented Programming. Types, Semantics and Language Design. MIT Press, 1993. |
| [22] | Morten Rhiger. First-class open and closed code fragments. In Proceedings of the Sixth Symposium on Trends in Functional Programming, September 2005. |
| [23] | Guy L. Steele. Common Lisp the Language, 2nd edition. Digital Press, 1990. · Zbl 0757.68008 |
| [24] | Walid Taha. Multi-Stage Programming: Its Theory and Applications. PhD thesis, Oregon Graduate Institute of Science and Technology, November 1999. |
| [25] | Walid Taha and Michael Florentin Nielsen. Environment classifiers. In Proceedings of the Symposium on Principles of Programming Languages (POPL ’03). ACM, 2003. 10.1145/604131.604134 · Zbl 1321.68175 |
| [26] | J. B. Wells. The essence of principal typings. In Proceedings of the 29th International Colloquium on Automata, Languages and Programming, pages 913-925. Springer-Verlag, 2002. · Zbl 1057.03023 |
| [27] | Andrew K. Wright. Simple imperative polymorphism. Lisp and Symbolic Computation, 8(4):343-355, Dec 1995. 10.1007/BF01018828 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
