A Proof of Strong Normalisation using Domain Theory - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2006

A Proof of Strong Normalisation using Domain Theory


U. Berger, significantly simplified Tait's normalisation proof for bar recursion, replacing Tait's introduction of infinite terms by the construction of a domain having the property that a term is strongly normalizing if its semantics is not bottom. The goal of this paper is to show that, using ideas from the theory of intersection types and Martin-Löf's domain interpretation of type theory, we can in turn simplify U. Berger's argument in the construction of such a domain model. We think that our domain model can be used to give modular proofs of strong normalization for various type theory. As an example, we show in some details how it can be used to prove strong normalization for Martin-Löf dependent type theory extended with bar recursion, and with some form of proof-irrelevance.
Fichier principal
Vignette du fichier
sn2.pdf (175.44 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00432490 , version 1 (16-11-2009)



Thierry Coquand, Arnaud Spiwack. A Proof of Strong Normalisation using Domain Theory. LICS 2006, Aug 2006, Seatle, United States. 10 p., ⟨10.1109/LICS.2006.8⟩. ⟨inria-00432490⟩
135 View
259 Download



Gmail Facebook Twitter LinkedIn More