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.

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]

Fichier principal

2005-termgraph-04.pdf (508.55 Ko)

Origine	Fichiers produits par l'(les) auteur(s)

Luigi Liquori : Connectez-vous pour contacter le contributeur

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

Soumis le : mercredi 13 mai 2015-12:43:51

Dernière modification le : lundi 9 décembre 2024-03:37:20

Archivage à long terme le : mercredi 19 avril 2017-19:00:17

Dates et versions

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

Identifiants

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

Citer

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⟩

Exporter

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

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

501 Consultations

182 Téléchargements