Skip to Main content Skip to Navigation
New interface
Journal articles

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 metadata

Cited literature [47 references]  Display  Hide  Download
Contributor : Luigi Liquori Connect in order to contact the contributor
Submitted on : Wednesday, May 13, 2015 - 12:52:04 PM
Last modification on : Friday, November 18, 2022 - 9:27:00 AM
Long-term archiving on: : Wednesday, April 19, 2017 - 4:31:12 PM


Files produced by the author(s)



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⟩



Record views


Files downloads