Addressed term rewriting systems: application to a typed object calculus - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Mathematical Structures in Computer Science Year : 2006

Addressed term rewriting systems: application to a typed object calculus

Abstract

We present a formalism called Addressed Term Rewriting Systems, which can be used to model implementations of theorem proving, symbolic computation, and programming languages, especially aspects of sharing, recursive computations and cyclic data structures. Addressed Term Rewriting Systems are therefore well suited for describing object-based languages, and as an example we present a language called λObj^a , incorporating both functional and object-based features. As a case study in how reasoning about languages is supported in the ATRS formalism a type system for λObj^a is defined and a type soundness result is proved.
Fichier principal
Vignette du fichier
2006-mscs-06.pdf (895.93 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

Cite

Daniel J. Dougherty, Pierre Lescanne, Luigi Liquori. Addressed term rewriting systems: application to a typed object calculus. Mathematical Structures in Computer Science, 2006, 16 (issue 4), pp.667-709. ⟨10.1017/S096012950600541X⟩. ⟨hal-01148846⟩
266 View
259 Download

Altmetric

Share

Gmail Facebook X LinkedIn More