See this document in CiteSeerX!

Programming with Logical Links: Design of the LMNtal language (Extended Abstract) (2002)  (Make Corrections)  
K. Ueda, N. Kato



  Home/Search   Context   Related

 
View or download:
ueda.info.waseda.a...uedaaplas2002.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  ueda.info.waseda.ac.jp/~...papers (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Kazunori Ueda +# and Norio Kato + + Dept. of Information and Computer Science, Waseda University 3-4-1, Okubo, Shinjuku-ku, Tokyo 169-8555, Japan {ueda,n-kato}@ueda.info.waseda.ac.jp # CREST, Japan Science and Technology Corporation Abstract. We propose LMNtal, a simple language model based on the rewriting of hierarchical graphs that use logical variables to represent links. The two major goals of the model are (i) to unify various computational models based on multiset rewriting and... (Update)

Similar documents (at the sentence level):
32.0%:   LMNtal: a language model with links and membranes - Kazunori Ueda Norio   (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.5:   Linearity Analysis of Concurrent Logic Programs - Ueda (1999)   (Correct)
0.5:   Concurrent Logic/Constraint Programming: The Next 10 Years - Ueda (1999)   (Correct)
0.5:   Moded Flat GHC for Data-Parallel Programming (Extended Abstract) - Ueda   (Correct)

BibTeX entry:   (Update)

@misc{ ueda-programming,
  author = "K. Ueda and N. Kato",
  title = "Programming with Logical Links: Design of the LMNtal language (Extended
    Abstract)",
  url = "citeseer.ist.psu.edu/564720.html" }
Citations (may not include all citations):
159   The Chemical Abstract Machine (context) - Berry, Boudol
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  DBLP
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  ACM   DBLP
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

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