This open access book investigates the role played by identity of proofs in proof-theoretic
semantics. It develops a conception of proof-theoretic semantics as primarily concerned with …

We study the question of whether a given type has a unique inhabitant modulo program
equivalence. In the setting of simply-typed lambda-calculus with sums, equipped with the …

Some programming language features (coercions, type-classes, implicits) rely on inferring a
part of the code that is determined by its usage context. In order to better understand the …

In this paper we explore a family of type isomorphisms in System F whose validity
corresponds, semantically, to some form of the Yoneda isomorphism from category theory …

In the present paper we discuss a recent suggestion of Schroeder-Heister concerning the
possibility of defining an intensional notion of harmony using isomorphism in second-order …

We revisit the notion of intuitionistic equivalence and formal proof representations by
adopting the view of formulas as exponential polynomials. After observing that most of the …

Lambda calculi with algebraic data types lie at the core of functional programming
languages and proof assistants, but conceal at least two fundamental theoretical problems …

In this paper we explore a family of type isomorphisms in System F whose validity
corresponds, semantically, to some form of the Yoneda isomorphism from category theory …

In this chapter, we propose some future directions of work, potentially beneficial to
Mathematics and its foundations, based on the recent import of methodology from the theory …

Résumé Ce document est un rapport de mon stage chez OCamlPro, effectué dans le cadre
demaformationenMaster2fiilàl'UniversitéParis-Saclay. J'yprésentedddddml, un langage où …