Theory and Implementation of Equational Logic Programming

这是一个正在进行的研究项目，旨在探索等式逻辑规划的可实现性和实用性。它已经为一种方程编程语言生成了一个编译器，在这种语言中，程序是一组方程，输入是一个项，计算是程序中方程的某些逻辑结果的推导，导致与输入等价的标准形式的项的输出。该语言的新特性包括完全拒绝为了性能而牺牲语义，导致统一使用“懒惰”评估——一种精确地自动计算与最终输出相关的信息的技术。当前版本的编译器使用中间代码的部分求值作为优化技术，其性能接近传统的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.