Abstract. In 1990 J-L. Krivine introduced the notion of storage operators. They are
$\lambda$-terms which simulate call-by-value in the call-by-name strategy and they can be used in order to modelize assignment instructions. J-L. Krivine has shown that there is a very simple second order type in AF2 type system for storage operators using Gödel translation of classical to intuitionistic logic. In order to modelize the control operators, J-L. Krivine has extended the system AF2 to the classical logic. In his system the property of the unicity of integers representation is lost, but he has shown that storage operators typable in the system AF2 can be used to find the values of classical integers. In this paper, we present a new classical type system based on a logical system called mixed logic. We prove that in this system we can characterize, by types, the storage operators and the control operators.
[1]
Jean-Louis Krivine,et al.
Lambda-calcul, évaluation paresseuse et mise en mémoire
,
1991,
RAIRO Theor. Informatics Appl..
[2]
Michel Parigot,et al.
Free Deduction: An Analysis of "Computations" in Classical Logic
,
1990,
RCLP.
[3]
Karim Nour.
A General Type for Storage Operators
,
1995,
Math. Log. Q..
[4]
J. Krivine.
Lambda-calcul : types et modèles
,
1990
.
[5]
Jean-Louis Krivine,et al.
A General Storage Theorem for Integers in Call-by-Name lambda-Calculus
,
1994,
Theor. Comput. Sci..
[6]
Jean-Louis Krivine,et al.
Opérateurs de mise en mémoire et traduction de Gödel
,
1990,
Arch. Math. Log..
[7]
Michel Parigot,et al.
Classical Proofs as Programs
,
1993,
Kurt Gödel Colloquium.
[8]
Karim Nour.
Operateurs de mise en memoire en lambda-calcul pur et type
,
1993
.