Logic, Complexity, and Programming Languages

这个项目包括对编程语言的逻辑和复杂理论方面的研究。它继续致力于函数式编程语言的类型推理研究，以及各种相关主题，涉及演绎数据库理论、程序转换方法论、统一以及记录、对象和线性程序的类型系统等研究问题。该研究计划基于这样一种信念，即类型推理的研究将使人们更深入地理解在编译器中嵌入这种机制的计算成本，从而为语言设计人员提供一些指导，说明什么是计算上可行的。该程序的动机也是这样一种信念，即类型推理的复杂性提供了编程语言表达能力的精确计算度量。

This project consists of a program of research into logical and complexity theoretic aspects of programming languages. It continues an ongoing commitment to the study of type inference for functional programming languages, together with a variety of associated topics spanning research questions in deductive database theory, program transformation methodology, unification, and type systems for records, objects and linear programs. The research program is founded on the belief that this study of type inference will give deeper understanding of the computational costs of embedding such mechanisms in a compiler, thus providing some guidance to language designers as to what is computationally feasible. The program is motivated as well by the belief that the complexity of type inference provides a precise computational measure of the expressiveness of programming languages.