No CrossRef data available.
Article contents
Les I-types du système ${\cal F}$
Published online by Cambridge University Press: 15 April 2002
Abstract
We prove in this paper that the types of system ${\cal F}$ inhabited uniquely by λI-terms (the I-types) have a positive quantifier. We give also consequences of this result and some examples.
Keywords
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, 2001
References
H. Barendregt, The lambda calculus, its syntax and semantics. North Holland (1984).
S. Farkh, Types de données en logique du second ordre, Thèse de doctorat. Université de Savoie, France (1998).
J.-Y. Girard, Y. Lafont et P. Taylor, Proofs and types. Cambridge University Press (1986).
J.-L. Krivine, Lambda calcul, types et modèles. Masson (1990).
Nour, K., Opérateurs de mise en mémoire et types ∀-positifs.
RAIRO: Theoret. Informatics Appl.
30 (1996) 261-293.