Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Complete Bidirectional Typing for the Calculus of Inductive Constructions

Meven Lennon-Bertrand 1, 2
1 GALLINETTE - Gallinette : vers une nouvelle génération d'assistant à la preuve
Inria Rennes – Bretagne Atlantique , LS2N - Laboratoire des Sciences du Numérique de Nantes
Abstract : This article presents a bidirectional type system for the Calculus of Inductive Constructions (CIC). It introduces a novel judgement intermediate between the usual inference and checking, dubbed constrained inference, to handle the presence of computation in types. The key property is the completeness of the system with respect to the usual undirected one, which has been formally proven in Coq as a part of the MetaCoq project. Although it plays a central role in an ongoing completeness proof for a realistic typing algorithm, the interest of bidirectionality is much wider, as it clarifies previous works in the area and gives strong insights and structure when trying to prove properties on CIC or design variations and extensions.
Complete list of metadatas
Contributor : Meven Lennon-Bertrand <>
Submitted on : Friday, February 12, 2021 - 1:35:01 PM
Last modification on : Monday, February 22, 2021 - 8:46:56 AM


Files produced by the author(s)


  • HAL Id : hal-03139924, version 1


Meven Lennon-Bertrand. Complete Bidirectional Typing for the Calculus of Inductive Constructions. 2021. ⟨hal-03139924⟩



Record views


Files downloads