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

Authors:
Alberto Ciaffaglione;Luigi Liquori;Marino Miculan
Affiliations:
University of Udine, Italy;INRIA-LORIA, Nancy, France;University of Udine, Italy
Venue:
MERLIN '03 Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
Year:
2003

Citing 13
Cited 1

Higher-order abstract syntax

PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Operational semantics in a natural deduction setting

Logical frameworks
A framework for defining logics

Journal of the ACM (JACM)
The expressive power of structural operational semantics with explicit assumptions

TYPES '93 Proceedings of the international workshop on Types for proofs and programs
&pgr;-calculus in (Co)inductive-type theory

Theoretical Computer Science - Special issues on models and paradigms for concurrency
On the formalization of the modal &mgr;-calculus in the calculus of inductive constructions

Information and Computation
A Theory of Objects

A Theory of Objects
A lambda calculus of objects and method specialization

Nordic Journal of Computing
Higher-Order Abstract Syntax in Coq

TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
A Logic of Object-Oriented Programs

TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Semantical Analysis of Higher-Order Abstract Syntax

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Abstract Syntax and Variable Binding

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Multi-level meta-reasoning with higher-order abstract syntax

FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software

Plug and Play the Theory of Contexts in Higher-Order Abstract Syntax

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

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.