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

Keywords

Term Rewriting System Graph Rewriting Lambda Calculi Object Calculi

Domains

Computation and Language [cs.CL] Logic in Computer Science [cs.LO] Digital Libraries [cs.DL]

Fichier principal

2005-termgraph-04.pdf (508.55 Ko)

Origin	Files produced by the author(s)

Luigi Liquori : Connect in order to contact the contributor

https://inria.hal.science/hal-01149607

Submitted on : Wednesday, May 13, 2015-12:43:51 PM

Last modification on : Thursday, April 4, 2024-6:18:24 PM

Long-term archiving on: Wednesday, April 19, 2017-7:00:17 PM

Dates and versions

hal-01149607 , version 1 (13-05-2015)

Identifiers

HAL Id : hal-01149607 , version 1
DOI : 10.1016/j.entcs.2004.12.042

Cite

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

ENS-LYON UGA CNRS INRIA UNIV-LYON1 LIG UNIV-LORRAINE INRIA2 UDL LIG_SIDCH

488 View

175 Download