Related papers: A cartesian closed fibration of higher-order regul…
We develop a categorical framework for reasoning about abstract properties of differentiation, based on the theory of fibrations. Our work encompasses the first-order fragments of several existing categorical structures for differentiation,…
Latent fibrations are an adaptation, appropriate for categories of partial maps (as presented by restriction categories), of the usual notion of fibration. The paper initiates the development of the basic theory of latent fibrations and…
A fundamental theme in automata theory is regular languages of words and trees, and their many equivalent definitions. Salvati has proposed a generalization to regular languages of simply typed $\lambda$-terms, defined using denotational…
Consider a locally cartesian closed category with an object I and a class of trivial fibrations, which admit sections and are stable under pushforward and retract as arrows. Define the fibrations to be those maps whose Leibniz exponential…
We introduce the notion of a G\"odel fibration, which is a fibration categorically embodying both the logical principle of traditional Skolemization (we can exchange the order of quantifiers paying the price of a functional) and the…
An important result in quasi-category theory due to Lurie is the that cocartesian fibrations are exponentiable, in the sense that pullback along a cocartesian fibration admits a right Quillen right adjoint that moreover preserves cartesian…
This report is mostly written for educational purposes. It is meant as a self contained introduction to regular languages, regular expressions, and regular expression matching by using Brzozowski derivatives. As such it is mostly based on…
Logical relations built on top of an operational semantics are one of the most successful proof methods in programming language semantics. In recent years, more and more expressive notions of operationally-based logical relations have been…
This paper describes an algorithm for the compilation of a two (or more) level orthographic or phonological rule notation into finite state transducers. The notation is an alternative to the standard one deriving from Koskenniemi's work: it…
We define a general mathematical framework for linguistics based on the theory of fibrations, called FibLang. We start by modelling the interaction between linguistics and cognition in the most general way possible, with a heavy focus on…
Grothendieck fibrations are fundamental in capturing the concept of dependency, notably in categorical semantics of type theory and programming languages. A relevant instance are Dialectica fibrations which generalise G\"odel's Dialectica…
For a strongly connected category $\mathcal C$ with pair-wise coproducts, we introduce a cosimplicial object, which serves as a sort of resolution for computing higher derived functors of ${\sf lim} : \mathrm{Ab}^{\mathcal C}\to…
We construct an internal language for cartesian closed bicategories. Precisely, we introduce a type theory modelling the structure of a cartesian closed bicategory and show that its syntactic model satisfies an appropriate universal…
We use the properties of Hermite and Kamp\'e de F\'eriet polynomials to get closed forms for the repeated derivatives of functions whose argument is a quadratic or higher-order polynomial. The results we obtain are extended to product of…
Cartesian fibrations were originally defined by Lurie in the context of quasi-categories and are commonly used in $(\infty,1)$-category theory to study presheaves valued in $(\infty,1)$-categories. In this work we define and study…
We introduce and study a construction of higher derived brackets generated by a (not necessarily inner) derivation of a Lie superalgebra. Higher derived brackets generated by an element of a Lie superalgebra were introduced in our earlier…
Many theories of semantic interpretation use lambda-term manipulation to compositionally compute the meaning of a sentence. These theories are usually implemented in a language such as Prolog that can simulate lambda-term operations with…
Although unification can be used to implement a weak form of $\beta$-reduction, several linguistic phenomena are better handled by using some form of $\lambda$-calculus. In this paper we present a higher order feature description calculus…
This tutorial gives an advanced introduction to string diagrams and graph languages for higher-order computation. The subject matter develops in a principled way, starting from the two dimensional syntax of key categorical concepts such as…
We construct two model structures, whose fibrant objects capture the notions of discrete fibrations and of Grothendieck fibrations over a category $\mathcal{C}$. For the discrete case, we build a model structure on the slice…