A Generic Normalisation Proof for Pure Type Systems

Abstract : We prove the strong normalisation for any PTS, provided the existence of a certain $\Lambda$-set $\A for every sort s of the system. The properties verified by the $\A's depend of the axioms and rules of the type system. A slightly shortened version of this work has been published under the same title in the volume «Types for Proofs and Programs», Internatio- nal workshop TYPES'96, E. Gimenez and C. Paulin-Mohring Eds, LNCS 1512, Springer-Verlag, 1998.
Type de document :
Rapport
[Research Report] RR-3548, INRIA. 1998
Liste complète des métadonnées

https://hal.inria.fr/inria-00073135
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 11:57:32
Dernière modification le : vendredi 25 mai 2018 - 12:02:05
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:35:27

Fichiers

Identifiants

  • HAL Id : inria-00073135, version 1

Collections

Citation

Paul-André Melliès, Benjamin Werner. A Generic Normalisation Proof for Pure Type Systems. [Research Report] RR-3548, INRIA. 1998. 〈inria-00073135〉

Partager

Métriques

Consultations de la notice

137

Téléchargements de fichiers

294