Integration of Logic and Functional Languages Based on Dataflow

逻辑和函数式语言的技术优点已经得到了广泛的认可，这些语言的集成问题已经从形式语义学的角度以及实际的实现技术中得到了讨论(例如，参见de Groot和Lindstrom，1986)。已经开发了几种语言，重点是将平等与逻辑语言相结合。这类语言的主要计算机制是基于解析的，但术语重写规则、缩小范围等应该与解析统一。如何将它们统一起来，甚至在逻辑编程中也引起了人们的兴趣。本研究项目一直遵循这种集成的方向，但避免了将不同的计算统一起来的方式。考虑到FP程序的表达能力和逻辑程序归结演绎所涉及的代数运算，我们得到了一种FP函数等价的逻辑语言FPLOG，它的语义由数据表示；FLOW，Difference…从定义叶的语义的方式获得更多NT(Giovannetti等人，1991)。本文提出的语义反映和建议了逻辑语言和由FP程序组成的方程的数据流计算。为了实现FPLOG的语义，我们首先使用数据流构造来处理逻辑程序的语义。语义域是基于Herbrand基或由幂等替换的等价类组成的商集的序列域。作为相关主题，我们关注具有通信通道的不确定数据流和逻辑程序。有一个通信逻辑程序的网络公式。将数据流计算表示为时序逻辑程序，给出了逻辑程序到函数式程序，特别是FP程序的转换技术。转换过程不是像Debray和Warren()那样把谓词所涉及的输入-输出映射看作是每个定从句将替换集或序列翻译成一个替换集或序列的解释，而是由这样的推论引起的，即该替换集或序列是原子集的虚拟表示手段。翻译可以用FP程序来表示，FP程序也可以被看作是从逻辑程序中提取的泛函。最后，我们得到了FPLOG，它由包含FP函数的术语的等式组成的定子句集组成。由于等价性可以通过数据流计算来实现和评估，因此建议对FPLOG进行数据流计算，以使语义能够反映它。较少

The technical merits of logic and functional languages have been widely acknowledged, and the integration problems of these languages have arisen to be discussed from formal semantics points as well as practical implementation techniques(See, for example, De Groot and Lindstrom, 1986). Several languages have been developed in focus on integration of equality with a logic language. The primary computing mechanism for such languages is resolution-based, but term rewriting rules, narrowing and so on should be unified with resolutions. How to unify them has caused interesting aspects even in logic programming. This research project has been following the direction of such integration, but avoids the way of unifying different computings. Taking the expressiveness of FP programs and algebraic manipulationinvolved in resolution deductions of logic programs into account, we have a logic language with FP functions equalityFPLOG, for which semantics is formulated by means of data ; flow, differe … More nt from the way of defining semantics for LEAF(Giovannetti et al., 1991). The proposed semantics in this report reflects and suggests dataflow computing for both logic languages and equations consisting of FP programs.For the goal to semantics for FPLOG, we firstly deal with semantics for logic program using dataflow construction. The semantic domain is a sequence domain based on the Herbrand base or the quotient set consisting of equivalence classes of idempotent substitutions. As related topics, we are concerned with nondeterministic dataflow and logic programs with communication channels. There is a formulation of the network of communicationg logic programs. The network might express the dataflow computing for a sequential logic program.Then the transformation technique from a logic program into a functional program, especially an FP program, is provided. The transforamtion process does not take the input-output mapping involved in predicates as Debray and Warren(1989), but the interpretation that each definite clause translates substitution sets or sequences to a substitution set or sequence, caused by inferences such that the substitution set or sequence is means of virtual representation of atom sets. The translation might be expressed by an FP program, which is also regarded as an extracted functional from a logic program.Finally we have FPLOG, which consists of definite clause sets involving equalities for terms containing FP functions. Becauses the equality might be realized and evaluated by dataflow computing, dataflow computing for FPLOG is suggested such that semantics might reflect it. Less