| Type of document: |
 |
Peer-reviewed conferences/proceedings |
|
| Domain: |
|
|
|
| Title: |
|
A Proof of Strong Normalisation using Domain Theory |
|
| Author(s): |
|
Thierry Coquand ( ) 1, Arnaud Spiwack () 2, 3 |
|
| Research team(s): |
|
|
|
| Abstract: |
|
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. |
|
| Full text language: |
|
English |
|
|
| Publication date: |
|
2006 |
|
| Audience: |
|
international |
|
| Conference title: |
|
LICS 2006 |
|
| Conference city: |
|
Seatle |
|
| Country: |
|
United States |
|
| Conference date: |
|
2006-08-12 |
|
| Conference date (end): |
|
2006-08-15 |
|
| Pagination: |
|
10 p. |
|
|
BibTeX,EndNote,...
