Reasoning on an imperative object-based calculus in Higher Order Abstract Syntax - CNRS - Centre national de la recherche scientifique Accéder directement au contenu
Communication Dans Un Congrès Année : 2003

Reasoning on an imperative object-based calculus in Higher Order Abstract Syntax

Résumé

We illustrate the benefits of using Natural Deduction in combination with weak Higher-Order Abstract Syntax for formalizing an object-based calculus with objects, cloning, method-update, types with subtyping, and side-effects, in inductive type theories such as the Calculus of Inductive Constructions. This setting suggests a clean and compact formalization of the syntax and semantics of the calculus, with an efficient management of method closures. Using our formalization and the Theory of Contexts, we can prove formally the Subject Reduction Theorem in the proof assistant Coq, with a relatively small overhead.
Fichier principal
Vignette du fichier
2003-merlin-03.pdf (317.57 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01149845 , version 1 (07-05-2015)

Identifiants

Citer

Alberto Ciaffaglione, Luigi Liquori, Marino Miculan. Reasoning on an imperative object-based calculus in Higher Order Abstract Syntax. MERLIN '03. Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding, Aug 2003, Uppsala, Sweden. pp.1-10, ⟨10.1145/976571.976574⟩. ⟨hal-01149845⟩
480 Consultations
104 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More