Skip to Main content Skip to Navigation
Conference papers

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

Alberto Ciaffaglione 1, 2 Luigi Liquori 2, 3 Marino Miculan 1
2 MIRHO - Objects, types and prototypes : semantics and validation
CRISAM - Inria Sophia Antipolis - Méditerranée , UHP - Université Henri Poincaré - Nancy 1, Université Nancy 2, INPL - Institut National Polytechnique de Lorraine, CNRS - Centre National de la Recherche Scientifique : UMR7503
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.
Complete list of metadatas

Cited literature [28 references]  Display  Hide  Download
Contributor : Luigi Liquori <>
Submitted on : Thursday, May 7, 2015 - 4:49:39 PM
Last modification on : Saturday, January 27, 2018 - 1:31:33 AM
Long-term archiving on: : Wednesday, April 19, 2017 - 7:23:14 PM


Files produced by the author(s)




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⟩



Record views


Files downloads