A Semantic Normalization Proof for Inductive Types

Lisa Allali 1 Paul Brauner 2
2 PAREO - Formal islands: foundations and applications
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : Semantics methods have been used to prove cut elimination theorems for a long time. It is only recently that they have been extended to prove strong normalization results. For instance using the notion of super-consistency that is a semantic criterion for theories expressed in deduction modulo implying strong normalization. However, the strong normalization of System T has always been reluctant to such semantic methods. In this paper we give a semantic normalization proof of system T using the super consistency of some theory. We then extend the result to every strictly positive inductive type and discuss the extension to predicate logic.
Type de document :
Rapport
[Research Report] 2008, pp.21
Liste complète des métadonnées

Littérature citée [30 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00280410
Contributeur : Paul Brauner <>
Soumis le : lundi 19 mai 2008 - 13:55:39
Dernière modification le : jeudi 12 avril 2018 - 01:47:12
Document(s) archivé(s) le : vendredi 25 novembre 2016 - 21:58:45

Fichier

paper.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00280410, version 2

Collections

Citation

Lisa Allali, Paul Brauner. A Semantic Normalization Proof for Inductive Types. [Research Report] 2008, pp.21. 〈inria-00280410v2〉

Partager

Métriques

Consultations de la notice

254

Téléchargements de fichiers

76