Integration of Logic and Functional Languages Based on Dataflow

基于数据流的逻辑与函数语言的集成

• 批准号: 02680028
• 负责人: YAMASAKI Susumu
• 金额: $ 1.02万
• 依托单位: Okayama University
• 依托单位国家: 日本
• 项目类别: Grant-in-Aid for General Scientific Research (C)
• 财政年份: 1990
• 资助国家: 日本
• 起止时间: 1990 至 1991
• 项目状态: 已结题
• 来源: https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-02680028/
• 关键词: logic language; functional language; dataflow; semantics; algebraic manipulation; resolution deduction; 形式意味論; プログラム変換; 非決定性; ユニフィケ-ション

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

逻辑语言和函数语言的技术优点已被广泛认可，这些语言的集成问题已从形式语义点以及实际实现技术（例如，De Groot和Lindstrom，1986）进行了讨论。已经开发了几种语言，专注于将等式与逻辑语言相结合。这类语言的主要计算机制是基于解析的，但术语重写规则、缩窄等都应该与解析统一起来。如何统一它们甚至在逻辑编程中也引起了有趣的方面。本研究项目一直遵循这种集成的方向，但避免了统一不同计算的方式。考虑到FP程序的可表达性和逻辑程序归结推理所涉及的代数操作，我们提出了一种具有FP函数equal的逻辑语言FPLOG，它的语义是用数据、流、差等来表示的。 ...更多信息 nt从定义LEAF语义的方式（Giovannetti等人，1991年）。本报告中提出的语义反映并建议了逻辑语言和FP程序组成的方程的数据流计算。为了实现FPLOG的语义目标，我们首先使用数据流构造来处理逻辑程序的语义。语义域是基于Herbrand基或由幂等替换的等价类组成的商集的序列域。作为相关的主题，我们关注的是具有通信通道的非确定性逻辑程序和逻辑程序。有一个通信逻辑程序网络的公式。该网络可以表示时序逻辑程序的流水计算，并给出了从逻辑程序到功能程序，特别是FP程序的转换技术。转换过程不像Debray和Warren（1989）那样采用谓词中的输入输出映射，而是每个定义分句将替换集合或序列转换为替换集合或序列的解释，这是由推理引起的，替换集合或序列是原子集合的虚表示。这种转换可以用FP程序来表示，FP程序也可以看作是从逻辑程序中提取出来的一个泛函。最后我们得到了FPLOG，它由包含FP函数的项的等式的确定子句集组成。因为等式可以通过递归计算来实现和评估，所以建议对FPLOG进行递归计算，以便语义可以反映它。Less

项目成果

Yamasaki, S. and Iida, K.: "Semantics for logic program by means of substitution sequence manipulation towards transformation into FP program"

Yamasaki, S. 和 Iida, K.：“通过替换序列操作转换为 FP 程序的逻辑程序语义”

Yamasaki, S.: "Dataflow computing mechanism for logic program and extraction of functional from it" Software Science and Engineering, Selected Papers from Kyoto Symposia. World Scientific. 78-97 (1991)

Yamasaki, S.：“逻辑程序的数据流计算机制以及从中提取函数”软件科学与工程，京都研讨会论文选。

Yamasaki,S.: "A network of communicating logic program as an extension of Kahn's model" Trans.of IEICE Japan. E71. 965-974 (1991)

Yamasaki,S.：“通信逻辑程序网络作为卡恩模型的扩展”Trans.of IEICE Japan。

Susumu Yamasaki: "A Network of Communicating Logic Programs as an Extension of Kahn's Model" Trans.of IEICEJ on Information and System. (1991)

Susumu Yamasaki：“作为卡恩模型扩展的通信逻辑程序网络”Trans.of IEICEJ on Information and System。

Yamasaki, S.: "Dataflow for logic program as substitution manipulator" Proc. of ISSAC '90. 44-51 (1990)

Yamasaki, S.：“逻辑程序的数据流作为替代操纵器”Proc。