A polymorphic modal type system for lisp-like multi-staged languages

被引：33

作者：

Seoul National University ^{[1
]}

不详 ^{[2
]}

机构：

来源：

ACM SIGPLAN Not. | 2006年 / 1卷 / 257-268期

关键词：

Let-polymorphism; Lisp; ML; Modal types; Multi-staged languages; Polymorphic types; Quasi-quotation; Record type; Scheme; Type inference; Type systems;

D O I：

10.1145/1111320.1111060

中图分类号：

学科分类号：

摘要：

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 to comply 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. Copyright © 2006 ACM.

引用

页码：257 / 268

页数：11