Related papers: Compositional Program Verification with Polynomial…
This is the second paper in a series that aims to provide mathematical descriptions of objects and constructions related to the first few steps of the semantical theory of dependent type systems. We construct for any pair $(R,LM)$, where…
We define $A_{\infty}$-structures -- algebras, coalgebras, modules, and comodules -- in an arbitrary monoidal DG category or bicategory by rewriting their definitions in terms of unbounded twisted complexes. We develop new notions of strong…
The use of function contracts to specify the behavior of functions often remains limited to the scope of a single function call. Relational properties link several function calls together within a single specification. They can express more…
This article is devoted to the investigation of the deformation (twisting) of monoidal structures, such as the associativity constraint of the monoidal category and the monoidal structure of monoidal functor. The sets of twistings have a…
We present a novel dependent linear type theory in which the multiplicity of some variable-i.e., the number of times the variable can be used in a program-can depend on other variables. This allows us to give precise resource annotations to…
Monoidal computer is a categorical model of intensional computation, where many different programs correspond to the same input-output behavior. The upshot of yet another model of computation is that a categorical formalism should provide a…
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…
Dependent types provide a lightweight and modular means to integrate programming and formal program verification. In particular, the types of programs written in dependently typed programming languages (Agda, Idris, F*, etc.) can be used to…
We prove that the free algebra functor associated to a symmetric, pseudo commutative 2-monad, from the underlying symmetric monoidal 2-category to the 2-category of algebras and pseudo maps over the 2-monad can be enhanced to a…
Dependent types offer great versatility and power, but developing proofs with them can be tedious and requires considerable human guidance. We propose to integrate Satisfiability Modulo Theories (SMT)-based refinement types into the…
We study the existence and left properness of transferred model structures for "monoid-like" objects in monoidal model categories. These include genuine monoids, but also all kinds of operads as for instance symmetric, cyclic, modular,…
We develop a compositional framework for generalized reversible computing using copy-discard categories and resource theories. We introduce partitioned matrices between partitioned sets as subdistribution matrices which preserve the…
Agda is a dependently-typed programming language and a proof assistant, pivotal in proof formalization and programming language theory. This paper extends the Agda ecosystem into machine learning territory, and, vice versa, makes…
The present work proposes and discusses the category of supported sets which provides a uniform foundation for nominal sets of various kinds, such as those for equality symmetry, for the order symmetry, and renaming sets. We show that all…
Neural networks systematically fail at compositional generalization -- producing correct outputs for novel combinations of known parts. We show that this failure is architectural: compositional generalization is equivalent to functoriality…
We define a new monoidal category on collections (shuffle composition). Monoids in this category (shuffle operads) turn out to bring a new insight in the theory of symmetric operads. For this category, we develop the machinery of Gr\"obner…
We study the compactly supported rational cohomology of configuration spaces of points on wedges of spheres, equipped with natural actions of the symmetric group and the group $Out(F_g)$ of outer automorphisms of the free group. These…
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…
We consider the family $\mathrm{MP}_d$ of affine conjugacy classes of polynomial maps of one complex variable with degree $d \geq 2$, and study the map $\Phi_d:\mathrm{MP}_d\to \widetilde{\Lambda}_d \subset \mathbb{C}^d / \mathfrak{S}_d$…
We give a leisurely introduction to our abstract framework for operational semantics based on cellular monads on transition categories. Furthermore, we relate it for the first time to an existing format, by showing that all Positive GSOS…