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

Dan Dougherty (1) , Pierre Lescanne (2, 3) , Luigi Liquori (4, 5) , Frédéric Lang (6)

1 WPI CS - Department of Computer Science
2 ENS de Lyon - École normale supérieure de Lyon
3 LIP - Laboratoire de l'Informatique du Parallélisme
4 MIRHO - Objects, types and prototypes : semantics and validation
5 LOGNET - Logical Networks: Self-organizing Overlay Networks and Programmable Overlay Computing Systems
6 VASY - System validation - Research and applications

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 λObj^a, involving both functional and object-based features.

Mots clés: Term Rewriting System; Graph Rewriting; Lambda Calculi; Object Calculi

Domaines: Informatique et langage [cs.CL]; Logique en informatique [cs.LO]; Bibliothèque électronique [cs.DL]

Dan Dougherty, Pierre Lescanne, Luigi Liquori, Frédéric Lang. Addressed Term Rewriting Systems: Syntax, Semantics, and Pragmatics [Extended Abstract]. Proceedings of the 2nd International Workshop on Term Graph Rewriting (TERMGRAPH 2004), Oct 2004, Rome, Italy. pp.57-82, ⟨10.1016/j.entcs.2004.12.042⟩. ⟨hal-01149607⟩