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.
Type de document :
Article dans une revue
Mathematical Structures in Computer Science, Cambridge University Press (CUP), 2006, 16 (issue 4), pp.667-709. <10.1017/S096012950600541X>
Liste complète des métadonnées

https://hal.inria.fr/hal-01148846
Contributeur : Luigi Liquori <>
Soumis le : mercredi 13 mai 2015 - 12:52:04
Dernière modification le : jeudi 14 mai 2015 - 01:11:08

Fichier

2006-mscs-06.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

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>

Partager

Métriques

Consultations de
la notice

244

Téléchargements du document

187