Addressed Term Rewriting Systems: Syntax, Semantics, and Pragmatics: Extended Abstract

We present a formalism called Addressed Term Rewriting Systems, which can be used to define the operational semantics of programming languages, especially those involving sharing, recursive computations and cyclic data structures. Addressed Term Rewriting Systems are therefore well suited for describing object-based languages, as for instance the family of languages called λOba, involving both functional and object-based features.

[1]  Marko C. J. D. van Eekelen,et al.  Functional Programming and Parallel Graph Rewriting , 1993 .

[2]  Matthias Felleisen,et al.  A call-by-need lambda calculus , 1995, POPL '95.

[3]  John C. Mitchell,et al.  A lambda calculus of objects and method specialization , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[4]  Luc Maranget,et al.  Optimal derivations in weak lambda-calculi and in orthogonal term rewriting systems , 1991, POPL '91.

[5]  M. J. Plasmeijer,et al.  Term graph rewriting: theory and practice , 1993 .

[6]  Jan Willem Klop,et al.  Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond , 1990, ICALP.

[7]  Detlef Plump,et al.  Term graph rewriting , 1999 .

[8]  P. J. Landin.  The Mechanical Evaluation of Expressions , 1964, Comput. J..

[9]  Tobias Nipkow,et al.  Term rewriting and all that , 1998 .

[10]  Luigi Liquori,et al.  A Generic Object-Calculus Based on Addressed Term Rewriting Systems , 2001 .

[11]  Andrew D. Gordon,et al.  A Concurrent Object Calculus: Reduction and Typing , 1998, HLCL.

[12]  Zena M. Ariola,et al.  Cyclic lambda graph rewriting , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[13]  Luigi Liquori,et al.  A lambda calculus of objects with self-inflicted extension , 1998, OOPSLA '98.

[14]  Grzegorz Rozenberg,et al.  Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations , 1997 .

[15]  Zena M. Ariola,et al.  Properties of a First-Order Functional Language with Sharing , 1995, Theor. Comput. Sci..

[16]  Lennart Augustsson,et al.  A compiler for lazy ML , 1984, LFP '84.

[17]  Matthias Felleisen,et al.  A Syntactic Theory of Sequential State , 1989, Theor. Comput. Sci..

[18]  Philip Wadler,et al.  Featherweight Java: a minimal core calculus for Java and GJ , 1999, OOPSLA '99.

[19]  Martín Abadi,et al.  A Theory of Objects , 1996, Monographs in Computer Science.

[20]  Luigi Liquori,et al.  A Framework for Defining Object-Calculi , 1999, World Congress on Formal Methods.

[21]  Gilles Kahn,et al.  Natural Semantics , 1987, STACS.

[22]  D. A. Turner,et al.  A new implementation technique for applicative languages , 1979, Softw. Pract. Exp..

[23]  S. Peyton-jones,et al.  Implementation of Functional Languages , 1997, Lecture Notes in Computer Science.

[24]  Kristoffer Hogsbro Rose,et al.  Operational reduction models for functional programming languages , 1996, Technical report / University of Copenhagen / Datalogisk institut.

[25]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[26]  Marko C. J. D. van Eekelen,et al.  Term Graph Rewriting , 1987, PARLE.

[27]  Stefan Blom,et al.  Term Graph Rewriting. Syntax and semantics , 2001 .

[28]  Hartmut Ehrig,et al.  Handbook of graph grammars and computing by graph transformation: vol. 2: applications, languages, and tools , 1999 .

[29]  Luigi Liquori,et al.  Addressed term rewriting systems: application to a typed object calculus , 2006, Mathematical Structures in Computer Science.

[30]  Pierre Lescanne,et al.  Modeling Sharing and Recursion for Weak Reduction Strategies Using Explicit Substitution , 1996, PLILP.

[31]  Robin Milner,et al.  Definition of standard ML , 1990 .