Type-Reconstruction Problems for the -Calculus and Functional Programming Languages

微积分和函数式编程语言的类型重构问题

• 批准号: 9113196
• 负责人: Assaf Kfoury
• 金额: $ 36.79万
• 依托单位: Trustees of Boston University
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 1991
• 资助国家: 美国
• 起止时间: 1991-12-15 至 1995-11-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9113196&HistoricalAwards=false
• 关键词: Type; Reconstruction; Problems; Calculus; Functional

This project continues a study of type systems for the -calculus and functional programming languages. The emphasis is on type- reconstruction problems. Algebraic characterizations of type- reconstruction problems give rise to new and more general forms of unification, often with applications in other areas of computer science. Together with type-reconstruction problems, the expressive powers of the formalisms considered are to be compared and calibrated. Principal topics include: generalized type structures (especially polymorphism, coercions, existential types), decision procedures for unification problems and their complexity, programming features characterized by complexity classes.

这个项目继续研究微积分的类型系统， 函数式编程语言 重点是类型- 重建问题。 型的代数特征 重建问题产生了新的和更普遍的形式， 统一，通常与计算机其他领域的应用程序 科学 与类型重构问题一起， 所考虑的形式主义的力量将被比较和校准。 主要主题包括：广义类型结构（特别是 多态性，多态性，存在类型），决策过程 统一问题及其复杂性，编程特点 以复杂性类为特征。