Theory and Implementation of Equational Logic Programming

该奖项将继续一项正在进行的研究项目，以探索方程逻辑规划的可实现性和实用性。该项目已经为一种方程编程语言制作了一个编译器，其中程序是一组方程，输入是一个项，计算是程序中方程的某些逻辑结果的推导，导致与输入等价的标准形式的项的输出。该语言的新特性包括完全拒绝为了性能而牺牲语义，导致统一使用“惰性”求值——一种可以精确地自动计算与最终输出相关的信息的技术——以及惰性输入/输出功能，它为术语的消费者提供了对其计算的动态控制。当前版本的编译器使用中间代码的部分求值作为c语言的优化编译器。继续的研究将包括研究更复杂的求值技术以提高性能，将这些技术应用于其他语言的性能影响，理论进步以扩展可编译的方程程序的类别。引入模块化编程结构和实验高级用户界面（包括结构编辑器界面）的语义后果。

This award will continue an ongoing research project to explore the implementability and utility of Equational Logic Programming . The project has already produced a compiler for an equational programming language, in which a program is a set of equations, an input is a term, a computation is a derivation of certain logical consequences of the equations in the program, leading to the output of a term in normal form equivalent to the input. Novel features of the language include a total refusal to compromise semantics for performance, leading to a uniform use of "lazy" evaluation-- a technique in which precisely the information demonstrably relevant to the final output is automatically computed-- and a lazy input/output facility, which gives the consumer of a term dynamic control of its computation. The current version of the compiler uses partial evaluation of intermediate code as an optimized compilers for C. Continuing research will include the study of more sophisticated evaluation techniques to improve performance, the performance implications of applying those techniques to other languages, theoretical advances to extend the class of equational programs that can be compiled, the semantic ramifications of introducing modular programming constructs, and experimentation with advanced user interfaces, including structure editor interfaces.