Hostname: page-component-7479d7b7d-wxhwt Total loading time: 0 Render date: 2024-07-10T15:26:49.589Z Has data issue: false hasContentIssue false
  • English
  • Français

Les I-types du système ${\cal F}$

Published online by Cambridge University Press:  15 April 2002

K. Nour
K. Nour*
Affiliation:
LAMA, Équipe de Logique, Université de Chambéry, 73376 Le Bourget du Lac, France ; e-mail: nour@univ-savoie.fr
Get access

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

λI-calculussystem ${\cal F}$I-type
Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 35 , Issue 3 , May 2001 , pp. 223 - 237
Copyright
© EDP Sciences, 2001

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

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.