This paper gives an introduction to the Calculus of Inductive Constructions, the formalism behind the Coq proof assistant. We present the language and the typing rules, starting with the pure functional part and then introducing the inductive declarations. We briefly discuss the properties of this language, both from the theoretical and pragmatic points of view and give examples of applications.