NSF Young Investigator: Constraint Programming Languages

约束普遍存在于许多应用领域，包括运筹学（打包和调度）、硬件设计（电路 验证），计算语言学， 计算机图形学和软件工程。 约束 编程语言有希望显著减少这些应用程序的开发时间，同时保持合理的效率。 本项目研究的目的是设计、实现、 和限制的应用 编程语言。应用程序和面向对象的语言都被认为是。 设计问题的重点是如何最好地支持已建立的 范式 为 的 应用 考虑了 实现研究考虑了各种约束系统的约束求解，蕴涵和推广算法的设计。 本文还研究了约束程序设计语言的静态分析以降低性能 间隙 之间 程序 和基于约束的语言，导致开发各种语言的优化编译器。最后，应用程序验证项目中开发的技术和实现，并展示技术的潜在影响。

Constraints are ubiquitous in many application areas including operations research (packing and scheduling), hardware design (circuit verification), computational linguistics, computer graphics, and software engineering. Constraint programming languages hold the promise of reducing the development time of these applications significantly, while preserving a reasonable efficiency. The purpose of this project to study the design, implementation, and applications of constraint programming languages. Both applicative and object-oriented languages are considered. Design issues focus on how best to support established paradigms for the applications considered. Implementation research considers the design of algorithms for constraint solving, entailment, and generalization for a variety of constraint systems. It also investigates the static analysis of constraint programming languages to reduce the performance gap between procedural and constraint-based languages, leading to the development of optimizing compilers for a variety of languages. Finally, applications validate the technology and implementation developed in the project and demonstrate the potential impact of the technology.