---
abstract: |
    In 1990 J-L. Krivine introduced the notion of storage operators. They are $\l$-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. We present also a similar result in the M. Parigot’s $\l \m$-calculus.
---

=Symbol at 16pt =Symbol at 10pt ł Ł PS. Ø v

\[section\] \[section\] \[section\] \[section\]

**Mixed Logic and Storage Operators\
**

**Karim NOUR\
LAMA - Equipe de Logique, Université de Chambéry\
73376 Le Bourget du Lac\
