相关论文: On Storage Operators

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…

A mathematical framework for Continuous Time Finance based on operator algebraic methods offers a new direct and entirely constructive perspective on the field and leads to new numerical analysis techniques. This is partly a review paper as…

The paper contains a survey of a class of Fourier integral operators defined by symbols with tempered weight. These operators are bounded (respectively compact) in $L^2$ if the weight of the amplitude is bounded (respectively tends to $0$).

The standard oracle operator corresponding to a function f is a unitary operator that computes this function coherently, i.e. it maintains superpositions. This operator acts on a bipartite system, where the subsystems are the input and…

In this report, we propose a game semantics model of intuitionistic linear logic with a notion of brackets and a trace operator. This model is a revised version of Conway games augmented with an algebraicly defined gain which enable to…

Data words with binders formalize concurrently allocated memory. Most name-binding mechanisms in formal languages, such as the $\lambda$-calculus, adhere to properly nested scoping. In contrast, stateful programming languages with explicit…

A method for the nonintrusive and structure-preserving model reduction of canonical and noncanonical Hamiltonian systems is presented. Based on the idea of operator inference, this technique is provably convergent and reduces to a…

Delimited control operator shift0 exhibits versatile capabilities: it can express layered monadic effects, or equivalently, algebraic effects. Little did we know it can express lambda calculus too! We present $ \Lambda_\$ $, a call-by-value…

We extend the notion of conservativeness, given by Fredkin and Toffoli in 1982, to generic gates whose input and output lines may assume a finite number d of truth values. A physical interpretation of conservativeness in terms of…

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…

With the rapid development of cloud computing and big data technologies, storage systems have become a fundamental building block of datacenters, incorporating hardware innovations such as flash solid state drives and non-volatile memories,…

The study of mathematical connections between operator-theoretic formulations of classical dynamics and quantum mechanics began at least as early as the 1930s in work of Koopman and von Neumann and was developed in later decades by many…

We present an extension of the second-order logic AF2 with iso-style inductive and coinductive definitions specifically designed to extract programs from proofs a la Krivine-Parigot by means of primitive (co)recursion principles. Our logic…

The aim of this paper is to provide a general overview of the product operators introduced in the literature as a tool to enhance the analysis accuracy in the Abstract Interpretation framework. In particular we focus on the Cartesian and…

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.…

A prototype system is described whose core functionality is, based on propositional logic, the elimination of second-order operators, such as Boolean quantifiers and operators for projection, forgetting and circumscription. This approach…

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…

In 1929 Jan Lukasiewicz used, apparently for the first time, his Polish notation to represent the operations of formal logic. This is a parenthesis-free notation, which also implies that logical functions are operators preceding the…

In this paper we consider a logical treatment for the ordered disjunction operator 'x' introduced by Brewka, Niemel\"a and Syrj\"anen in their Logic Programs with Ordered Disjunctions (LPOD). LPODs are used to represent preferences in logic…

The lambda calculus since more than half a century is a model and foundation of functional programming languages. However, lambda expressions can be evaluated with different reduction strategies and thus, there is no fixed cost model nor…