Related papers: Profinite lambda-terms and parametricity
This book is a course in Stone-Priestley duality theory, with applications to logic and theoretical computer science. Our target audience are graduate students and researchers in mathematics and computer science. Our aim is to get in a…
A semantic model enjoys full definability if every semantic element in the model is a denotation of some proof or program. Full definability indicates that the model captures programs and proofs in a highly detailed manner. This paper…
This article explores the interplay between the finite quotients of finitely generated residually finite groups and the concept of amenability. We construct a finitely generated, residually finite, amenable group $A$ and an uncountable…
In the refinement calculus, monotonic predicate transformers are used to model specifications for (imperative) programs. Together with a natural notion of simulation, they form a category enjoying many algebraic properties. We build on this…
In a previous work Baillot and Terui introduced Dual light affine logic (DLAL) as a variant of Light linear logic suitable for guaranteeing complexity properties on lambda calculus terms: all typable terms can be evaluated in polynomial…
Given an arbitrary, finitely presented, residually finite group $\Gamma$, one can construct a finitely generated, residually finite, free-by-free group $M_\Gamma = F_\infty\rtimes F_4$ and an embedding $M_\Gamma \hookrightarrow (F_4\ast…
We present a domain-specific type theory for constructions and proofs in category theory. The type theory axiomatizes notions of category, functor, profunctor and a generalized form of natural transformations. The type theory imposes an…
In typical non-idempotent intersection type systems, proof normalization is not confluent. In this paper we introduce a confluent non-idempotent intersection type system for the lambda-calculus. Typing derivations are presented using proof…
We consider the class of profinite diffeological spaces, that is, diffeological spaces which diffeologies are deduced by pull-back of diffeologies on finite-dimensional manifolds through a system of projection mappings. This class includes…
We show that the particular profinite completion used by Boavida-Horel-Robertson in their study of the Grothendieck-Teichm\"uller group fits in the framework of profinite completion as a left Quillen functor. More precisely, we construct a…
We study profinite completion of spaces in the model category of profinite spaces and construct a rigidification of the completion functors of Artin-Mazur and Sullivan which extends also to non-connected spaces. Another new aspect is an…
A class of models is presented, in the form of continuation monads polymorphic for first-order individuals, that is sound and complete for minimal intuitionistic predicate logic. The proofs of soundness and completeness are constructive and…
A group is $\textit{finitely axiomatizable}$ (FA) in a class $\mathcal{C}$ if it can be determined up to isomorphism within $\mathcal{C}$ by a sentence in the first-order language of group theory. We show that profinite groups of various…
Profinite etale cobordism is a cohomology theory for smooth schemes of finite type over a field. Using an idea of Friedlander, it is constructed as an etale topological analog of the algebraic cobordism theories of Voevodsky and…
Reynold's abstraction theorem is now a well-established result for a large class of type systems. We propose here a definition of relational parametricity and a proof of the abstraction theorem in the Calculus of Inductive Constructions…
Solid abelian groups, as introduced by Dustin Clausen and Peter Scholze, form a subcategory of all condensed abelian groups satisfying some ''completeness'' conditions and having favourable categorical properties. Given a profinite ring…
We propose an unsupervised neural model for learning a discrete embedding of words. Unlike existing discrete embeddings, our binary embedding supports vector arithmetic operations similar to continuous embeddings. Our embedding represents…
We present the formalization of a theory of syntax with bindings that has been developed and refined over the last decade to support several large formalization efforts. Terms are defined for an arbitrary number of constructors of varying…
We complete the program, initiated in [6], to compare the many different possible definitions of the underlying homotopy type of a log scheme. We show that, up to profinite completion, they all yield the same result, and thus arrive at an…
We provide a characterisation of strongly normalising terms of the lambda-mu-calculus by means of a type system that uses intersection and product types. The presence of the latter and a restricted use of the type omega enable us to…