Yet Another Linear Logic Programming Language(ID:5036/yet001)

Linear Logic Programming Language featuring an extension of Lafont's interaction nets to the additive case
References:
  • SATOSHI MATSUOKA "Additive Interaction Nets : Yet Another Linear Logic Programming Language" view details Abstract: We propose a new programming language, which is an extension of Lafont's interaction nets to the additive case. The extension here is to introduce first-order unification variables: each agent in interaction nets has several first order terms with unification variables. When agents interact, information on interaction nets can be distributed by first order unification. In contrast with the standard interaction nets, our interaction nets with first order terms do not have the Church-Rosser property: several rewrite rules may apply to an additive interaction net. Girard's additive proof nets can be considered as a special case of our interaction nets with first order terms. We consider the extended interaction nets as a better substitute for linear logic programming languages based on backward proof search, which is a concurrent object oriented programming language, for some purposes, especially for formalization of componentbased programming, which is a trend in real computing, e.g. Java Beans and Active X. We can encode a ð-calculus-like logic programming language as well as the SLD-resolution into the additive interaction nets.
          in IPSJ Transactions on Programming Vol.40 No.SIG04 - 013 view details