TY - JOUR
T1 - LMNtal as a hierarchical logic programming language
AU - Ueda, Kazunori
N1 - Funding Information:
The author is indebted to the past and current members of the LMNtal project, particularly Norio Kato, Shingo Yajima, Ken Mizuno and Shintaro Kudo for the development of the ideas described here and the code they contributed. This work is partially supported by Grant-In-Aid for Scientific Research ((B)(2) 16300009; Priority Areas (C)(2)13324050, (B)(2)14085205 and 04560009), MEXT and JSPS.
PY - 2009/11/1
Y1 - 2009/11/1
N2 - LMNtal (pronounced "elemental") is a simple language model based on hierarchical graph rewriting that uses logical variables to represent connectivity and membranes to represent hierarchy. LMNtal is an outcome of the attempt to unify constraint-based concurrency and Constraint Handling Rules (CHR), the two notable extensions to concurrent logic programming. LMNtal is intended to be a substrate language of various computational models, especially those addressing concurrency, mobility and multiset rewriting. Although the principal objective of LMNtal was to provide a unifying computational model, it is of interest to equip the formalism with a precise logical interpretation. In this paper, we show that it is possible to give LMNtal a simple logical interpretation based on intuitionistic linear logic and a flattening technique. This enables us to call LMNtal a hierarchical, concurrent linear logic language.
AB - LMNtal (pronounced "elemental") is a simple language model based on hierarchical graph rewriting that uses logical variables to represent connectivity and membranes to represent hierarchy. LMNtal is an outcome of the attempt to unify constraint-based concurrency and Constraint Handling Rules (CHR), the two notable extensions to concurrent logic programming. LMNtal is intended to be a substrate language of various computational models, especially those addressing concurrency, mobility and multiset rewriting. Although the principal objective of LMNtal was to provide a unifying computational model, it is of interest to equip the formalism with a precise logical interpretation. In this paper, we show that it is possible to give LMNtal a simple logical interpretation based on intuitionistic linear logic and a flattening technique. This enables us to call LMNtal a hierarchical, concurrent linear logic language.
KW - Concurrent constraint programming
KW - Concurrent logic programming
KW - Hierarchical graph rewriting
KW - LMNtal
UR - http://www.scopus.com/inward/record.url?scp=70349545894&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70349545894&partnerID=8YFLogxK
U2 - 10.1016/j.tcs.2009.07.043
DO - 10.1016/j.tcs.2009.07.043
M3 - Article
AN - SCOPUS:70349545894
VL - 410
SP - 4784
EP - 4800
JO - Theoretical Computer Science
JF - Theoretical Computer Science
SN - 0304-3975
IS - 46
ER -