International audienceIn 1990 Krivine introduced the notion of storage operators. They are $\lambda$-terms which simulate call-by-value in the call-by-name strategy. Krivine has shown that there is a very simple type in the AF2 type system for storage operators using Gödel translation from classical to intuitionistic logic. Parigot and Krivine have shown that storage operators play an important tool in classical logic. In this paper, we present a synthesis of various results on this subject
AbstractWe introduce in this paper a certain mathematical model of information storage and retrieval...
Storage capacity of the linear associator: beginnings of a theory of computational memor
We address the problem of giving a clean and uniform mathematical model for handling user defined da...
International audienceIn 1990, J.L. Krivine introduced the notion of storage operator to simulate, i...
International audienceIn 1990 Krivine introduced the notion of storage operators. They are $\lambda$...
AbstractWe describe here a simple method in order to obtain programs from proofs in second-order cla...
AbstractThe notion of storage operator introduced in J.-L. Krivine, 1991, 1990 appears to be an impo...
International audienceIn 1990 J-L. Krivine introduced the notion of storage operators. They are $\la...
Abstract In 1990, J.L. Krivine introduced the notion of storage operator to simulate, for Church int...
International audienceIn 1990, J.L. Krivine introduced the notion of storage operator to simulate "c...
International audienceStorage operators have been introduced by J.L. Krivine in [5] ; they are close...
International audienceWe will give a survey of some results in realizability including: * basic noti...
To every many-valued logic L we associate a logic LS obtained from L by the adding of a storage oper...
A storage structures formalism is described which can be used as a precise symbolic representation o...
AbstractTwo different operational interpretations of intuitionistic linear logic have been proposed ...
AbstractWe introduce in this paper a certain mathematical model of information storage and retrieval...
Storage capacity of the linear associator: beginnings of a theory of computational memor
We address the problem of giving a clean and uniform mathematical model for handling user defined da...
International audienceIn 1990, J.L. Krivine introduced the notion of storage operator to simulate, i...
International audienceIn 1990 Krivine introduced the notion of storage operators. They are $\lambda$...
AbstractWe describe here a simple method in order to obtain programs from proofs in second-order cla...
AbstractThe notion of storage operator introduced in J.-L. Krivine, 1991, 1990 appears to be an impo...
International audienceIn 1990 J-L. Krivine introduced the notion of storage operators. They are $\la...
Abstract In 1990, J.L. Krivine introduced the notion of storage operator to simulate, for Church int...
International audienceIn 1990, J.L. Krivine introduced the notion of storage operator to simulate "c...
International audienceStorage operators have been introduced by J.L. Krivine in [5] ; they are close...
International audienceWe will give a survey of some results in realizability including: * basic noti...
To every many-valued logic L we associate a logic LS obtained from L by the adding of a storage oper...
A storage structures formalism is described which can be used as a precise symbolic representation o...
AbstractTwo different operational interpretations of intuitionistic linear logic have been proposed ...
AbstractWe introduce in this paper a certain mathematical model of information storage and retrieval...
Storage capacity of the linear associator: beginnings of a theory of computational memor
We address the problem of giving a clean and uniform mathematical model for handling user defined da...