Related papers: A General Type for Storage Operators
Lenses have a rich history and have recently received a great deal of attention from applied category theorists. We generalize the notion of lens by defining a category $\mathsf{Lens}_F$ for any category $\mathcal{C}$ and functor $F\colon…
In this paper we present a new static data type inference algorithm for logic programming. Without the need of declaring types for predicates, our algorithm is able to automatically assign types to predicates which, in most cases,…
We present a calculus for processing semistructured data that spans differences of application area among several novel query languages, broadly categorized as "NoSQL". This calculus lets users define their own operators, capturing a wider…
Simple type theory is formulated for use with the generic theorem prover Isabelle. This requires explicit type inference rules. There are function, product, and subset types, which may be empty. Descriptions (the eta-operator) introduce the…
We present new proofs of termination of evaluation in reduction semantics (i.e., a small-step operational semantics with explicit representation of evaluation contexts) for System F with control operators. We introduce a modified version of…
A class of generalized complex polynomials of Hermite type, suggested by a special magnetic Schrodinger operator, is introduced and some related basic properties are discussed.
This work continues the research of generalized Heisenberg algebras connected with several orthogonal polynomial systems. The realization of the annihilation operator of the algebra corresponding to a polynomial system by a differential…
Nakano's later modality can be used to specify and define recursive functions which are causal or synchronous; in concert with a notion of clock variable, it is possible to also capture the broader class of productive (co)programs. Until…
The construction of GNOOP as a domain-theoretic model of generic nominally-typed OOP is currently underway. This extended abstract presents the concepts of `nominal intervals' and `full generication' that are likely to help in building…
This paper introduces the class of grey-scale image stack operators as those that (a) map binary-images into binary-images and (b) commute on average with cross-sectioning. Equivalently, stack operators are 1-Lipchitz extensions of set…
This is the second part in a series of papers in which we introduce and develop a natural, general tensor category theory for suitable module categories for a vertex (operator) algebra. In this paper (Part II), we develop logarithmic formal…
A module endomorphism $f$ on an algebra $A$ is called an averaging operator if it satisfies $f(xf(y)) = f(x)f(y)$ for any $x, y\in A$. An algebra $A$ with an averaging operator $f$ is called an averaging algebra. Averaging operators have…
We describe a type system for the linear-algebraic lambda-calculus. The type system accounts for the part of the language emulating linear operators and vectors, i.e. it is able to statically describe the linear combinations of terms…
We show that the set of projections in an operator system can be detected using only the abstract data of the operator system. Specifically, we show that if $p$ is a positive contraction in an operator system $V$ which satisfies certain…
Substructural type systems, such as affine (and linear) type systems, are type systems which impose restrictions on copying (and discarding) of variables, and they have found many applications in computer science, including quantum…
Logical relations are one of the most powerful techniques in the theory of programming languages, and have been used extensively for proving properties of a variety of higher-order calculi. However, there are properties that cannot be…
Besides recalling the basic definitions of Realizability Lattices, Abstract Krivine Structures, Ordered Combinatory Algebras and Tripos and reviewing its relationships, we propose a new foundational framework for realizability. Motivated by…
Many possible definitions have been proposed for fractional derivatives and integrals, starting from the classical Riemann-Liouville formula and its generalisations and modifying it by replacing the power function kernel with other kernel…
Databases have been studied category-theoretically for decades. The database schema -- whose purpose is to arrange high-level conceptual entities -- is generally modeled as a category or sketch. The data itself, often called an instance, is…
In this article we give several characterizations for various transitivity properties for linear operators. We define a general form of `Hypercyclicity Criterion' using a Furstenberg family $\mathcal{F}$ to characterize…