A calculus of constructions with explicit subtyping - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

A calculus of constructions with explicit subtyping

Résumé

The calculus of constructions can be extended with an infinite hierarchy of universes and cumulative subtyping. In this hierarchy, each universe is contained in a higher universe. Subtyping is usually left implicit in the typing rules. We present an alternative version of the calculus of constructions where subtyping is explicit. This new system avoids problems related to coercions and dependent types by using the Tarski style of universes and by introducing additional equations to reflect equality.
Fichier principal
Vignette du fichier
coc-explicit-subtyping-types-2014 (1).pdf (558.06 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01097401 , version 1 (19-12-2014)
hal-01097401 , version 2 (14-01-2016)

Licence

Paternité

Identifiants

  • HAL Id : hal-01097401 , version 2

Citer

Ali Assaf. A calculus of constructions with explicit subtyping. 20th International Conference on Types for Proofs and Programs (TYPES 2014), May 2014, Institut Henri Poincaré, Paris, France. ⟨hal-01097401v2⟩

Collections

X INRIA INRIA2
784 Consultations
818 Téléchargements

Partager

Gmail Facebook X LinkedIn More