A Semantic Normalization Proof for Inductive Types - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2008

A Semantic Normalization Proof for Inductive Types


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.
Fichier principal
Vignette du fichier
paper.pdf (250.1 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00280410 , version 1 (17-05-2008)
inria-00280410 , version 2 (19-05-2008)


  • HAL Id : inria-00280410 , version 2


Lisa Allali, Paul Brauner. A Semantic Normalization Proof for Inductive Types. [Research Report] 2008, pp.21. ⟨inria-00280410v2⟩
180 View
77 Download


Gmail Facebook X LinkedIn More