ITR: Implementation of Functional Logic Languages

函数逻辑（FL）编程语言与仅基于函数或谓词的声明性语言相比，提供了几个优势。缩窄引擎是l语言的重要组成部分。迄今为止可用的缩小引擎都是原型，几乎普遍不完整。本研究的目标是设计和开发一个通用、高效、完整的FL语言缩窄引擎。这项研究将定义可执行FL程序的内部和外部表示——后者用XML表示。这种方法将把FL语言的不同编译器和解释器的前端与缩小引擎解耦。这种分离将使不同语言的前端能够使用相同的后端。与其他当代研究成果相比，提出的窄化引擎将窄化计算映射到命令式语言中的计算。可执行代码的内部表示将是一个薄层字节码，覆盖在压缩计算到命令式语言中的计算的映射上。这种方法保证了良好的效率，而不会牺牲在解释器中更容易实现的任务，如跟踪、调试和分析。实现的一个组成部分将是在FL语言的编译器/解释器的后端使用窄化引擎的运行时环境。

Functional logic (FL) programming languages provide severaladvantages over declarative languages based on either functions orpredicates only. A narrowing engine is an essential component ofFL languages. Narrowing engines available to date are allprototypical and almost universally incomplete. The goal of thisresearch is the design and development of a general, efficient andcomplete narrowing engine for FL languages.This research will define both internal and externalrepresentations of executable FL programs---the latter in XML.This approach will decouple the frontends of different compilersand interpreters of FL languages from the narrowing engine. Thisseparation will enable frontends for different languages to usethe same backend. By contrast to other contemporary researchefforts, the proposed narrowing engine will map narrowingcomputations to computations in an imperative language. Theinternal representation of the executable code will be athin-layer bytecode over the mapping of narrowing computations tocomputations in an imperative language. This approach promises agood efficiency without sacrificing tasks, such as tracing,debugging and profiling, that are more easily implemented in aninterpreter. An integral part of the implementation will be arun-time environment for using the narrowing engine in the backendof a compiler/interpreter of FL languages.