Related papers: Enriched Lawvere Theories for Operational Semantic…
For any site of definition $\mathcal C$ of a Grothendieck topos $\mathcal E$, we define a notion of a $\mathcal C$-ary Lawvere theory $\tau: \mathscr C \to \mathscr T$ whose category of models is a stack over $\mathcal E$. Our definitions…
We consider the equivalence of Lawvere theories and finitary monads on Set from the perspective of Endf(Set)-enriched category theory, where Endf(Set) is the category of finitary endofunctors of Set. We identify finitary monads with…
We investigate the phenomenon that "every monad is a linear state monad". We do this by studying a fully-complete state-passing translation from an impure call-by-value language to a new linear type theory: the enriched call-by-value…
This is the first of a series of papers on enriched infinity categories, seeking to reduce enriched higher category theory to the higher algebra of presentable infinity categories, which is better understood and can be approached via…
We construct bounded linear operators that map $H^1$ conforming Lagrange finite element spaces to $H^2$ conforming virtual element spaces in two and three dimensions. These operators are useful for the analysis of nonstandard finite element…
The familiar adjunction between ordered sets and completely distributive lattices can be extended to generalised metric spaces, that is, categories enriched over a quantale (a lattice of "truth values"), via an appropriate distributive law…
Behaviors of many engineering systems are described by lumped parameter models that encapsulate the spatially distributed nature of the system into networks of lumped elements; the dynamics of such a network is governed by a system of…
We develop a theory of weighted colimits in the framework of weakly bienriched $\infty$-categories, an extension of Lurie's notion of enriched $\infty$-categories. We prove an existence result for weighted colimits, study weighted colimits…
We collect in one place a variety of known and folklore results in enriched model category theory and add a few new twists. The central theme is a general procedure for constructing a Quillen adjunction, often a Quillen equivalence, between…
Recursive graph queries are increasingly popular for extracting information from interconnected data found in various domains such as social networks, life sciences, and business analytics. Graph data often come with schema information that…
Databases have been studied category-theoretically for decades. The database schema -- whose purpose is to arrange high-level conceptual entities -- is generally modeled as a category or sketch. The data itself, often called an instance, is…
We investigate program equivalence for linear higher-order(sequential) languages endowed with primitives for computational effects. More specifically, we study operationally-based notions of program equivalence for a linear…
In this document, we propose a description, via a Haskell implementation, of a generalization of the notion of regular expression allowing us to group the definitions and the methods of (tree or word) automata constructions over one generic…
We study various characterizations of higher sites over a given $\infty$-category $\mathcal{C}$ which are conceptually in line with their classical ordinary categorical counterparts, and extract some new results about $\infty$-topos theory…
This work originates from the observation that today's state-of-the-art statistical language models are impressive not only for their performance, but also - and quite crucially - because they are built entirely from correlations in…
The use of operational methods of different nature is shown to be a fairly powerful tool to study different problems regarding the theory of Legendre and Legendre-like polynomials. We show how the use of the well known integral…
We interpret augmented racks as a certain kind of multiplicative graphs and show that this point of view is natural for defining rack homology. We also define the analogue of the group algebra for these objects; in particular, we see how…
We study the equational theory of the Weihrauch lattice with composition and iterations, meaning the collection of equations between terms built from variables, the lattice operations $\sqcup$, $\sqcap$, the composition operator $\star$ and…
We study Polynomial Lawvere logic PL, a logic defined over the Lawvere quantale of extended positive reals with sum as tensor, to which we add multiplication, thereby obtaining a semiring structure. PL is designed for complex quantitative…
In this article, we introduce the notion of a curved absolute $\mathcal{L}_\infty$-algebra, a structure that behaves like a curved $\mathcal{L}_\infty$-algebra where all infinite sums of operations are well-defined by definition. We develop…