A Formalization of a Concurrent Object Calculus Up to Alpha-Conversion

A Formalization of a Concurrent Object Calculus Up to Alpha-Conversion (1999)

by Guillaume Gillard , Inria Sophia Antipolis

Citations:

3 - 0 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	A Formalization of a Concurrent Object Calculus Up to Alpha-Conversion	user correction - Legacy Corrections
AUTHOR NAME	Guillaume Gillard	SVM HeaderParse 0.1
AUTHOR NAME	Inria Sophia Antipolis	SVM HeaderParse 0.1
ABSTRACT	We experiment a method for representing a concurrent object calculus in the Calculus of Inductive Constructions. Terms are first defined in de Bruijn style, then names are re-introduced in binders. The terms of the calculus are formalized in the mechanized logic by suitable subsets of the de Bruijn terms; namely those whose de Bruijn indices are relayed beyond the scene. The ff-equivalence relation is the Leibnitz equality and the substitution functions can de defined as sets of partial rewriting rules on these terms. We prove induction schemes for both the terms and some properties of the calculus which internalize the renaming of bound variables . We show that, despite that the terms which formalize the calculus are not generated by a last fixed point relation, we can prove the desire inversion lemmas. We formalize the computational part of the semantic and a simple type system of the calculus. At least, we prove a subject reduction theorem and see that the specications and proofs have the nice feature of not mixing de Bruijn technical manipulations with real proofs.	user correction - Legacy Corrections
YEAR	1999	user correction - Legacy Corrections
CITATIONS	13 found	ParsCit 1.0