Reduction-free normalisation for a polymorphic system (1996) [13 citations — 4 self]
by Thorsten Altenkirch, Martin Hofmann, Thomas Streicher, Technische Hochschule Darmstadt
In Proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science
ftp://ftp.tcs.informatik.uni-muenchen.de/pub/alti/publ/LICS96.ps.Z
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Altenkirch96reduction-freenormalisation,author = {Thorsten Altenkirch and Martin Hofmann and Thomas Streicher and Technische Hochschule Darmstadt},
title = {Reduction-free normalisation for a polymorphic system},
booktitle = {In Proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science},
year = {1996},
pages = {98--106},
publisher = {IEEE Computer Society Press}
}
Years of Citing Articles
Abstract:
We give a semantic proof that every term of a combinator version of system F has a normal form. As the argument is entirely formalisable in an impredicative constructive type theory a reduction-free normalisation algorithm can be extracted from this. The proof is presented as the construction of a model of the calculus inside a category of presheaves. Its definition is given entirely in terms of the internal language. 1
Citations
| 530 | A framework for defining logics – Harper, Honsell, et al. - 1993 |
| 101 | et al. Implementing Mathematics with the Nuprl Proof Development System – Constable - 1986 |
| 98 | Sheaves in Geometry and Logic: A First Introduction to Topos Theory – Lane, S, et al. - 1992 |
| 50 | An inverse of the evaluation functional for typed *-calculus – Berger, Schwichtenberg - 1991 |
| 39 | Intuitionistic model constructions and normalization proofs – Coquand, Dybjer - 1997 |
| 27 | Semantics of Type Theory – Streicher - 1991 |
| 25 | Higher-order abstract syntax in Coq – Despeyroux, Felty, et al. |
| 21 | An introduction to fibrations, topos theory, the effective topos and modest sets – Phoa - 1992 |
| 18 | Categorical reconstruction of a reduction-free normalization proof – Altenkirch, Hofmann, et al. - 1995 |
| 15 | Computation and Reasoning – Luo - 1994 |
| 2 | From semantics to rules: a machine-assisted analysis – Coquand - 1994 |
