Systèmes de types purs et séquents classique.

Abstract : The bar lambda mu tilde mu-calculus was designed by P.-L. Curien and H.Herbelin. One of its interest is that its terms can be interpreted asderivations in the classical sequent calculus. One of the its lacks isthe fact that it has only simple types. Our purpose here is to extendthe calculus to higher-order types, and especially those of thecalculus of constructions, a calculus designed by T. Coquand and G.Huet in order to provide a very general typed language for proofassistants based on \lambda-calculus. In order to do this, we placeourselves in the framework of pure type systems, which are a verygeneral formalism allowing to represent many interesting type systems,among which those of Barendregt's lambda-cube, which is a hierarchicalpresentation of the calculus of constructions. We show that our systemssatisfy some fundamental properties, such as subject reduction, andstrong normalisation on the lambda-cube.
Document type :
Reports
Complete list of metadatas

https://hal-lara.archives-ouvertes.fr/hal-02102422
Contributor : Colette Orange <>
Submitted on : Wednesday, April 17, 2019 - 11:51:34 AM
Last modification on : Friday, April 19, 2019 - 1:38:14 AM

File

RR2006-36.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02102422, version 1

Collections

Citation

Romain Kervac. Systèmes de types purs et séquents classique.. [Rapport de recherche] LIP RR-2006-36, Laboratoire de l'informatique du parallélisme. 2006, 2+27p. ⟨hal-02102422⟩

Share

Metrics

Record views

2

Files downloads

12