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.
Complete list of metadatas

Cited literature [47 references]  Display  Hide  Download

https://hal.inria.fr/hal-01148846
Contributor : Luigi Liquori <>
Submitted on : Wednesday, May 13, 2015 - 12:52:04 PM
Last modification on : Monday, November 5, 2018 - 3:36:03 PM
Long-term archiving on : Wednesday, April 19, 2017 - 4:31:12 PM

File

2006-mscs-06.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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

Share

Metrics

Record views

568

Files downloads

298