Related papers: S-storage operators
Existing Curry-Howard interpretations of call-by-value evaluation for the $\lambda$-calculus are either based on ad-hoc modifications of intuitionistic proof systems or involve additional logical concepts such as classical logic or linear…
Most data intensive applications often access only a few fields of the objects they are operating on. Since NVM provides fast, byte-addressable access to durable memory, it is possible to access various fields of an object stored in NVM…
If $G$ is a linearly reductive group acting rationally on a polynomial ring $S$, then the inclusion $S^{G} \hookrightarrow S$ possesses a unique $G$-equivariant splitting, called the Reynolds operator. We describe algorithms for computing…
We prove that an operator system $\mathcal S$ is nuclear in the category of operator systems if and only if there exist nets of unital completely positive maps $\phi_\lambda : \cl S \to M_{n_\lambda}$ and $\psi_\lambda : M_{n_\lambda} \to…
In this paper we study the theory of operators on complex Hilbert spaces, which attain their minimum in the unit sphere. We prove some important results concerning the characterization of the N*, and also AN* operators, see respectively…
In a recent work, Girard proposed a new and innovative approach to computational complexity based on the proofs-as-programs correspondence. In a previous paper, the authors showed how Girard proposal succeeds in obtaining a new…
Choice constructs are an important part of the language of logic programming, yet the study of their semantics has been a challenging task. So far, only two-valued semantics have been studied, and the different proposals for such semantics…
Counting inversions is a classic and important problem in databases. The number of inversions, $K^*$, in a list $L=(L(1),L(2),\ldots,L(n))$ is defined as the number of pairs $i < j$ with $L(i) > L(j)$. In this paper, new results for this…
The concept of ``countable set'' is attributed to Georg Cantor, who set the boundary between countable and uncountable sets in 1874. The concept of ``computable set'' arose in the study of computing models in the 1930s by the founders of…
In-place associative integer sorting technique was proposed for integer lists which requires only constant amount of additional memory replacing bucket sort, distribution counting sort and address calculation sort family of algorithms.…
Multidimensional genetic programming represents candidate solutions as sets of programs, and thereby provides an interesting framework for exploiting building block identification. Towards this goal, we investigate the use of machine…
The theory of the call-by-value lambda-calculus relies on weak evaluation and closed terms, that are natural hypotheses in the study of programming languages. To model proof assistants, however, strong evaluation and open terms are…
In this paper, we propose a new concept of derivative with respect to an arbitrary kernel-function. Several properties related to this new operator, like inversion rules, integration by parts, etc. are studied. In particular, we introduce…
Earlier work on modular arithmetic of k-ary representations of length L of the natural numbers in quantum mechanics is extended here to k-ary representations of all natural numbers, and to integers and rational numbers. Since the length L…
Let $\mathfrak M$ and $\mathfrak N$ be separable Hilbert spaces and let $\Theta(\lambda)$ be a function from the Schur class ${\bf S}(\mathfrak M,\mathfrak N)$ of contractive functions holomorphic on the unit disk. The operator…
We study the semantic meaning of block structure using game semantics. To that end, we introduce the notion of block-innocent strategies and characterise call-by-value computation with block-allocated storage through soundness, finite…
A comparison of Landin's form of lambda calculus with Church's shows that, independently of the lambda calculus, there exists a mechanism for converting functions with arguments indexed by variables to the usual kind of function where the…
Introduced by Duffin and Schaefer as a part of their work on nonhamonic fourrier series in 1952, the theory of frames has undergone a very interesting evolution in recent decades following the multiplicity of work carried out in this field.…
We are used to thinking of an operator acting once, twice, and so on. However, an operator acting integer times can be consistently analytic continued to an operator acting complex times. Applications: (s,r) diagrams and an extension of…
We give an adequate, concrete, categorical-based model for Lambda-S, which is a typed version of a linear-algebraic lambda calculus, extended with measurements. Lambda-S is an extension to first-order lambda calculus unifying two approaches…