A. Abel, Termination checking with types Special Issue: Fixed Points in Computer Science (FICS'03), RAIRO ? Theoretical Informatics and Applications, pp.277-319, 2004.

A. Abel and T. Altenkirch, A predicative analysis of structural recursion, Journal of Functional Programming, vol.12, issue.01, pp.1-41, 2002.
DOI : 10.1017/S0956796801004191

L. Augustsson, Cayenne a language with dependent types, Proceedings of the third ACM SIGPLAN international conference on Functional programming, ICFP '98, pp.239-250, 1998.

Y. Bertot and P. Castéran, Interactive Theorem Proving and Program Development. Coq'Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science, 2004.
DOI : 10.1007/978-3-662-07964-5
URL : https://hal.archives-ouvertes.fr/hal-00344237

P. Boutillier, Cloisonnement des contenus calculatoire et logique du filtrage dépendant en théorie des types et application aux coupures commutatives, 2010.

A. Chlipala, An introduction to programming and proving with dependent types in Coq, Journal of Formalized Reasoning, vol.3, issue.2, pp.1-93, 2010.

. Th and . Coquand, Pattern Matching with Dependent Types, Proceedings of the 1992 Workshop on Types for Proofs and Programs. Available by ftp at site ftp.inria.fr, 1992.

. Th, C. Coquand, and . Paulin-mohring, Inductively defined types, Proceedings of Colog'88, 1990.

T. Coquand and P. Dybjer, Inductive definitions and type theory an introduction (preliminary version), FSTTCS, pp.60-76, 1994.
DOI : 10.1007/3-540-58715-2_114

P. Dybjer, Inductive families, Formal Aspects of Computing, vol.30, issue.3, pp.440-465, 1997.
DOI : 10.1007/BF01211308

E. Giménez, Structural recursive definitions in type theory, ICALP, pp.397-408, 1998.
DOI : 10.1007/BFb0055070

H. Goguen, C. Mcbride, and J. Mckinna, Eliminating Dependent Pattern Matching, Essays Dedicated to Joseph A. Goguen, pp.521-540, 2006.
DOI : 10.1007/11780274_27
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.7522

X. Leroy, D. Doligez, J. Garrigue, D. Rémy, and J. Vouillon, The Objective Caml system, documentation and user's manual ? release 3, 2010.

Z. Luo, Computation and reasoning: a type theory for computer science, 1994.

R. Milner, M. Tofte, R. Harper, and D. Macqueen, The Definition of Standard ML -Revised, 1997.

P. Morris, T. Altenkirch, and N. Ghani, Constructing strictly positive families, Thirteenth Computing: The Australasian Theory Symposium (CATS2007), pp.111-121, 2007.

U. Norell, Dependently typed programming in Agda, Lecture Notes from the Summer School in Advanced Functional Programming, 2008.

B. Pientka and J. Dunfield, Beluga: A Framework for Programming and Reasoning with Deductive Systems (System Description), IJCAR, pp.15-21, 2010.
DOI : 10.1007/978-3-642-14203-1_2

M. Sozeau, Un environnement pour la programmation avec types dépendants, 2008.

H. Xi, Dependent ML An approach to practical programming with dependent types, Journal of Functional Programming, vol.17, issue.02, pp.215-286, 2007.
DOI : 10.1017/S0956796806006216