Related papers: A monad for full ground reference cells
Two novel descriptions of weak {\omega}-categories have been recently proposed, using type-theoretic ideas. The first one is the dependent type theory CaTT whose models are {\omega}-categories. The second is a recursive description of a…
We provide a way to ease the verification of programs whose state evolves monotonically. The main idea is that a property witnessed in a prior state can be soundly recalled in the current state, provided (1) state evolves according to a…
The modal logic S4 can be used via a Curry-Howard style correspondence to obtain a lambda-calculus. Modal (boxed) types are intuitively interpreted as `closed syntax of the calculus'. This lambda-calculus is called modal type theory ---…
We define a notion of grading of a monoid T in a monoidal category C, relative to a class of morphisms M (which provide a notion of M-subobject). We show that, under reasonable conditions (including that M forms a factorization system),…
Let K be a complete discretely valued field of mixed characteristics (0, p) with perfect residue field. One of the central objects of study in p-adic Hodge theory is the category of continuous representations of the absolute Galois group of…
Many vision-related tasks benefit from reasoning over multiple modalities to leverage complementary views of data in an attempt to learn robust embedding spaces. Most deep learning-based methods rely on a late fusion technique whereby…
Matrix-vector multiplications are a fundamental building block of artificial intelligence; this essential role has motivated their implementation in a variety of physical substrates, from memristor crossbar arrays to photonic integrated…
Let $C_n$ denote a cyclic group of order $n$. In this paper we investigate modules and chain complexes over the constant integral Mackey functor $\underline{\mathbb{Z}}$ and perform some related homological calculations. Along the way we…
The notion of retrocell in a double category with companions is introduced and its basic properties established. Explicit descriptions in some of the usual double categories are given. Monads in a double category provide an important…
The Functional Machine Calculus (FMC) was recently introduced as a generalization of the lambda-calculus to include higher-order global state, probabilistic and non-deterministic choice, and input and output, while retaining confluence. The…
Biomedical association studies are increasingly done using clinical concepts, and in particular diagnostic codes from clinical data repositories as phenotypes. Clinical concepts can be represented in a meaningful, vector space using word…
We construct a functor from the category of graphs to the category of groups which is faithful and "almost" full, in the sense that it induces bijections of the Hom sets up to trivial homomorphisms and conjugation in the category of groups.…
This paper uses monads and comonads to establish a certain type of equivalence between two subcategories, one reflective and one coreflective, in a category whose objects represent compactifications of non-compact locally compact Hausdorff…
Embedding learning, a.k.a. representation learning, has been shown to be able to model large-scale semantic knowledge graphs. A key concept is a mapping of the knowledge graph to a tensor representation whose entries are predicted by models…
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…
We present the guarded lambda-calculus, an extension of the simply typed lambda-calculus with guarded recursive and coinductive types. The use of guarded recursive types ensures the productivity of well-typed programs. Guarded recursive…
Two very basic constructions involving experimental procedures are the formation of coarse-grained versions of experiments, and the formation of branching sequential experiments. The latter allow for the conditioning of states on the…
Given a Hopf algebra in a symmetric monoidal category with duals, the category of modules inherits the structure of a monoidal category with duals. If the notion of algebra is replaced with that of monad on a monoidal category with duals…
Containers are used to carve out a class of strictly positive data types in terms of shapes and positions. They can be interpreted via a fully-faithful functor into endofunctors on Set. Monadic containers are those containers whose…
This thesis revolves around an area of computer science called "semantics". We work with operational semantics, equational theories, and denotational semantics. The first contribution of this thesis is a study of the commutativity of…