LMNtal as a unifying declarative language: live demonstration

Authors:
Kazunori Ueda;Norio Kato;Koji Hara;Ken Mizuno
Affiliations:
Dept. of Computer Science, Waseda University, Tokyo, Japan;Center for Verification and Semantics, AIST, Osaka, Japan;Dept. of Computer Science, Waseda University, Tokyo, Japan;Dept. of Computer Science, Waseda University, Tokyo, Japan
Venue:
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Year:
2006

Citing 1
Cited 4

LMNtal: a language model with links and membranes

WMC'04 Proceedings of the 5th international conference on Membrane Computing

Universal concurrent constraint programing: symbolic semantics and applications to security

Proceedings of the 2008 ACM symposium on Applied computing
Encoding Distributed Process Calculi into LMNtal

Electronic Notes in Theoretical Computer Science (ENTCS)
Concurrent and reactive constraint programming

A 25-year perspective on logic programming
Models and emerging trends of concurrent constraint programming

Constraints

Quantified Score

Hi-index	0.01

Visualization

Abstract

LMNtal (pronounced “elemental”) is a simple language model based on hierarchical graph rewriting. It features and supports – rule-based multiset rewriting, – connectivity of nodes represented using logical variables, – hierarchy of nodes represented using membranes, – locality of rewrite rules, – dynamic migration of processes (= hierarchical graphs) and rewrite rules, – uniform treatment of processes and data, – graphical view of computation, and so on. Figure 1 shows examples of computation that can be encoded into LMNtal straightforwardly.