Theory and Implementation of Equational Logic Programming

这是一个正在进行的研究项目，以探讨可实施性， Equational Logic Programming的缩写。 它已经产生了一个 一种等式程序设计语言的编译程序，其中程序是 一组方程，一个输入是一个项，一个计算是一个推导 程序中的方程式的某些逻辑结果， 导致输出与输入等价的正规形式的项。 这种语言的新特点包括完全拒绝妥协 性能语义，导致统一使用“lazy” 评估-一种技术，在这种技术中， 与最终输出相关的数据是自动计算的。 编译器的当前版本使用 中间代码作为一种优化技术，其性能 接近传统的C优化编译器。 继续 研究将包括更复杂的评估研究， 技术，以提高性能，理论的进步，以扩大 一类方程的程序，可以编译，模拟研究 以确定并行实现的潜在好处， 方程式编程语言，以及高级用户的实验 接口，包括结构编辑器接口。

This is an ongoing research project to explore the implementability and utility of Equational Logic Programming. It has already produced a compiler for an equational programming lanquage in which a program is a set of equations, an input is a term, and 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. The current version of the compiler uses partial evaluation of intermediate code as an optimization technique, and its performance is approaching that of conventional optimized compilers for C. Continuing research will include the study of more sophisticated evaluation techniques to improve performance, theoretical advances to extend the class of equational programs that can be compiled, simulation studies to determine the potential benefits of parallel implementations of equational programming languages, and experimentation with advance user interfaces, including structure editor interfaces.