Related papers: The Difference Lambda-Calculus: A Language for Dif…
We study the interpretation of the lambda-calculus in a framework based on tropical mathematics, and we show that it provides a unifying framework for two well-developed quantitative approaches to program semantics: on the one hand program…
This paper is devoted to studying difference indices of quasi-regular difference algebraic systems. We give the definition of difference indices through a family of pseudo-Jacobian matrices. Some properties of difference indices are proved.…
We explain the use of category theory in describing certain sorts of anyons. Yoneda's lemma leads to a simplification of that description. For the particular case of Fibonacci anyons, we also exhibit some calculations that seem to be known…
We introduce a category-theoreticabstraction of a syntax with auxiliary functions, called an admissiblemonad morphism. Relying on an abstract form of structural recursion,we then design generic tools to construct admissible monad…
The notion of lacunary infinite numerical sequence is introduced. It is shown that for an arbitrary linear difference operator L with coefficients belonging to the set R of infinite numerical sequences, a criterion (i.e., a necessary and…
We explore approximate categoricity in the context of distortion systems, introduced in our previous paper, which are a mild generalization of perturbation systems, introduced by Ben Yaacov. We extend Ben Yaacov's Ryll-Nardzewski style…
This paper reveals a categorical equivalence connecting two distinct quantum logic structures. The first is the orthomodular lattice, an algebraic system designed to formalize the properties of quantum systems. The second is a finitary…
Kundt waves belong to the class of spacetimes which are not distinguished by their scalar curvature invariants. We address the equivalence problem for the metrics in this class via scalar differential invariants with respect to the…
We define a strongly normalising proof-net calculus corresponding to the logic of strongly compact closed categories with biproducts. The calculus is a full and faithful representation of the free strongly compact closed category with…
The goal of this paper is a classification theorem of the singularities according to a new invariant, Mather discrepancy. On the other hand, we show some evidences convincing us that Mather discrepancy is a considerable invariant: By…
We introduce the notion of difference equation defined on a structured set. The symmetry group of the structure determines the set of difference operators. All main notions in the theory of difference equations are introduced as invariants…
Differential lambda-calculus was first introduced by Thomas Ehrhard and Laurent Regnier in 2003. Despite more than 15 years of history, little work has been done on a differential calculus with integration. In this paper, we shall propose a…
We study the problem of when triangulated categories admit unique infinity-categorical enhancements. Our results use Lurie's theory of prestable infinity-categories to give conceptual proofs of, and in many cases strengthen, previous work…
The elementary affine lambda-calculus was introduced as a polyvalent setting for implicit computational complexity, allowing for characterizations of polynomial time and hyperexponential time predicates. But these results rely on type…
We study an untyped lambda calculus with quantum data and classical control. This work stems from previous proposals by Selinger and Valiron and by Van Tonder. We focus on syntax and expressiveness, rather than (denotational) semantics. We…
We advocate the use of de Bruijn's universal abstraction $\lambda^\infty$ for the quantification of schematic variables in the predicative setting and we present a typed $\lambda$-calculus featuring the quantifier $\lambda^\infty$…
We show how categorial deduction can be implemented in higher-order (linear) logic programming, thereby realising parsing as deduction for the associative and non-associative Lambek calculi. This provides a method of solution to the parsing…
Formal transformations somehow resembling the usual derivative are surprisingly common in computer science, with two notable examples being derivatives of regular expressions and derivatives of types. A newcomer to this list is the…
We introduce labelled sequent calculi for the basic normal non-distributive modal logic L and 31 of its axiomatic extensions, where the labels are atomic formulas of a first order language which is interpreted on the canonical extensions of…
This text gives a rough, but linear summary covering some key definitions, notations, and propositions from Lambda Calculus: Its Syntax and Semantics, the classical monograph by Barendregt. First, we define a theory of untyped extensional…