Related papers: Canonical bidirectional typechecking
Bidirectional typechecking, in which terms either synthesize a type or are checked against a known type, has become popular for its scalability (unlike Damas-Milner type inference, bidirectional typing remains decidable even for very…
Bidirectional typechecking, in which terms either synthesize a type or are checked against a known type, has become popular for its applicability to a variety of type systems, its error reporting, and its ease of implementation. Following…
In the spirit of the Curry-Howard correspondence between proofs and programs, we define and study a syntax and semantics for classical logic equipped with a computationally involutive negation, using a polarised effect calculus, the linear…
We review the close relationship between abstract machines for (call-by-name or call-by-value) lambda-calculi (extended with Felleisen's C) and sequent calculus, reintroducing on the way Curien-Herbelin's syntactic kit expressing the…
Intersection and union types denote conjunctions and disjunctions of properties. Using bidirectional typechecking, intersection types are relatively straightforward, but union types present challenges. For union types, we can case-analyze a…
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 prove coherence theorems for dualizable objects in monoidal bicategories and for fully dualizable objects in symmetric monoidal bicategories, describing coherent dual pairs and coherent fully dual pairs. These are property-like…
The Deligne category of symmetric groups is the additive Karoubi closure of the partition category. It is semisimple for generic values of the parameter t while producing categories of representations of the symmetric group when modded out…
The "linear dual" of a cocomplete linear category $\mathcal C$ is the category of all cocontinuous linear functors $\mathcal C \to \mathrm{Vect}$. We study the questions of when a cocomplete linear category is reflexive (equivalent to its…
We propose a concrete surface representation of abstract categorial grammars in the category of word cobordisms or cowordisms for short, which are certain bipartite graphs decorated with words in a given alphabet, generalizing linear logic…
We study a generalization of the classical correspondence between homogeneous quadratic polynomials, quadratic forms, and symmetric/alternating bilinear forms to forms in $n$ variables. The main tool is combinatorial polarization, and the…
The scientific and practical needs of the twenty-first century lead humankind to convergence of the specialized and diverse branches of science and technology. This convergence reveals the need for new mathematical theories capable of…
In this thesis I lift the Curry--Howard--Lambek correspondence between the simply-typed lambda calculus and cartesian closed categories to the bicategorical setting, then use the resulting type theory to prove a coherence result for…
For a family of log points with constant log structure and for a proper SNCL scheme with an SNCD over the family, we construct a fundamental l-adic bifiltered complex as a geometric application of the theory of the derived category of…
Bidirectional typing combines two modes of typing: type checking, which checks that a program satisfies a known type, and type synthesis, which determines a type from the program. Using checking enables bidirectional typing to support…
The paper is a contribution both to the theoretical foundations and to the actual construction of efficient automatizable proof procedures for non-classical logics. We focus here on the case of finite-valued logics, and exhibit: (i) a…
Under the extension of Curry-Howard's correspondence to classical logic, Gentzen's NK and LK systems can be seen as syntax-directed systems of simple types respectively for Parigot's Lambda Mu Calculus and Curien-Herbelin's Lambda Bar Mu Mu…
The higher-dimensional modal mu-calculus is an extension of the mu-calculus in which formulas are interpreted in tuples of states of a labeled transition system. Every property that can be expressed in this logic can be checked in…
For a left coherent ring A with every left ideal having a countable set of generators, we show that the coderived category of left A-modules is compactly generated by the bounded derived category of finitely presented left A-modules…
In this paper, we are interested in the construction of a bilinear pseudodifferential calculus. We define some symbolic classes which contains those of Coifman-Meyer. These new classes allow us to consider operators closely related to the…