LMNtal: A Language Model with Links and Membranes

  • Kazunori Ueda
  • Norio Kato
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3365)


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 that it greatly facilitates programming with dynamic data structures.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Andries, M., et al.: Graph Transformation for Specification and Programming. Sci. Comput. Program. 34(1), 1–54 (1999)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Banâtre, J.-P., Le Métayer, D.: Programming by Multiset Transformation. Commun. ACM 35(1), 98–111 (1993)CrossRefGoogle Scholar
  3. 3.
    Berry, G., Boudol, G.: The Chemical Abstract Machine. In: Proc. POPL 1990, pp. 81–94. ACM Press, New York (1990)CrossRefGoogle Scholar
  4. 4.
    Cardelli, L., Gordon, A.D.: Mobile Ambients. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol. 1378, pp. 140–155. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  5. 5.
    Drewes, F., Hoffmann, B., Plump, D.: Hierarchical Graph Transformation. J. Comput. Syst. Sci. 64(2), 249–283 (2002)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Engels, G., Schürr, A.: Encapsulated Hierarchical Graphs, Graph Types, and Meta Types. Electronic Notes in Theor. Comput. Sci. 1, 75–84 (1995)Google Scholar
  7. 7.
    Fradet, P., Le Métayer, D.: Shape Types. In: Proc. POPL 1997, pp. 27–39. ACM Press, New York (1997)CrossRefGoogle Scholar
  8. 8.
    Frühwirth, T.: Theory and Practice of Constraint Handling Rules. J. Logic Programming 37(1–3), 95–138 (1998)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Lafont, Y.: Interaction Nets. In: Proc. POPL 1990, pp. 95–108. ACM, New York (1990)CrossRefGoogle Scholar
  10. 10.
    Miller, D.: Overview of Linear Logic Programming.. In: Ehrhard, T., Girard, J.-Y., Ruet, P., Scott, P. (eds.) Linear Logic in Computer Science. Cambridge University Press, Cambridge (to appear)Google Scholar
  11. 11.
    Milner, R.: Bigraphical Reactive Systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 16–35. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  12. 12.
    Păun, G.: Computing with Membranes. J. Comput. Syst. Sci. 61(1), 108–143 (2000)MATHCrossRefGoogle Scholar
  13. 13.
    Saraswat, V.A., Kahn, K., Levy, J.: Janus: A Step Towards Distributed Constraint Programming. In: Proc. 1990 North American Conf. on Logic Programming, pp. 431–446. MIT Press, Cambridge (1990)Google Scholar
  14. 14.
    Ueda, K.: Concurrent Logic/Constraint Programming: The Next 10 Years. In: Apt, K.R., Marek, V.K., Truszczynski, M., Warren, D.S. (eds.) The Logic Programming Paradigm: A 25-Year Perspective, pp. 53–71. Springer, Heidelberg (1999)Google Scholar
  15. 15.
    Ueda, K.: Resource-Passing Concurrent Programming. In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol. 2215, pp. 95–126. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  16. 16.
    Ueda, K., Kato, M.: Programming with Logical Links: Design of the LMNtal Language. In: Proc. Third Asian Workshop on Programming Languages and Systems (APLAS 2002), pp. 115–126 (2002)Google Scholar
  17. 17.
    Ueda, K., Kato, M.: The Language Model LMNtal. Computer Software 21(2), 44–61 (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Kazunori Ueda
    • 1
    • 2
  • Norio Kato
    • 1
  1. 1.Dept. of Computer ScienceWaseda UniversityTokyoJapan
  2. 2.CRESTJapan Science and Technology Corporation 

Personalised recommendations