权益分类	功能权益	普通用户	{{item.name}}会员
{{category.name}}	{{benefitItem.name}}

Functional Logic Programming with Distributed Constraint Solving System

分布式约束求解系统的函数逻辑编程

基本信息

批准号：
10480053
负责人：
IDA Tetsuo
金额：
$ 6.4万
依托单位：
University of Tsukuba
依托单位国家：
日本
项目类别：
Grant-in-Aid for Scientific Research (B)
财政年份：
1998
资助国家：
日本
起止时间：
1998 至 1999
项目状态：
已结题

项目摘要

Our contributions are (i) development of computation models for functional logic programming languages with distributed constraint solving systems and (ii) realization of a programming environment based on the computation models.(i) Design of computation modelsWe started the research project with the design of a computation model called Lazy Narrowing Calculus (LNC). LNC forms the basis of our investigation into all our computation models for functional and logic programming. To deal with constraint solving in functional logic programming languages, we extended LNC to the conditional case. The resulting calculus is called Lazy Conditional Narrowing Calculus (LCNC). Moreover, we removed the non-determinism inherent in LCNC. This simplifies the implementation of the calculus on computers and improves the computational efficiency.Furthermore we designed higher-order calculi, i.e. Applicative LNC, which simulates higher-order computation by using (first-order) applicative terms for representing terms, and Higher-Order Lazy Narrowing Calculus (LNff), which can handle lambda terms. We proved that all the above-mentioned calculi have completeness.(ii) Implementation of the programming systemWe implemented a functional logic programming system in a distributed environment. The system is called Constraint Functional Logic Programming system (CFLP). CFLP consists of three components : an interpreter, a scheduler, and a constraint solving system. We implemented CFLP as a distributed software system using the programming language Mathematica. The computation mechanism of CFLP is based on the narrowing calculi. The interpreter of the functional logic programming language in CFLP system solves given equations by accessing constraint solvers in a distributed environment. The narrowing calculi find solutions over the domain of term algebra. The other domain-specific constants and operations are handled by the constraint solvers which provide the domain-specific solving methods.

我们的贡献是（一）开发的计算模型的功能逻辑编程语言与分布式约束求解系统和（ii）实现的编程环境的基础上的计算模型。(i)计算模型的设计我们从设计一个名为Lazy Narrowing Calculus（LNC）的计算模型开始了研究项目。LNC构成了我们对函数和逻辑编程的所有计算模型进行研究的基础。为了处理函数逻辑程序设计语言中的约束求解问题，我们将LNC扩展到条件情形。由此产生的演算称为懒惰条件缩窄演算（LCNC）。此外，我们消除了LCNC中固有的非确定性。此外，我们还设计了高阶演算，即应用型LNC和高阶惰性窄化演算（Higher-Order Lazy Narrowing Calculus，LNff），前者用（一阶）应用项表示项来模拟高阶计算，后者能处理lambda项。我们证明了上述演算都具有完备性。(ii)程序设计系统的实现我们在分布式环境下实现了一个函数逻辑程序设计系统。该系统被称为约束函数逻辑程序设计系统（CFLP）。CFLP由三个部分组成：解释器，调度器和约束求解系统。我们实现了CFLP作为一个分布式软件系统，使用编程语言Mathematica。CFLP的计算机制是基于缩窄结石的。CFLP系统中的函数逻辑编程语言解释器通过访问分布式环境中的约束求解器来求解给定的方程。缩窄演算在项代数的域上找到解。其他特定于域的常数和操作由提供特定于域的求解方法的约束求解器处理。