Related papers: A General Type for Storage Operators
In 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…
In 1990, J.L. Krivine introduced the notion of storage operator to simulate "call by value" in the "call by name" strategy. J.L. Krivine has shown that, using G\"odel translation of classical into intuitionitic logic, we can find a simple…
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…
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 $\lambda$-term S which realizes the…
J.-L. Krivine introduced the AF2 type system in order to obtain programs ($\lambda$-terms) which calculate functions, by writing demonstrations of their totalities. We present in this paper two results of completness for some types of AF2…
A numeral system is a sequence of an infinite different closed normal $\lambda$-terms which has closed $\lambda$-terms for successor and zero test. A numeral system is said adequate iff it has a closed $\lambda$-term for predecessor. A…
Calculi with control operators have been studied to reason about control in programming languages and to interpret the computational content of classical proofs. To make these calculi into a real programming language, one should also…
In this work we propose a generalization of the concept of Ruelle operator for one dimensional lattices used in thermodynamic formalism and ergodic optimization, which we call generalized Ruelle operator, that generalizes both the Ruelle…
We present gradual type theory, a logic and type theory for call-by-name gradual typing. We define the central constructions of gradual typing (the dynamic type, type casts and type error) in a novel way, by universal properties relative to…
In the classical operator theory, there are several versions of spectra, related to special classes of operators (Fredholm, semi-Fredholm, upper/lower semi-Fredholm,etc.). We generalize these notions for adjointable operators on Hilbert…
Continuation Calculus (CC), introduced by Geron and Geuvers, is a simple foundational model for functional computation. It is closely related to lambda calculus and term rewriting, but it has no variable binding and no pattern matching. It…
Fixpoint operators are tools to reason on recursive programs and data types obtained by induction (e.g. lists, trees) or coinduction (e.g. streams). They were given a categorical treatment with the notion of categories with fixpoints. A…
The operational behavior of control operators has been studied comprehensively in the past few decades, but type systems of control operators have not. There are distinct type systems for shift, control, and shift0 without any relationship…
Closure operators are very useful tools in several areas of classical mathematics and in general category theory. In fuzzy set theory, fuzzy closure operators have been studied by G. Gerla (1966). These works generally define a fuzzy subset…
Typed operational semantics is a method developed by H. Goguen to prove meta-theoretic properties of type systems. This paper studies the metatheory of a type system with dependent record types, using the approach of typed operational…
In the setting of modern mathematical logic and model theory, classification theory has been one of the landmark achievements of the field. Likewise, the classification of UHF-algebras and AF-algebras were substantial contributions to the…
This paper introduces a simple type system for combinatory logic in which combinators have at most one type, whose polymorphism is revealed by application. The combinatory types exactly describe the structure of their values, which may be…
The purpose of this work is to complete the algebraic foundations of second-order languages from the viewpoint of categorical algebra as developed by Lawvere. To this end, this paper introduces the notion of second-order algebraic theory…
We show that recent approaches of static analysis based on quantitative typing systems can be extended to programming languages with global state. More precisely, we define a call-by-value language equipped with operations to access a…
Starting from the definition of A-Fredholm and semi-A-Fredholm operator on the standard module over a unital C*- algebra A, introduced in [8] and [4], we construct various generalizations of these operators and obtain several results as an…