A-translation and Looping Combinators in Pure Type Systems (1994)
by
Thierry Coquand
,
Hugo Herbelin
| Venue: | Journal of Functional Programming |
| Citations: | 9 - 1 self |
BibTeX
@ARTICLE{Coquand94a-translationand,
author = {Thierry Coquand and Hugo Herbelin},
title = {A-translation and Looping Combinators in Pure Type Systems},
journal = {Journal of Functional Programming},
year = {1994},
volume = {4},
pages = {77--88}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present here a generalization of A-translation to a class of Pure Type Systems. We apply this translation to give a direct proof of the existence of a looping combinator in a large class of inconsistent type systems, class which includes type systems with a type of all types. This is the first non-automated solution to this problem.
Citations
| 221 | Interprétation fonctionnelle et élimination des coupures de l’arithmétique d’ordre supérieur. Thèse de Doctorat d’ État, Université de Paris VII - Girard - 1972 |
| 61 | Extracting Constructive Content from Classical Proofs - Murthy - 1990 |
| 56 | Classically and intuitionistically provably recursive functions - Friedman - 1978 |
| 49 | Introduction to generalized type systems - Barendregt - 1991 |
| 18 | Modular proof of strong normalisation for the calculus of constructions - Geuvers, Nederhof - 1989 |
| 13 | The computational behaviour of Girard’s paradox - Howe |
| 12 | Syntactic translations and provably recursive functions - Leivant |
| 11 | M.B.Reinhold: 'Type' is not a type - Meyer - 1986 |
| 5 | Extraction de programmes dans le calcul des constructions - Paulin - 1989 |
| 1 | A New Paradox in Type Theory. To appear - Coquand - 1991 |
| 1 | On the principle of excluded middle. 1925. in From Frege to Godel : a source book in mathematical logic - Kolmogorov - 1967 |
