An OR-compositional Semantics of GHC for Programs with Perpetual Processes

スポンサーリンク

概要

• 論文の詳細を見る

• OR-compositionality is an important property of semantics of programming language. Many results on the semantics of concurrent logic programming language were reported. But most of them were not OR-compositional or even if OR-compositional, they required a rigid syntactic restriction. On the other hand an OR-compositional semantics of pure logic programming languages is reported in Ref. 2). That semantics required no syntactic restriction for predicates. It achieved the goal by adding new elements to the semantic domain. Those elements have information for predicates of which definition may be changed by OR-composition operation. We propose an OR-compositional semantics of GHC (Guarded Horn Clauses) for programs with perpetual processes by extending the semantics constructed in Ref. 11) using the idea of Ref. 2).

• 一般社団法人情報処理学会の論文
• 1996-08-15

著者

• Murakami Masaki

  Faculty Of Engineering Okayama University

• Murakami M

  Faculty Of Engineering Okayama University

• KATO TORU

  Faculty of Engineering, Okayama University

• Kato T

  Res. Fellow Of The Japan Soc. For The Promotion Of Sci.

関連論文

• An OR-compositional Semantics of GHC for Programs with Perpetual Processes
• A Domain for Concurrent Semantics of Mobile Processes(Concurrency Theory and Applications '96)

スポンサーリンク