Related papers: Canonical bidirectional typechecking
This article presents a bidirectional type system for the Calculus of Inductive Constructions (CIC). It introduces a new judgement intermediate between the usual inference and checking, dubbed constrained inference, to handle the presence…
We formulate a twisted version of the conjectured duality between heterotic and type I string theories. Our formulation relates the chiral part of the heterotic string with a type I topological B-model on a Calabi-Yau five-fold. We provide…
This paper is a coalgebra version of arXiv:1703.04266 and a sequel to arXiv:1607.03066. We present the definition of a pseudo-dualizing complex of bicomodules over a pair of coassociative coalgebras $\mathcal C$ and $\mathcal D$. For any…
We propose a categorial grammar based on classical multiplicative linear logic. This can be seen as an extension of abstract categorial grammars (ACG) and is at least as expressive. However, constituents of {\it linear logic grammars (LLG)}…
We introduce two-sided type systems, which are sequent calculi for typing formulas. Two-sided type systems allow for hypothetical reasoning over the typing of compound program expressions, and the refutation of typing formulas. By…
We observe that normalization by evaluation for simply-typed lambda-calculus with weak coproducts can be carried out in a weak bi-cartesian closed category of presheaves equipped with a monad that allows us to perform case distinction on…
We study Milner's lambda-calculus with partial substitutions. Particularly, we show confluence on terms and metaterms, preservation of \b{eta}-strong normalisation and characterisation of strongly normalisable terms via an intersection…
The study of polarity in computation has revealed that an "ideal" programming language combines both call-by-value and call-by-name evaluation; the two calling conventions are each ideal for half the types in a programming language. But…
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even better, when the presentation is confluent and terminating,…
A survey is given of results about coherence for categories with finite products and coproducts. For these results, which were published previously by the authors in several places, some formulations and proofs are here corrected, and…
We develop a (co)algebraic framework to study a family of process calculi with monadic branching structures and recursion operators. Our framework features a uniform semantics of process terms and a complete axiomatisation of semantic…
We verify a confluence result for the rewriting calculus of the linear category introduced in our previous paper. Together with the termination result proved therein, the generalized coherence theorem for linear category is established.…
In this paper, we establish three new versions of Landau-type theorems for bounded bi-analytic functions of the form $F(z)=\bar{z}G(z)+H(z)$, where $G$ and $H$ are analytic in the unit disk $|z|<1$ with $G(0)=H(0)=0$ and $H'(0)=1$. In…
We consider twisted standard filtrations of Soergel bimodules associated to arbitrary Coxeter groups and show that the graded multiplicities in these filtrations can be interpreted as structure constants in the Hecke algebra. This…
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…
In this paper, we introduce two focussed sequent calculi, LKp(T) and LK+(T), that are based on Miller-Liang's LKF system for polarised classical logic. The novelty is that those sequent calculi integrate the possibility to call a decision…
This is the central article of a series of three papers on cross product bialgebras. We present a universal theory of bialgebra factorizations (or cross product bialgebras) with cocycles and dual cocycles. We also provide an equivalent…
Decidability of definitional equality and conversion of terms into canonical form play a central role in the meta-theory of a type-theoretic logical framework. Most studies of definitional equality are based on a confluent,…
We describe an isomorphism of categories conjectured by Kontsevich. If $M$ and $\widetilde{M}$ are mirror pairs then the conjectural equivalence is between the derived category of coherent sheaves on $M$ and a suitable version of Fukaya's…
We investigate a canonical way of defining bisimilarity of systems when their semantics is given by a coreflection, typically in a category of transition systems. We use the fact, from Joyal et al., that coreflections preserve open…