Related papers: S-storage operators
Derivatives and integration operators are well-studied examples of linear operators that commute with scaling up to a fixed multiplicative factor; i.e., they are scale-invariant. Fractional order derivatives (integration operators) also…
Like the notion of computation via (strong) monads serves to classify various flavours of impurity, including exceptions, non-determinism, probability, local and global store, the notion of guardedness classifies well-behavedness of cycles…
Structural operational semantics (SOS) is a technique for defining operational semantics for programming and specification languages. Because of its intuitive appeal and flexibility, SOS has found considerable application in the study of…
This paper formalizes and proves correct a compilation scheme for mutually-recursive definitions in call-by-value functional languages. This scheme supports a wider range of recursive definitions than previous methods. We formalize our…
In this paper we revisit the hypothesis needed to define the "paracomposition" operator, an analogue to the classic pull-back operation in the low regularity setting, first introduced by S. Alinhac in [3]. More precisely we do so in two…
In Bender and Dokuchaev (2013), we studied a control problem related to swing option pricing in a general non-Markovian setting. The main result there shows that the value process of this control problem can be uniquely characterized in…
In an impressive series of papers, Krivine showed at the edge of the last decade how classical realizability provides a surprising technique to build models for classical theories. In particular, he proved that classical realizability…
Secure Computation (SC) is a family of cryptographic primitives for computing on encrypted data in single-party and multi-party settings. SC is being increasingly adopted by industry for a variety of applications. A significant obstacle to…
In the present paper, we consider nonlinear Markov operators, namely polynomial stochastic operators. We introduce a notion of orthogonal preserving polynomial stochastic operators. The purpose of this study is to show that surjectivity of…
How can an author store digital information so that it will be reliably useful, even years later when he is no longer available to answer questions? Methods that might work are not good enough; what is preserved today should be reliably…
We consider the following problem that arises in outsourced storage: a user stores her data $x$ on a remote server but wants to audit the server at some later point to make sure it actually did store $x$. The goal is to design a…
Given a separable unital C*algebra $C$, let $E_n$ denote the Hilbert module equal to the completion of the Schwartz space of rapidly decreasing smooth functions from $R^n$ to $C$ equipped with the $C$-valued inner product given by…
A derived operation is a bilinear operation on a commutative associative algebra $A$ defined intrinsically out of its product and several derivations of the product. We show that operators of left (or right) multiplications of a derived…
At the allocation and deallocation of small objects with fixed size, the standard allocator of the runtime system has commonly a worse time performance compared to allocators adapted for a special application field. We propose a memory…
The concept of ownership in high level languages can aid both the programmer and the compiler to reason about the validity of memory operations. Previously, ownership semantics has been used successfully in high level automatic program…
Arguably data is the new natural resource in the enterprise world with an unprecedented degree of proliferation. But to derive real-time actionable insights from the data, it is important to bridge the gap between managing the data that is…
In this paper we present an implicit dynamic dictionary with the working-set property, supporting insert(e) and delete(e) in O(log n) time, predecessor(e) in O(log l_{p(e)}) time, successor(e) in O(log l_{s(e)}) time and search(e) in O(log…
We give new call-by-value calculi of control operators that are complete for the continuation-passing style semantics. Various anticipated computational properties are induced from the completeness. In the first part of a series of papers,…
Supermartingales are here defined on a non-probabilistic setting and can be interpreted solely in terms of superhedging operations. The classical expectation operator is replaced by a pair of subadditive operators one of them providing a…
The notion of slicely countably determined (SCD) sets was introduced in 2010 by A.~Avil\'{e}s, V.~Kadets, M.~Mart\'{i}n, J.~Mer\'{i} and V.~Shepelska. We solve in the negative some natural questions about preserving being SCD by the…