Related papers: Enriched Lawvere Theories for Operational Semantic…
We introduce the concept of Frobenius theory as a generalisation of Lawvere's functorial semantics approach to categorical universal algebra. Whereas the universe for models of Lawvere theories is the category of sets and functions, or more…
Ehrhart theory is the study of the enumeration of lattice points in lattice polytopes. Equivariant Ehrhart theory is a generalization of Ehrhart theory that takes into account the action of a finite group acting via affine transformations…
We build new algebraic structures, which we call genuine equivariant operads, which can be thought of as a hybrid between equivariant operads and coefficient systems. We then prove an Elmendorf-Piacenza type theorem stating that equivariant…
A central question in equivariant algebraic K-theory asks whether there exists an equivariant K-theory machine from genuine symmetric monoidal G-categories to orthogonal G-spectra that preserves equivariant algebraic structures. We answer…
We contribute the first denotational semantics of polymorphic dependent type theory extended by an equational theory for general (higher-order) reference types and recursive types, based on a combination of guarded recursion and…
Lexical semantics theories differ in advocating that the meaning of words is represented as an inference graph, a feature mapping or a vector space, thus raising the question: is it the case that one of these approaches is superior to the…
We develop foundations for abstract homotopy theory based on Grothendieck's idea of a "derivator". The theory is model-independent, and does not depend on model categories, nor on simplicial sets. It is designed to accomodate all the usual…
In this paper we initiate the study of enriched $\infty$-operads. We introduce several models for these objects, including enriched versions of Barwick's Segal operads and the dendroidal Segal spaces of Cisinski and Moerdijk, and show these…
This paper proposes a categorical framework for knowledge graphs linking combinatorial graph structure with topos-theoretic semantics. Knowledge graphs are represented as labelled directed multigraphs and analysed through incidence matrices…
In this paper we present background results in enriched category theory and enriched model category theory necessary for developing model categories of enriched functors suitable for doing functor calculus.
The variation of word meaning according to the context leads us to enrich the type system of our syntactical and semantic analyser of French based on categorial grammars and Montague semantics (or lambda-DRT). The main advantage of a deep…
Representing words by vectors, or embeddings, enables computational reasoning and is foundational to automating natural language tasks. For example, if word embeddings of similar words contain similar values, word similarity can be readily…
Extended versions of the Lambek Calculus currently used in computational linguistics rely on unary modalities to allow for the controlled application of structural rules affecting word order and phrase structure. These controlled structural…
Linear/non-linear (LNL) models, as described by Benton, soundly model a LNL term calculus and LNL logic closely related to intuitionistic linear logic. Every such model induces a canonical enrichment that we show soundly models a LNL lambda…
We define a monoidal semantics for algebraic theories. The basis for the definition is provided by the analysis of the structural rules in the term calculus of algebraic languages. Models are described both explicitly, in a form that…
This is a motivating tutorial introduction to a semantic analysis of programming languages using a graphical language as the representation of terms, and graph rewriting as a representation of reduction rules. We show how the graphical…
Categorical universal algebra can be developed either using Lawvere theories (single-sorted finite product theories) or using monads, and the category of Lawvere theories is equivalent to the category of finitary monads on Set. We show how…
Commonsense knowledge is paramount to enable intelligent systems. Typically, it is characterized as being implicit and ambiguous, hindering thereby the automation of its acquisition. To address these challenges, this paper presents…
The present paper deals with complemented lattices where, however, a unary operation of complementation is not explicitly assumed. This means that an element can have several complements. The mapping $^+$ assigning to each element $a$ the…
Over the topos of sets, the notion of Lawvere theory is infinite countably-sorted algebraic but not one-sorted algebraic. Shifting viewpoint over the object-classifier topos, a finite algebraic presentation of Lawvere theories is…