Related papers: Combinatorial structure of type dependency
Nakano's later modality can be used to specify and define recursive functions which are causal or synchronous; in concert with a notion of clock variable, it is possible to also capture the broader class of productive (co)programs. Until…
This paper presents and extends our type theoretical framework for a compositional treatment of natural language semantics with some lexical features like coercions (e.g. of a town into a football club) and copredication (e.g. on a town as…
We describe a type system for the linear-algebraic $\lambda$-calculus. The type system accounts for the linear-algebraic aspects of this extension of $\lambda$-calculus: it is able to statically describe the linear combinations of terms…
Coherence theorems for covariant structures carried by a category have traditionally relied on the underlying term rewriting system of the structure being terminating and confluent. While this holds in a variety of cases, it is not a…
In category theory, monads, which are monoid objects on endofunctors, play a central role closely related to adjunctions. Monads have been studied mostly in algebraic situations. In this dissertation, we study this concept in some…
We investigate the extent to which the weak equivalences in a model category can be equipped with algebraic structure. We prove, for instance, that there exists a monad T such that a morphism of topological spaces admits T-algebra structure…
We study polymorphic type assignment systems for untyped lambda-calculi with effects, based on Moggi's monadic approach. Moving from the abstract definition of monads, we introduce a version of the call-by-value computational…
It is informally understood that the purpose of modal type constructors in programming calculi is to control the flow of information between types. In order to lend rigorous support to this idea, we study the category of classified sets, a…
We study the existence and left properness of transferred model structures for "monoid-like" objects in monoidal model categories. These include genuine monoids, but also all kinds of operads as for instance symmetric, cyclic, modular,…
This paper develops a version of dependent type theory in which isomorphism is handled through a direct generalization of the 1939 definitions of Bourbaki. More specifically we generalize the Bourbaki definition of structure from simple…
We develop normalisation by evaluation (NBE) for dependent types based on presheaf categories. Our construction is formulated in the metalanguage of type theory using quotient inductive types. We use a typed presentation hence there are no…
We extend Bourke and Garner's idempotent adjunction between monads and pretheories to the framework of $\infty$-categories and we use this to prove many classical results about monads in the $\infty$-categorical framework. Amongst other…
Many homotopy-coherent algebraic structures can be described by Segal-type limit conditions determined by an "algebraic pattern", bywhich we mean an $\infty$-category equipped with a factorization system and a collection of "elementary"…
Type theories with multi-clocked guarded recursion provide a flexible framework for programming with coinductive types encoding productivity in types. Combining this with solutions to general guarded domain equations one can also construct…
A Hopf monoid (in Joyal's category of species) is an algebraic structure akin to that of a Hopf algebra. We provide a self-contained introduction to the theory of Hopf monoids in the category of species. Combinatorial structures which…
We introduce some new symmetric tensor categories based on the combinatorics of trees: a discrete family $\mathcal{D}(n)$, for $n \ge 3$ an integer, and a continuous family $\mathcal{C}(t)$, for $t \ne 1$ a complex number. The construction…
Recent advances in programming languages study and design have established a standard way of grounding computational systems representation in category theory. These formal results led to a better understanding of issues of control and…
Derivations provide a way of transporting ideas from the calculus of manifolds to algebraic settings where there is no sensible notion of limit. In this paper, we consider derivations in certain monoidal categories, called codifferential…
Standard methods of using categorical variables as predictors either endow them with an ordinal structure or assume they have no structure at all. However, categorical variables often possess structure that is more complicated than a linear…
The perturbative expansion of tensorial field theories in Feynman graphs can be interpreted as weighted generating series of some piecewise linear varieties. This simple fact establishes a link between two a priori distinct fields: the…