Related papers: On Storage Operators
Higher-order representations of objects such as programs, proofs, formulas and types have become important to many symbolic computation tasks. Systems that support such representations usually depend on the implementation of an intensional…
Several approaches to the formulation of a fractional theory of calculus of "variable order" have appeared in the literature over the years. Unfortunately, most of these proposals lack a rigorous mathematical framework. We consider an…
A sound and complete embedding of conditional logics into classical higher-order logic is presented. This embedding enables the application of off-the-shelf higher-order automated theorem provers and model finders for reasoning within and…
Supervised operator learning centers on the use of training data, in the form of input-output pairs, to estimate maps between infinite-dimensional spaces. It is emerging as a powerful tool to complement traditional scientific computing,…
This paper proposes new derivations of three well-known sorting algorithms, in their functional formulation. The approach we use is based on three main ingredients: first, the algorithms are derived from a simpler algorithm, i.e. the…
This paper presents a data-driven methodology to estimate the storage function of a passive system. The methodology consists in parametrizing the storage function with a dictionary then running a linear program. Results on a benchmark are…
We present the guarded lambda-calculus, an extension of the simply typed lambda-calculus with guarded recursive and coinductive types. The use of guarded recursive types ensures the productivity of well-typed programs. Guarded recursive…
In many massively parallel data management platforms, programs are represented as small imperative pieces of code connected in a data flow. This popular abstraction makes it hard to apply algebraic reordering techniques employed by…
A new class of Semantic Numeration Systems, namely, positive rational Semantic Numeration Systems is introduced. For cardinal semantic operators, differences in the formation of carry (common carry) and remainders are defined. The…
We introduce a new form of the polynomial method based on what we call "shift operators," which we use to give efficient and intuitive new proofs of results previously shown using a wide range of polynomial methods, including Alon's…
After reviewing the definition of two differential operators which have been recently introduced by Caputo and Fabrizio and, separately, by Atangana and Baleanu, we present an argument for which these two integro-differential operators can…
We present a semantics based framework for analysing the quantitative behaviour of programs with regard to resource usage. We start from an operational semantics equipped with costs. The dioid structure of the set of costs allows for…
The role of Liouville operators in the study of dynamical systems through the use of occupation measures have been an active area of research in control theory over the past decade. This manuscript investigates Liouville operators over the…
Notions of guardedness serve to delineate the admissibility of cycles, e.g. in recursion, corecursion, iteration, or tracing. We introduce an abstract notion of guardedness structure on a symmetric monoidal category, along with a…
The Krivine machine is an abstract machine implementing the linear head reduction of lambda-calculus. Ehrhard and Regnier gave a resource sensitive version returning the annotated form of a lambda-term accounting for the resources used by…
We study fixpoints of operators on lattices. To this end we introduce the notion of an approximation of an operator. We order approximations by means of a precision ordering. We show that each lattice operator O has a unique most precise or…
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…
Solving analytic systems using inversion can be implemented in a variety of ways. One method is to use Lagrange inversion and variations. Here we present a different approach, based on dual vector fields. For a function analytic in a…
The storage stack in the traditional operating system is primarily optimized towards improving the CPU utilization and hiding the long I/O latency imposed by the slow I/O devices such as hard disk drivers (HDDs). However, the emerging…
We consider a rather general version of ladder operator $Z$ used by some authors in few recent papers, $[H_0,Z]=\lambda Z$ for some $\lambda\in\mathbb{R}$, $H_0=H_0^\dagger$, and we show that several interesting results can be deduced from…