Z. Luo, ECC, an extended calculus of constructions, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science, pp.385-395, 1989.
DOI : 10.1109/LICS.1989.39193

B. Werner, Une théorie des constructions inductives, 1994.

C. Development and T. , The coq proof assistant reference manual

H. Goguen, A typed operational semantics for type theory, 1994.

B. Nordstrom, K. Petersson, and J. M. Smith, Programming in Martin-Löf's Type Theory: An Introduction, 1990.

H. Geuvers and B. Werner, On the Church-Rosser property for expressive type systems and its consequences for their metatheoretic study, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science, pp.320-329, 1994.
DOI : 10.1109/LICS.1994.316057

B. Werner and G. Lee, A simple model of calculus of inductive constructions with judgemental equality

B. Grégoire, Compilation des termes de preuves: un (nouveau) mariage entre coq et ocaml Thése de doctorat, spécialité informatique, 2003.

H. Geuvers, Logics and type systems, 1993.

R. Adams, Pure type systems with judgemental equality, Journal of Functional Programming, vol.16, issue.02, pp.219-246, 2006.
DOI : 10.1017/S0956796805005770

S. Berardi, Type dependence and constructive mathematics, 1988.

H. Barendregt, S. Abramsky, D. M. Gabbay, T. S. Maibaum, and H. P. Barendregt, Lambda calculi with types, Handbook of Logic in Computer Science, pp.117-309, 1992.

L. S. Van-benthem and . Jutting, Typing in pure type systems, Inf. Comput, vol.105, issue.1, pp.30-41, 1993.

V. Siles, Formalization of equivalence between semi-full pts and ptse

N. De-bruijn, Lambda-calculus notation with nameless dummies: a tool for automatic formula manipulation with application to the Church-Rosser theorem, Indag. Math, vol.34, issue.5, pp.381-392, 1972.