Abstract In 1990, J.L. Krivine introduced the notion of storage operator to simulate, for Church integers, the “call by value ” in a context of a “call by name ” strategy. In this present paper, we define, for every λ-term S which realizes the successor function on Church integers, the notion of S-storage operator. We prove that every storage operator is a S-storage operator. But the converse is not always true
A storage structures formalism is described which can be used as a precise symbolic representation o...
In this paper, we formulate and prove new results in the context of storage functions for lossless s...
International audienceWe will give a survey of some results in realizability including: * basic noti...
AbstractThe notion of storage operator introduced in J.-L. Krivine, 1991, 1990 appears to be an impo...
International audienceIn 1990 Krivine introduced the notion of storage operators. They are $\lambda$...
International audienceIn 1990, J.L. Krivine introduced the notion of storage operator to simulate, i...
International audienceIn 1990, J.L. Krivine introduced the notion of storage operator to simulate "c...
To every many-valued logic L we associate a logic LS obtained from L by the adding of a storage oper...
Abstract: In this note we consider a storage process with an inverse sub-ordinator input. The basic ...
International audienceStorage operators have been introduced by J.L. Krivine in [5] ; they are close...
AbstractWe describe here a simple method in order to obtain programs from proofs in second-order cla...
AbstractA generalization of nondeterminism, called consistent nondeterminism, is investigated. It is...
Storage capacity of the linear associator: beginnings of a theory of computational memor
In this thesis, a storage model with infinite capacity, additive stochastic input and unit release p...
International audienceA numeral system is a sequence of an infinite different closed normal $\lambda...
A storage structures formalism is described which can be used as a precise symbolic representation o...
In this paper, we formulate and prove new results in the context of storage functions for lossless s...
International audienceWe will give a survey of some results in realizability including: * basic noti...
AbstractThe notion of storage operator introduced in J.-L. Krivine, 1991, 1990 appears to be an impo...
International audienceIn 1990 Krivine introduced the notion of storage operators. They are $\lambda$...
International audienceIn 1990, J.L. Krivine introduced the notion of storage operator to simulate, i...
International audienceIn 1990, J.L. Krivine introduced the notion of storage operator to simulate "c...
To every many-valued logic L we associate a logic LS obtained from L by the adding of a storage oper...
Abstract: In this note we consider a storage process with an inverse sub-ordinator input. The basic ...
International audienceStorage operators have been introduced by J.L. Krivine in [5] ; they are close...
AbstractWe describe here a simple method in order to obtain programs from proofs in second-order cla...
AbstractA generalization of nondeterminism, called consistent nondeterminism, is investigated. It is...
Storage capacity of the linear associator: beginnings of a theory of computational memor
In this thesis, a storage model with infinite capacity, additive stochastic input and unit release p...
International audienceA numeral system is a sequence of an infinite different closed normal $\lambda...
A storage structures formalism is described which can be used as a precise symbolic representation o...
In this paper, we formulate and prove new results in the context of storage functions for lossless s...
International audienceWe will give a survey of some results in realizability including: * basic noti...