Kazunori UEDA + Norio KATO + + Dept. of Computer Science, Waseda University...  Home/Search
Context
Related
| ueda.info.waseda.ac.jp/...wmc5ueda.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ueda.info.waseda.ac.jp/~...papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: LMNtal (pronounced "elemental ") is a simple language model based on graph rewriting that uses logical variables to represent links and membranes to represent hierarchies. The two major goals of LMNtal are (i) to unify various computational models based on multiset rewriting and (ii) to serve as the basis of a truly general-purpose language covering various platforms ranging from wide-area to embedded computation. Another important contribution of the model is it greatly facilitates... (Update)
Similar documents (at the sentence level):
27.4%: Programming with Logical Links: Design of the LMNtal language.. - Ueda, Kato (2002) (Correct)
Active bibliography (related documents): More All
0.5: Automated Programming Framework Using - Constraint-Based Static Analysis (Correct)
0.2: Resource-Passing Concurrent Programming - Ueda (Correct)
0.2: A Pure Meta-Interpreter for Flat GHC, A Concurrent Constraint.. - Ueda (Correct)
Similar documents based on text: More All
0.4: Concurrent Logic/Constraint Programming: The Next 10 Years - Ueda (1999) (Correct)
0.4: Linearity Analysis of Concurrent Logic Programs - Ueda (1999) (Correct)
0.3: Error-correcting Source Code - Yasuhiro Ajiro Kazunori (1998) (Correct)
BibTeX entry: (Update)
@misc{ norio-lmntal,
author = "Kazunori Ueda Norio",
title = "LMNtal: a language model with links and membranes",
url = "citeseer.ist.psu.edu/638362.html" }
Citations (may not include all citations):410 Mobile Ambients - Cardelli, Gordon - 1998
159 The Chemical Abstract Machine (context) - Berry, Boudol ACM DBLP
109 Programming by Multiset Transformation (context) - Banatre, Le Metayer - 1993 ACM DBLP
109 Interaction Nets (context) - Lafont ACM DBLP
66 Theory and Practice of Constraint Handling Rules - Fruhwirth - 1998
56 Janus: A Step Towards Distributed Constraint Programming (context) - Saraswat, Kahn et al. ACM DBLP
42 Computing with Membranes - Gh - 2000 ACM DBLP
32 Hierarchical Graph Transformation - Drewes, Ho et al. - 2002
18 Encapsulated Hierarchical Graphs (context) - Engels, Schurr - 1995
17 Graph Transformation for Specification and Programming - Andries - 1999 ACM DBLP
12 Bigraphical Reactive Systems (context) - Milner
5 Concurrent LogicConstraint Programming Next Year - Logic, The et al. - 1999
3 Resource-Passing Concurrent Programming - Ueda ACM DBLP
2 and Le Metayer (context) - Fradet - 1997
1 The Language Model LMNtal (context) - Ueda, Kato - 2004 DBLP
1 to appear in Linear Logic in Computer Science (context) - Miller
Documents on the same site (http://www.ueda.info.waseda.ac.jp/~ueda/papers.html): More
Making Exhaustive Search Programs Deterministic, Part II - Ueda (Correct)
Theory and Practice of Concurrent Systems - The Role of Kernel.. - Ueda (Correct)
Moded Flat GHC for Data-Parallel Programming (Extended Abstract) - Ueda (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC