相关论文: S-storage operators
The elegant 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…
An extension of the Super KdV integrable system in terms of operator valued functions is obtained. Following the ideas of Gardner, a general algebraic approach for finding the infinitely many conserved quantities of integrable systems is…
We study a classical realizability model (in the sense of J.-L. Krivine) arising from a model of untyped lambda calculus in coherence spaces. We show that this model validates countable choice using bar recursion and bar induction.
The usual theory of asset pricing in finance assumes that the financial strategies, i.e. the quantity of risky assets to invest, are real-valued so that they are not integer-valued in general, see the Black and Scholes model for instance.…
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. The…
We define a variant of realizability where realizers are pairs of a term and a substitution. This variant allows us to prove the normalization of a simply-typed call-by-need $$\lambda$-$calculus with control due to Ariola et al. Indeed, in…
We study integral operators on the space of square-integrable functions from a compact set, $X$, to a separable Hilbert space, $H$. The kernel of such an operator takes values in the ideal of Hilbert-Schmidt operators on $H$. We establish…
We generalize an operation described by Sloane on the binary representation of an integer to other bases, thus finding several new sequences.
In general, it is a non trivial task to determine the adjoint $S^*$ of an unbounded operator $S$ acting between two Hilbert spaces. We provide necessary and sufficient conditions for a given operator $T$ to be identical with $S^*$. In our…
Operator-valued frames are natural generalization of frames that have been used in quantum computing, packets encoding, etc. In this paper, we focus on developing the theory about operator-valued frames for finite Hilbert spaces. Some…
Configuring a storage system to better serve an application is a challenging task complicated by a multidimensional, discrete configuration space and the high cost of space exploration (e.g., by running the application with different…
The storage manager, as a key component of the database system, is responsible for organizing, reading, and delivering data to the execution engine for processing. According to the data serving mechanism, existing storage managers are…
In this paper we consider the problems of supervised classification and regression in the case where attributes and labels are functions: a data is represented by a set of functions, and the label is also a function. We focus on the use of…
The invariance thesis of Slot and van Emde Boas states that all reasonable models of computation simulate each other with polynomially bounded overhead in time and constant-factor overhead in space. In this paper we show that a family of…
Current work defines Schmidt representation of a bilinear operator $T: H_1 \times H_2 \rightarrow K$, where $H_1, H_2$ and $K$ are separable Hilbert spaces. Introducing the concept of singular value and ordered singular value, we prove that…
This paper outlines a covariant theory of operators defined on groups and homogeneous spaces. A systematic use of groups and their representations allows to obtain results of algebraic and analytical nature. The consideration is…
In this paper we introduce and study an alternative definition of tense operators on residuated lattices. We give a categorical equivalence for the class of tense residuated lattices, which is motivated by an old construction due to J.…
We address the problem of verifying safety properties of concurrent programs running over the Total Store Order (TSO) memory model. Known decision procedures for this model are based on complex encodings of store buffers as lossy channels.…
Many term calculi, like lambda calculus or pi calculus, involve binders for names, and the mathematics of bound variable names is subtle. Schoenfinkel introduced the SKI combinator calculus in 1924 to clarify the role of quantified…
Ariola and Felleisen's call-by-need {\lambda}-calculus replaces a variable occurrence with its value at the last possible moment. To support this gradual notion of substitution, function applications-once established-are never discharged.…