Mixed Logic and Storage Operators

TL;DR

This paper introduces a new classical type system based on mixed logic that characterizes storage and control operators, extending Krivine's work and connecting to Parigot's λμ-calculus.

Contribution

It presents a novel classical type system using mixed logic to characterize storage and control operators, improving upon Krivine's previous systems.

Findings

Characterization of storage operators using mixed logic types

Extension of type systems to include control operators

Comparison with Parigot's λμ-calculus results

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\"odel 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 $\lambda\mu$-calculus.