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

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.

• Type: Conference
• Year: 2008
• Where: FOSSACS
• Authors: Bruno Barras, Bruno Bernardo
• Keywords: Coq Proof Assistant, FOSSACS 2008, Miquel's Implicit Calculus, Software Engineering, Static Information