4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Operational semantics in a natural deduction setting
Logical frameworks
Co-induction in relational semantics
Theoretical Computer Science
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
Proof theoretic approach to specification languages
Proof theoretic approach to specification languages
&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 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
Codifying Guarded Definitions with Recursive Schemes
TYPES '94 Selected papers from the International Workshop on Types for Proofs and Programs
Formal Verification of a Java Compiler in Isabelle
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
A Formalization of a Concurrent Object Calculus up to alpha-Conversion
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Two-Level Meta-reasoning in Coq
TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
Information and Computation
Theoretical Computer Science - Foundations of software science and computation structures
A Logic for Reasoning with Higher-Order Abstract Syntax
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
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
Recursion over objects of functional type
Mathematical Structures in Computer Science
Mechanising Hankin and Barendregt using the Gordon-Melham axioms
MERLIN '03 Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
Consistency of the theory of contexts
Journal of Functional Programming
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
A mechanized model of the theory of objects
FMOODS'07 Proceedings of the 9th IFIP WG 6.1 international conference on Formal methods for open object-based distributed systems
Composing safely: a type system for aspects
SC'08 Proceedings of the 7th international conference on Software composition
Journal of Automated Reasoning
ASPfun: A typed functional active object calculus
Science of Computer Programming
| Hi-index | 0.00 |
We illustrate a methodology for formalizing and reasoning about Abadi and Cardelli's object-based calculi, in (co)inductive type theory, such as the Calculus of (Co)Inductive Constructions, by taking advantage of natural deduction semantics and coinduction in combination with weak higher-order abstract syntax and the Theory of Contexts. Our methodology allows us to implement smoothly the calculi in the target metalanguage; moreover, it suggests novel presentations of the calculi themselves. In detail, we present a compact formalization of the syntax and semantics for the functional and the imperative variants of the 驴-calculus. Our approach simplifies the proof of subject deduction theorems, which are proved formally in the proof assistant Coq with a relatively small overhead.