Related papers: Logical systems I: Lambda calculi through discrete…
A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…
In this survey, we present in a unified way the categorical and syntactical settings of coherent differentiation introduced recently, which shows that the basic ideas of differential linear logic and of the differential lambda-calculus are…
We show that for any uncountable cardinal $\lambda$, the category of sets of cardinality at least $\lambda$ and monomorphisms between them cannot appear as the category of point of a topos, in particular is not the category of models of a…
We present an algorithm for deriving a spatial-behavioral type system from a formal presentation of a computational calculus. Given a 2-monad Calc: Catv$\to$ Cat for the free calculus on a category of terms and rewrites and a 2-monad…
We study a family of distributors-induced bicategorical models of lambda-calculus, proving that they can be syntactically presented via intersection type systems. We first introduce a class of 2-monads whose algebras are monoidal categories…
A system of linear dependent types for the lambda calculus with full higher-order recursion, called dlPCF, is introduced and proved sound and relatively complete. Completeness holds in a strong sense: dlPCF is not only able to precisely…
Recently, the first-named author gave a classification of 3D consistent 6-tuples of quad-equations with the tetrahedron property; several novel asymmetric 6-tuples have been found. Due to 3D consistency, these 6-tuples can be extended to…
We describe a finitary 2-monad on a locally finitely presentable 2-category for which not every pseudoalgebra is equivalent to a strict one. This shows that having rank is not a sufficient condition on a 2-monad for every pseudoalgebra to…
We consider the non-deterministic extension of the call-by-value lambda calculus, which corresponds to the additive fragment of the linear-algebraic lambda-calculus. We define a fine-grained type system, capturing the right linearity…
We generalize Franz' independence in tensor categories with inclusions from two morphisms (which represent generalized random variables) to arbitrary ordered families of morphisms. We will see that this only works consistently if the unit…
System I is a simply-typed lambda calculus with pairs, extended with an equational theory obtained from considering the type isomorphisms as equalities. In this work we propose an extension of System I to polymorphic types, adding the…
Finiteness spaces constitute a categorical model of Linear Logic (LL) whose objects can be seen as linearly topologised spaces, (a class of topological vector spaces introduced by Lefschetz in 1942) and morphisms as continuous linear maps.…
Given an algebra in a monoidal 2-category, one can construct a 2-category of right modules. Given a braided algebra in a braided monoidal 2-category, it is possible to refine the notion of right module to that of a local module. Under mild…
We consider the 3-category $2\mathfrak{C}at$ whose objects are 2-categories, 1-morphisms are lax functors, 2-morphisms are lax transformations and 3-morphisms are modifications. The aim is to show that it carries interesting…
We present a polymorphic linear lambda-calculus as a proof language for second-order intuitionistic linear logic. The calculus includes addition and scalar multiplication, enabling the proof of a linearity result at the syntactic level.
From the analogue of Boehm's Theorem proved for the typed lambda calculus, without product types and with them, it is inferred that every cartesian closed category that satisfies an equality between arrows not satisfied in free cartesian…
We form tricategories and the homomorphisms between them into a bicategory, whose 2-cells are certain degenerate tritransformations. We then enrich this bicategory into an example of a three-dimensional structure called a locally cubical…
Categories, n-categories, double categories, and multicategories (among others) all have similar definitions as collections of cells with composition operations. We give an explicit description of the information required to define any…
We introduce a new nameless representation of lambda terms inspired by ordered logic. At a lambda abstraction, number and relative position of all occurrences of the bound variable are stored, and application carries the additional…
We extend the inflationary fixed-point logic, IFP, with a new kind of second-order quantifiers which have (poly-)logarithmic bounds. We prove that on ordered structures the new logic $\exists^{\log^{\omega}}\text{IFP}$ captures the limited…