Related papers: Elgot Categories and Abacus Programs
First class type equalities, in the form of generalized algebraic data types (GADTs), are commonly found in functional programs. However, first-class representations of other relations between types, such as subtyping, are not yet directly…
Effectful categories have two classes of morphisms: pure morphisms, which form a monoidal category; and effectful morphisms, which can only be combined monoidally with central morphisms (such as the pure ones), forming a premonoidal…
We axiomatically define (pre-)Hilbert categories. The axioms resemble those for monoidal Abelian categories with the addition of an involutive functor. We then prove embedding theorems: any locally small pre-Hilbert category whose monoidal…
In this paper we study categorical properties of the category of abelian hypergroups that leads to the notion of hyper (almost) preadditive and hyper (almost) abelian categories. Our goal is to create a path towards a general theory of…
We investigate models of algebraic theories in the category of cocommutative coalgebras over a field. We establish some of their categorical properties, similar to those of algebraic varieties. We introduce a class of categories of…
Differential categories were introduced to provide a minimal categorical doctrine for differential linear logic. Here we revisit the formalism and, in particular, examine the two different approaches to defining differentiation which were…
Actions of monoidal categories on categories, also known as actegories, have been familiar to category theorists for a long time, and yet a comprehensive overview of this topic seems to be missing from the literature. Recently, actegories…
We give the definition of presentations of linear monoidal categories. Our main result is that given a presentation of a linear monoidal category, we can produce a presentation of the same category as a linear category. We apply this result…
We present an extension to the $\mathtt{mathlib}$ library of the Lean theorem prover formalizing the foundations of computability theory. We use primitive recursive functions and partial recursive functions as the main objects of study, and…
We study the local isomorphism classes, also known as genera or weak equivalence classes, of fractional ideals of orders in \'etale algebras. We provide a classification in terms of linear algebra objects over residue fields. As a…
We employ the notions of `sequential function' and `interrogation' (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J. Longley's preorder-enriched category of…
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 theory for encoding and manipulating algebraic data on categories via $\textit{concentration structures}$, which are equivalence relations on morphisms that satisfy certain axioms. For any category with a concentration…
Entwined modules over cowreaths in a monoidal category are introduced. They can be identified to coalgebras in an appropriate monoidal category. It is investigated when such coalgebras are Frobenius (resp. separable), and when the forgetful…
We define here the category of partial differential equations. Special cases of morphisms from an object (equation) are symmetries of the equation and reductions of the equation by a symmetry groups, but there are many other morphisms. We…
Freyd categories provide a semantics for first-order effectful programming languages by capturing the two different orders of evaluation for products. We enrich Freyd categories in a duoidal category, which provides a new, third choice of…
Based on the logarithmic algebraic geometry and the theory of Deligne systems, we define an abelian category of $\ell$-adic sheaves with weight filtrations on a logarithmic scheme over a finite field, which is similar to the category of…
We study the computational model of polygraphs. For that, we consider polygraphic programs, a subclass of these objects, as a formal description of first-order functional programs. We explain their semantics and prove that they form a…
We discuss a categorical version of the celebrated belief propagation algorithm. This provides a way to prove that some algorithms which are known or suspected to be analogous, are actually identical when formulated generically. It also…
We introduce Hopf categories enriched over braided monoidal categories. The notion is linked to several recently developed notions in Hopf algebra theory, such as Hopf group (co)algebras, weak Hopf algebras and duoidal categories. We…