Related papers: A categorical semantic for the Typed Epsilon Calcu…
We present a probabilistic version of PCF, a well-known simply typed universal functional language. The type hierarchy is based on a single ground type of natural numbers. Even if the language is globally call-by-name, we allow a…
If a Quillen model category can be specified using a certain logical syntax (intuitively, ``is algebraic/combinatorial enough''), so that it can be defined in any category of sheaves, then the satisfaction of Quillen's axioms over any site…
We introduce labelled sequent calculi for quantified modal logics with definite descriptions. We prove that these calculi have the good structural properties of G3-style calculi. In particular, all rules are height-preserving invertible,…
We present a labelled sequent calculus for Boolean BI, a classical variant of O'Hearn and Pym's logic of Bunched Implication. The calculus is simple, sound, complete, and enjoys cut-elimination. We show that all the structural rules in our…
The goal of this paper is to design a causal inference method accounting for complex interactions between causal factors. The proposed method relies on a category theoretical reformulation of the definitions of dependent variables,…
Axioms are presented which encapsulate the properties satisfied by categories of games which form the basis of results on full abstraction for PCF and other programming languages, and on full completeness for various logics and type…
It is possible to translate a modified version of K. Worytkiewicz's combinatorial semantics of CCS (Milner's Calculus of Communicating Systems) in terms of labelled precubical sets into a categorical semantics of CCS in terms of labelled…
An exoflop takes a gauged Landau-Ginzburg (LG) model, partially compactifies it, and then performs certain birational transformations on it. When certain criteria hold, this can provide a crepant categorical resolution or equivalence of…
We show that every block of the category of cuspidal generalized weight modules with finite dimensional generalized weight spaces over the Lie algebra sp(2n)(C) is equivalent to the category of finite dimensional…
We present a compositional semantics for various types of polar questions and wh-questions within the framework of Combinatory Categorial Grammar (CCG). To assess the explanatory power of our proposed analysis, we introduce a…
The representation theory for categorical groups is constructed. Each categorical group determines a monoidal bicategory of representations. Typically, these categories contain representations which are indecomposable but not irreducible. A…
We present a version of arithmetic in all finite types which allows for a definition of equality at higher types for which all congruence are derivable, for which the soundness of the Dialectica interpretation is provable inside the system…
In a previous work, we proved that an important part of the Calculus of Inductive Constructions (CIC), the basis of the Coq proof assistant, can be seen as a Calculus of Algebraic Constructions (CAC), an extension of the Calculus of…
We construct the Heisenberg counterpart of a Clifford categorification. It is a modification of Khovanov's Heisenberg categorification. We express generators of the Heisenberg category as a complex of generators of the Clifford category.…
We show that the quotient of the continuous cluster category $\mathcal C_\pi$ modulo the additive subcategory generated by any cluster is an abelian category and we show that it is isomorphic to the category of infinite length modules over…
We classify blocks of category $\mathcal{O}$ for rational Cherednik algebras and of cyclotomic Hecke algebras of type G(r,p,n) by using the "residue equivalence" for multi-partitions.
We define and study the categorical sequence of a space, which is a new formalism that streamlines the computation of the Lusternik-Schnirelmann category of a space X by induction on its CW skeleta. The k-th term in the categorical sequence…
We prove that any rigid additive symmetric monoidal category can be mapped to a rigid abelian symmetric monoidal category in a universal way. This yields a novel approach to Grothendieck's standard conjecture D and Voevodsky's smash…
The depth-bounded fragment of the pi-calculus is an expressive class of systems enjoying decidability of some important verification problems. Unfortunately membership of the fragment is undecidable. We propose a novel type system,…
In proof-theoretic semantics, model-theoretic validity is replaced by proof-theoretic validity. Validity of formulae is defined inductively from a base giving the validity of atoms using inductive clauses derived from proof-theoretic rules.…