Skip to Main content Skip to Navigation
Conference papers

The Implicit Calculus of Constructions as a Programming Language with Dependent Types

Bruno Barras 1, 2 Bruno Bernardo 1, 2 
2 TYPICAL - Types, Logic and computing
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France
Abstract : In this paper, we show how Miquel's Implicit Calculus of Constructions (ICC) can be used as a programming language featuring dependent types. Since this system has an undecidable type-checking, we introduce a more verbose variant, called ICC* which fixes this issue. Datatypes and program specifications are enriched with logical assertions (such as preconditions, postconditions, invariants) and programs are decorated with proofs of those assertions. The point of using ICC* rather than the Calculus of Constructions (the core formalism of the Coq proof assistant) is that all of the static information (types and proof objects) is transparent, in the sense that it does not affect the computational behavior. This is concretized by a built-in extraction procedure that removes this static information. We also illustrate the main features of ICC* on classical examples of dependently typed programs.
Document type :
Conference papers
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download
Contributor : Bruno Bernardo Connect in order to contact the contributor
Submitted on : Monday, November 16, 2009 - 6:45:00 PM
Last modification on : Friday, February 4, 2022 - 3:09:06 AM
Long-term archiving on: : Tuesday, October 16, 2012 - 2:11:02 PM


Files produced by the author(s)


  • HAL Id : inria-00432658, version 1



Bruno Barras, Bruno Bernardo. The Implicit Calculus of Constructions as a Programming Language with Dependent Types. International Workshop on Type theory, proof theory, and rewriting (TPR'07), Gilles Dowek, Jun 2007, Paris, France. ⟨inria-00432658⟩



Record views


Files downloads