相关论文: A General Type for Storage Operators

The method of realizability was first developed by Kleene and is seen as a way to extract computational content from mathematical proofs. Traditionally, these models only satisfy intuitionistic logic, however this method was extended by…

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

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…

We introduce and study the notion of affine varieties associated to ordered bases and establish Galois connection between the power set of $A^n_K$ and the power set of $K[x_1, . . ., x_n]$, and then induce a Galois correspondence. We…

We construct a calculus for generalized $\mathbf{SG}$ Fourier integral operators, extending known results to a broader class of symbols of $\mathbf{SG}$ type. In particular, we do not require that the phase functions are homogeneous. We…

BSS RAMs over first-order structures help to characterize algorithms for processing objects by means of useful operations and relations. They are the result of a generalization of several types of abstract machines. We want to discuss…

Capture calculus has recently been proposed as a solution to effect checking, achieved by tracking the captured references of terms in the types. Boxes, along with the box and unbox operations, are a crucial construct in capture calculus,…

We discuss a new concept of definitizability of a normal operator on Krein spaces. For this new concept we develop a functional calculus $\phi \mapsto \phi(N)$ which is the proper analogue of $\phi \mapsto \int \phi \, dE$ in the Hilbert…

The model of generalized automata, introduced by Eilenberg in 1974, allows representing a regular language more concisely than conventional automata by allowing edges to be labeled not only with characters, but also strings. Giammarresi and…

Guarded recursion is a powerful modal approach to recursion that can be seen as an abstract form of step-indexing. It is currently used extensively in separation logic to model programming languages with advanced features by solving domain…

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…

A type assignment system for lambda-calculus enjoys the principal typing property if every typable term M has a special typing, called principal, from which all typings for M can be obtained via suitable operations. The existence of…

We present a scheme to store unitary operators with self-inverse generators in quantum states and a general circuit to retrieve them with definite success probability. The continuous variable of the operator is stored in a single-qubit…

Let $(\mathcal X, d,\mu)$ be an RD-space, and let $\rho$ be an admissible function on $\mathcal X$. We establish necessary and sufficient conditions for the boundedness of a new class of generalized Calder\'on-Zygmund operators of log-Dini…

We define a class of discrete operators that, in particular, include the delta and nabla fractional operators.

Approximation theory is a substantial field of mathematical analysis that emerged in the 19th century and has been developed by mathematicians across the globe ever since. Its importance has increased over time, as it provides solutions to…

In reversible computing, the management of space is subject to two broad classes of constraints. First, as with general-purpose computation, every allocation must be paired with a matching de-allocation. Second, space can only be safely…

Martin-L\"of's Intuitionistic Theory of Types is becoming popular for formal reasoning about computer programs. To handle recursion schemes other than primitive recursion, a theory of well-founded relations is presented. Using primitive…

Term-forming operators (tfos), like iota- or epsilon-operator, are technical devices applied to build complex terms in formal languages. Although they are very useful in practice their theory is not well developed. In the paper we provide a…

This work studies collections of Hilbert space operators which possess a strict monoid structure under composition. These collections can be thought of as discrete unital semigroups for which no subset of the collection is closed under…