Reasoning on an imperative object-based calculus in Higher Order Abstract Syntax - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2003

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

Abstract

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
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

Cite

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 View
104 Download

Altmetric

Share

Gmail Facebook X LinkedIn More