Related papers: Parsing as a lifting problem and the Chomsky-Sch\"…
Functor lifting along a fibration is used for several different purposes in computer science. In the theory of coalgebras, it is used to define coinductive predicates, such as simulation preorder and bisimilarity. Codensity lifting is a…
We present an abstract, categorical formulation of dependent functions in a fundamental manner and independently from the Sigma-construction. For that, we define first the notion of a category with family-arrows, or a $\f$-category. A $(\f,…
Given an algebraic theory which can be described by a (possibly symmetric) operad $P$, we propose a definition of the \emph{weakening} (or \emph{categorification}) of the theory, in which equations that hold strictly for $P$-algebras hold…
The category of (colored) props is an enhancement of the category of colored operads, and thus of the category of small categories. The titular category has nice formal properties: it is bicomplete and is a symmetric monoidal category, with…
Dependent pattern matching is a key feature in dependently typed programming. However, there is a theory-practice disconnect: while many proof assistants implement pattern matching as primitive, theoretical presentations give semantics to…
Functional decomposition is the process of breaking down a function $f$ into a composition $f=g(f_1,\dots,f_k)$ of simpler functions $f_1,\dots,f_k$ belonging to some class $\mathcal{F}$. This fundamental notion can be used to model…
Extending Mart\'in Escard\'o's effectful forcing technique, we give a new proof of a well-known result: Brouwer's monotone bar theorem holds for any bar that can be realized by a functional of type $(\mathbb{N} \to \mathbb{N}) \to…
Traditionally, finite automata theory has been used as a framework for the representation of possibly infinite sets of strings. In this work, we introduce the notion of second-order finite automata, a formalism that combines finite automata…
The goal of this paper is twofold. In addition to the results stated in the next paragraph, we present some classical results on absoluteness relevant to functional analysis that are well known to logicians but not nearly as well advertised…
Combinatory categorial grammar (CCG) is a grammar formalism used for natural language parsing. CCG assigns structured lexical categories to words and uses a small set of combinatory rules to combine these categories to parse a sentence. In…
Operator systems connect operator algebra, free semialgebraic geometry and quantum information theory. In this work we generalize operator systems and many of their theorems. While positive semidefinite matrices form the underlying…
This paper investigates algebraic objects equipped with an operator, such as operated monoids, operated algebras etc. Various free object functors in these operated contexts are explicitly constructed. For operated algebras whose operator…
The most general operator product expansion in conformal field theory is obtained using the embedding space formalism and a new uplift for general quasi-primary operators. The uplift introduced here, based on quasi-primary operators with…
Logical relations are one of the most powerful techniques in the theory of programming languages, and have been used extensively for proving properties of a variety of higher-order calculi. However, there are properties that cannot be…
We introduce a normal form for context-free grammars, called Dyck normal form. This is a syntactical restriction of the Chomsky normal form, in which the two nonterminals occurring on the right-hand side of a rule are paired nonterminals.…
We review several well-known operads of compactified configuration spaces and construct several new such operads, C, in the category of smooth manifolds with corners whose complexes of fundamental chains give us (i) the 2-coloured operad of…
In this paper we show that any $\infty$-operad is equivalent to the localization of a discrete $\Sigma$-free operad, working in the formalism of dendroidal sets. The key point is defining the root functor of a dendroidal set $X$, a functor…
Let $R,S$ be rings, $\mathcal{X}\subseteq \text{mod}$-$R$ a covariantly finite subcategory, $\mathcal{C}$ the smallest definable subcategory of $\text{Mod}$-$R$ containing $\mathcal{X}$ and $\mathcal{D}$ a definable subcategory of…
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…
One of the open problems in higher category theory is the systematic construction of the higher dimensional analogues of the Gray tensor product. In this paper we continue the work of [7] to adapt the machinery of globular operads [4] to…