L. Abadi, P. Cardelli, and . Curien, Formal parametric polymorphism, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages -POPL '93, number X, pp.157-170, 1993.
DOI : 10.1016/0304-3975(93)90082-5
URL : http://doi.org/10.1016/0304-3975(93)90082-5

M. Abbott, Categories of Containers, 2003.
DOI : 10.1007/3-540-36576-1_2

M. Abbott, T. Altenkirch, and N. Ghani, Categories of Containers, Foundations of Software Science and Computation Structures, pp.23-38, 2003.
DOI : 10.1007/3-540-36576-1_2

P. Aczel, Galois: a theory development project, 1993.

P. Aczel, Simple overloading for type theories In Types for proofs and programs, 1994.

P. Aczel, A notion of class for theory development in algebra in a predicative type theory In Talk presented at the workshop on Types for Proofs and Programs, 1994.

P. Aczel and G. Barthe, A notion of class for Type Theory, 1993.

T. Altenkirch, Constructions, Inductive Types and Strong Normalization, 1993.

S. A. Amitsur, A General Theory of Radicals. I. Radicals in Complete Lattices, American Journal of Mathematics, vol.74, issue.4, p.774, 1952.
DOI : 10.2307/2372225

S. A. Amitsur, A General Theory of Radicals. III. Applications, American Journal of Mathematics, vol.76, issue.1, p.126, 1954.
DOI : 10.2307/2372404

S. A. Amitsur, A General Theory of Radicals. II. Radicals in Rings and Bicategories, American Journal of Mathematics, vol.76, issue.1, 1954.
DOI : 10.2307/2372403

K. Appel and W. Haken, The Solution of the Four-Color-Map Problem, Scientific American, vol.237, issue.4, pp.108-12110, 1977.
DOI : 10.1038/scientificamerican1077-108

R. D. Arthan, Some Mathematical Case Studies in ProofPower-HOL, 2006.

R. D. Arthan, Mathematical Case Studies: ? Some Group Theory, 2006.

A. Asperti, W. Ricciotti, C. Sacerdoti-coen, and E. Tassi, Hints in Unification, Theorem Proving in Higher Order Logics, pp.84-9810, 2009.
DOI : 10.1007/BFb0028402

D. Aspinall and M. Hofmann, Dependent Types Advanced Topics in Types and Programming Languages, pp.45-86, 2005.

M. H. Austern, Generic programming and the STL: using and extending the C++ Standard Template Library, 1998.

B. Aydemir, A. Charguéraud, B. C. Pierce, R. Pollack, and S. Weirich, Engineering formal metatheory, Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp.3-15, 2008.
DOI : 10.1145/1328438.1328443
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.103.5948

R. Baer, Group Theoretical Properties and Functions, Colloquium Mathematicum, vol.14, pp.285-328, 1966.

A. Bailey, The machine-checked literate formalisation of algebra in type theory, 1998.

A. Bailey, Coercion synthesis in computer implementations of type-theoretic frameworks, Types for Proofs and Programs, pp.9-27, 1998.
DOI : 10.1007/BFb0097784

H. Barendregt, Lambda calculi with types, Handbook of logic in computer science, pp.117-309, 1992.
DOI : 10.1017/cbo9781139032636

B. Barras, Auto-validation d'un système de preuves avec familles inductives, Thèse de doctorat, 1999.

B. Barras and B. Grégoire, On the Role of Type Decorations in the Calculus of Inductive Constructions, Computer Science Logic Lecture Notes in Computer Science, vol.3634, pp.151-16610, 2005.
DOI : 10.1007/11538363_12

G. Barthe, Implicit coercions in type systems, Types for Proofs and Programs, pp.1-15, 1996.
DOI : 10.1007/3-540-61780-9_58

G. Barthe, V. Capretta, and O. Pons, Setoids in type theory, Journal of Functional Programming, vol.13, issue.02, pp.261-293, 2003.
DOI : 10.1017/S0956796802004501
URL : https://hal.archives-ouvertes.fr/hal-01124972

H. Bender and G. Glauberman, Local Analysis for The Odd Order Theorem, 1995.
DOI : 10.1017/CBO9780511665592

J. Bernardy, P. Jansson, and R. Paterson, Parametricity and dependent types, Proceedings of the 15th ACM SIGPLAN international conference on Functional programming -ICFP '10, number Section 4, p.345, 2010.
DOI : 10.1145/1932681.1863592
URL : http://openaccess.city.ac.uk/13223/1/pts.pdf

Y. Bertot and P. Castéran, Interactive Theorem Proving and Program Development, Coq'Art: the Calculus of Inductive Constructions, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00344237

Y. Bertot, G. Gonthier, S. O. Biha, and I. Pasca, Canonical Big Operators, Theorem Proving in Higher Order Logics, pp.86-10110, 2008.
DOI : 10.1007/3-540-44659-1_29
URL : https://hal.archives-ouvertes.fr/inria-00331193

G. Betarte and A. Tasistro, Extension of Martin-Löf's type theory with record types and subtyping, Twenty-Five Years of Constructive Type Theory, Proceedings of a Congress held in Venice, pp.21-39, 1995.

F. Biancuzzi and S. Warden, Masterminds of Programming: Conversations with the Creators of Major Programming Languages, 2009.

L. Birkedal and R. Mø-gelberg, On the definition of parametricity URL https, 2004.

E. Bishop, Foundations of constructive analysis, 1967.

N. Bourbaki, Théorie des ensembles, 2006.

A. Bove, A. Krauss, and M. Sozeau, Partiality and Recursion in Interactive Theorem Provers -An Overview. Under consideration for publication in, Math. Struct. in Comp. Science, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00691459

E. Brady, C. Mcbride, and J. Mckinna, Inductive Families Need Not Store Their Indices, Types for Proofs and Programs, pp.115-129, 2004.
DOI : 10.1007/978-3-540-24849-1_8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.3849

R. M. Burstall, Programming with modules as typed functional programming, editor, Fifth generation computer systems, pp.103-112, 1984.

P. Callaghan, Coherence Checking of Coercions in Plastic, APPSEM Workshop on Subtyping & Dependent Types in Programming, pp.1-20, 2000.

P. Callaghan and Z. Luo, Implementation Techniques for Inductive Types in Plastic, Types for Proofs and Programs, pp.245-26210, 1956.
DOI : 10.1093/logcom/9.1.105

V. Capretta, A polymorphic representation of induction-recursion, 2004.

M. M. Chakravarty, G. Keller, S. P. Jones, and S. Marlow, Associated types with class, ACM SIGPLAN Notices, vol.40, issue.1, pp.1-13, 2005.
DOI : 10.1145/1047659.1040306
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.5121

G. Chen, Coercive subtyping for the calculus of constructions, ACM SIGPLAN Notices, vol.38, issue.1, pp.150-159, 2003.
DOI : 10.1145/640128.604145

J. Cheney and R. Hinze, First-class phantom types, 2003.

A. Chlipala, Certified Programming with Dependent Types, 2009.

C. Chong, Y. Leong, and J. Serre, An interview with Jean-Pierre Serre, The Mathematical Intelligencer, vol.8, issue.4, pp.8-13, 1986.
DOI : 10.1007/BF03026112

C. Cohen, Les types quotient en Coq Master's thesis, Master Parisien de Recherche en Informatique, 2010.

W. R. Cook, On understanding data abstraction, revisited, 2009.
DOI : 10.1145/1640089.1640133

T. Coquand, An Analysis of Girard's Paradox, LICS, pp.227-236, 1986.

T. Coquand, An algorithm for type-checking dependent types, Science of Computer Programming, vol.26, issue.1-3, pp.167-17710, 1996.
DOI : 10.1016/0167-6423(95)00021-6
URL : http://doi.org/10.1016/0167-6423(95)00021-6

C. Cornes, Conception d'un langage de haut niveau de représentation de preuves : Récurrence par filtrage de motifs Unification en présence de types inductifs primitifs Synthèse de lemmes d'inversion, Thèse de doctorat, 1997.

J. Courant, Explicit Universes for the Calculus of Constructions, Theorem Proving in Higher Order Logics, pp.95-14510, 2002.
DOI : 10.1007/3-540-45685-6_9

L. Cruz-filipe, H. Geuvers, and F. Wiedijk, C-CoRN, the Constructive Coq Repository at Nijmegen, Mathematical Knowledge Management, pp.88-10310, 2004.
DOI : 10.1007/3-540-45620-1_12

N. G. De-bruijn, Telescopic mappings in typed lambda calculus Information and Computation, pp.189-2040890, 1991.

S. E. Dickson, A torsion theory for Abelian categories. Transactions of the, pp.223-223, 1966.

J. D. Dixon, Problems in group theory, 1973.

G. Dowek, A Complete Proof Synthesis Method for the Cube of Type Systems, Journal of Logic and Computation, vol.3, issue.3, pp.287-315, 1993.
DOI : 10.1093/logcom/3.3.287

G. Dowek, Higher-Order Unification and Matching, Handbook of Automated Reasoning, pp.1009-1062, 2001.
DOI : 10.1016/B978-044450813-3/50018-7

D. Dreyer, R. Harper, M. M. Chakravarty, and G. Keller, Modular type classes, Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages -POPL '07, p.63, 2007.
DOI : 10.1145/1190215.1190229

M. Sautoy, Thompson and Tits win the Abel Prize, Norwegian Academy of Science and Letters, 2008.

D. S. Dummit and R. M. Foote, Abstract algebra, 2004.

P. Dybjer, Inductive sets and families in Martin-Löf's type theory and their set-theoretic semantics, pp.280-306, 1991.

S. Eilenberg and S. Maclane, Natural Isomorphisms in Group Theory URL https, Proceedings of the National Academy of Sciences, pp.537-543, 1942.

S. Eilenberg and S. Maclane, General theory of natural equivalences. Transactions of the, pp.231-231, 1945.

C. M. Elliott, Extensions and Applications of Higher order Unification, 1990.

W. Feit and J. G. Thompson, Solvability of groups of odd order, Pacific Journal of Mathematics, vol.13, issue.3, 1963.

R. B. Findler and M. Flatt, Modular object-oriented programming with units and mixins, 1998.

M. Fluet and R. Pucella, Practical Datatype Specializations with Phantom Types and Recursion Schemes, Electronic Notes in Theoretical Computer Science, vol.148, issue.2, p.25, 2005.
DOI : 10.1016/j.entcs.2005.11.046
URL : http://doi.org/10.1016/j.entcs.2005.11.046

M. Fluet and R. Pucella, Phantom types and subtyping, Journal of Functional Programming, vol.16, issue.06, p.751, 2006.
DOI : 10.1017/S0956796806006046
URL : http://arxiv.org/abs/cs/0403034

A. A. Fraenkel, Y. Bar-hillel, and A. Lévy, Foundations of set theory. Studies in logic and the foundations of mathematics, Noord-Hollandsche U.M, 1973.

Y. Fujisawa, Y. Fuwa, and H. Shimizu, Euler's Theorem and Small Fermat's Theorem, Journal of Formalized Mathematics, vol.10, issue.20, 1998.

R. Garcia, J. Jarvi, A. Lumsdaine, J. Siek, and J. Willcock, An extended comparative study of language support for generic programming, Journal of Functional Programming, vol.17, issue.02, p.145, 2006.
DOI : 10.1017/S0956796806006198

B. J. Gardner, Radical Theory, Longman Scientific & Technical, 1989.

B. J. Gardner, Kurosh-Amitsur Radical Theory For Groups, pp.73-90, 2010.

F. Garillot, A small reflection on group automorphisms. Talk given at the TYPES, 2008.

F. Garillot and B. Werner, Simple Types in Type Theory: Deep and Shallow Encodings, Theorem Proving in Higher Order Logics, pp.368-382, 2007.
DOI : 10.1007/978-3-540-74591-4_27

F. Garillot, G. Gonthier, A. Mahboubi, and L. Rideau, Packaging Mathematical Structures, Theorem Proving in Higher Order Logics, pp.327-34210, 2009.
DOI : 10.1007/978-3-540-68103-8_11
URL : https://hal.archives-ouvertes.fr/inria-00368403

H. Geuvers, Induction Is Not Derivable in Second Order Dependent Type Theory, Typed Lambda Calculi and Applications, pp.166-181, 2001.
DOI : 10.1007/3-540-45413-6_16

H. Geuvers, A Constructive Algebraic Hierarchy in Coq, Journal of Symbolic Computation, vol.34, issue.4, pp.271-286, 2002.
DOI : 10.1006/jsco.2002.0552

E. Giménez, Codifying guarded definitions with recursive schemes, Types for Proofs and Programs, pp.39-5910, 1995.
DOI : 10.1007/3-540-60579-7_3

G. Gonthier, A computer-checked proof of the four-colour theorem, 2005.

G. Gonthier, Formal Proof ? The Four Color Theorem Notices of the, pp.1382-1393, 2008.

G. Gonthier, Formalizing the structure of extremal p-groups. Talk given at the MAP, 2010.

G. Gonthier, Point-Free, Set-Free Concrete Linear Algebra, Interactive Theorem Proving, pp.103-118
DOI : 10.1017/S0956796802004501
URL : https://hal.archives-ouvertes.fr/hal-00805966

G. Gonthier and S. L. Roux, An Ssreflect Tutorial Rapport Technique RT-0367, INRIA, 2009.

G. Gonthier and A. Mahboubi, An introduction to small scale reflection in Coq, Journal of Formalized Reasoning, vol.3, issue.2, pp.95-152, 1979.
URL : https://hal.archives-ouvertes.fr/inria-00515548

G. Gonthier, A. Mahboubi, L. Rideau, E. Tassi, and L. Théry, A Modular Formalisation of Finite Group Theory
DOI : 10.1007/978-3-540-74591-4_8
URL : https://hal.archives-ouvertes.fr/inria-00139131

G. Gonthier, A. Mahboubi, and E. Tassi, A Small Scale Reflection Extension for the Coq system, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00258384

G. Gonthier, B. Ziliani, A. Nanevski, and D. Dreyer, How to make ad hoc proof automation less ad hoc, Proceeding of the 16th ACM SIGPLAN international conference on Functional programming -ICFP '11, 2011.
DOI : 10.1145/2034773.2034798
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.3332

D. Gorenstein, Finite groups, 2007.

B. Grégoire and A. Mahboubi, Proving Equalities in a Commutative Ring Done Right in Coq, Theorem Proving in Higher Order Logics, pp.98-113, 2005.
DOI : 10.1007/11541868_7

D. Gregor, J. Järvi, J. Siek, B. Stroustrup, G. D. Reis et al., Concepts: linguistic support for generic programming in C++, 2006.

E. L. Gunter, Doing algebra in simple type theory, p.789, 1989.

F. Haftmann and M. Wenzel, Constructive Type Classes in Isabelle, Types for Proofs and Programs, pp.160-174, 2007.
DOI : 10.1007/978-3-540-74464-1_11

T. Hallgren, Fun with functional dependencies, Proc Joint CS/CE Winter Meeting, 2001.

M. Matita-user, The HELM team, 2010.

H. Herbelin, Type inference with algebraic universes in the Calculus of Inductive Constructions, 2005.

H. Herbelin, The rules of PCIC. Email on the coq-club mailing-list URL https, 2009.

. Hinze, Fun with phantom types The fun of programming, pp.245-262, 2003.

C. A. Hoare, The emperor's old clothes, Communications of the ACM, vol.24, issue.2, pp.75-83
DOI : 10.1145/358549.358561

J. G. Hook and D. J. Howe, Impredicative Strong Existential Equivalent to Type:Type, 1986.

G. Huet, A unification algorithm for typed ??-calculus, Theoretical Computer Science, vol.1, issue.1, pp.27-5710, 1975.
DOI : 10.1016/0304-3975(75)90011-0

G. Huet, The Constructive Engine A perspective in Theoretical Computer Science. Commemorative Volume for Gift Siromoney, 1989.

G. Huet, Higher Order Unification 30 Years Later, Theorem Proving in Higher Order Logics, pp.241-25810, 2002.
DOI : 10.1007/3-540-45685-6_2

P. Jackson, Exploring abstract algebra in constructive type theory Automated Deduction?CADE-12, pp.1-1510, 1994.

P. Jackson, Enhancing the Nuprl proof-development system and applying it to computational abstract algebra URL https, 1995.

P. Johann and J. Voigtländer, Free theorems in the presence of seq, Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages -POPL '04, pp.99-110, 2004.

M. Jones, Type Classes with Functional Dependencies, Programming Languages and Systems, pp.230-244, 2000.
DOI : 10.1007/3-540-46425-5_15
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.130.789

M. P. Jones, Abstract, Journal of Functional Programming, vol.274, issue.04, p.475, 1992.
DOI : 10.1017/S0956796800000514

M. P. Jones, A system of constructor classes, Proceedings of the conference on Functional programming languages and computer architecture , FPCA '93, 1993.
DOI : 10.1145/165180.165190

W. Kahl and J. Scheffczyk, Named instances for Haskell type classes, 2001.

D. Kapur, D. R. Musser, and A. A. Stepanov, Operators and algebraic structures, Proceedings of the 1981 conference on Functional programming languages and computer architecture , FPCA '81, 1981.
DOI : 10.1145/800223.806763

O. Kiselyov, Operator Overloading. Email on the ocaml mailing-list, 2007.

O. Kiselyov and R. Lämmel, Haskell's overlooked object system. Draft, 2005.

O. Kiselyov and C. Shan, Functional pearl, Proceedings of the ACM SIGPLAN workshop on Haskell , Haskell '04, p.33, 2004.
DOI : 10.1145/1017472.1017481

G. Klein, M. Norrish, T. Sewell, H. Tuch, S. Winwood et al., seL4, Communications of the ACM, vol.53, issue.6, p.107, 2010.
DOI : 10.1145/1743546.1743574

K. Knight, Unification: a multidisciplinary survey, ACM Computing Surveys, vol.21, issue.1, pp.93-124, 1989.
DOI : 10.1145/62029.62030
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.64.8967

N. R. Krishnaswami, J. Aldrich, L. Birkedal, K. Svendsen, and A. Buisse, Design patterns in separation logic, Proceedings of the 4th international workshop on Types in language design and implementation, TLDI '09, 2008.
DOI : 10.1145/1481861.1481874

A. G. Kuro?, Radicals of rings and algebras, Colloq. Math. Soc. Janos Bolyai, pp.297-314, 1973.

A. G. Kuro?, Radicals in the theory of groups, Colloq. Math. Soc. Janos Bolyai, pp.271-296, 1973.

H. Kurzweil and B. Stellmacher, The theory of finite groups: an introduction, 2004.
DOI : 10.1007/b97433

R. Lämmel and K. Ostermann, Software extension and integration with type classes, Proceedings of the 5th international conference on Generative programming and component engineering , GPCE '06, p.161, 2006.
DOI : 10.1145/1173706.1173732

M. Lecat, Erreurs des Mathématiciens des origines à nos jours Ancienne librairie Castaigne & librairie Ém, Desbarax, 1935.

G. Lee and B. Werner, A proof-irrelevant model of CIC with predicative induction and judgemental equality, 2011.

D. Leijen and E. Meijer, Domain specific embedded compilers, 1999.
DOI : 10.1145/331960.331977
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.2599

X. Leroy, Formal verification of a realistic compiler, Communications of the ACM, vol.52, issue.7, 2009.
DOI : 10.1145/1538788.1538814
URL : https://hal.archives-ouvertes.fr/inria-00415861

P. Letouzey, Programmation fonctionnelle certifiée ? L'extraction de programmes dans l'assistant Coq, 2004.

R. Lidl and G. Pilz, Applied abstract algebra, 1998.

G. and L. Russo, An Interview with A, www.stlport.org/resources/StepanovUSA. html. STLport, Edizioni Infomedia srl, 2000.

J. O. Gerena, Closure operators, torsion theories, and radicals in a non-abelian environment. Master of science thesis, 2009.

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

Z. Luo, Coercive subtyping in type theory, Computer Science Logic Lecture Notes in Computer Science, vol.1258, pp.275-296, 1997.
DOI : 10.1007/3-540-63172-0_45

Z. Luo, Coercive subtyping, Journal of Logic and Computation, vol.9, issue.1, pp.105-130
DOI : 10.1093/logcom/9.1.105
URL : https://hal.archives-ouvertes.fr/hal-01130574

. Maclane, Duality for groups, Bulletin of the American Mathematical Society, vol.56, issue.6, pp.485-517, 1950.
DOI : 10.1090/S0002-9904-1950-09427-0

D. Macqueen, Modules for standard ML, Proceedings of the 1984 ACM Symposium on LISP and functional programming , LFP '84, 1984.
DOI : 10.1145/800055.802036

L. Márki, The Categorical Approach to General Radical Theory -a survey Talk presented at the workshop on Radicals of rings and related topics, 2009.

J. Marquis, What is category theory, pp.221-255, 2006.

P. Martin-löf, An intuitionistic theory of types, Bibliopolis, 1984.

C. Mcbride, Faking it (Simulating dependent types in Haskell) Journal of Functional Programming, pp.375-392, 2003.

D. Miller, A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification, Journal of Logic and Computation, vol.1, issue.4, pp.497-536, 1991.
DOI : 10.1093/logcom/1.4.497

J. C. Mitchell and G. D. Plotkin, Abstract types have existential type, ACM Transactions on Programming Languages and Systems, vol.10, issue.3, pp.470-50210, 1988.
DOI : 10.1145/44501.45065

J. G. Morris and M. P. Jones, Instance chains, ACM SIGPLAN Notices, vol.45, issue.9, p.375, 2010.
DOI : 10.1145/1932681.1863596

S. Mu, H. Ko, and P. Jansson, Algebra of Programming Using Dependent Types, Mathematics of Program Construction, pp.268-283, 2008.
DOI : 10.1007/978-3-540-70594-9_15

O. Müller and K. Slind, Treating Partiality in a Logic of Total Functions, The Computer Journal, vol.40, issue.10, pp.640-651, 1997.
DOI : 10.1093/comjnl/40.10.640

M. Odersky and A. Moors, Fighting Bit Rot with Types (Experience Report: Scala Collections), FSTTCS, p.427, 2009.

M. Odersky and M. Zenger, Independently Extensible Solutions to the Expression Problem URL https, Proc. FOOL 12, 2005.

K. Ohtake, A torsion theory for the category of finite groups. Gumma University technical report, pp.5-8, 2008.

B. Oliveira, Modular Visitor Components, ECOOP 2009 ? Object-Oriented Programming, pp.269-293, 2009.
DOI : 10.1017/S0956796808006758

B. C. Oliveira, A. Moors, and M. Odersky, Type classes as objects and implicits, Proceedings of the ACM international conference on Object oriented programming systems languages and applications -OOPSLA '10, p.341, 2010.
DOI : 10.1145/1869459.1869489
URL : http://infoscience.epfl.ch/record/150280

S. and O. Biha, Composants mathématiques pour la théorie des groupes, Thèse de doctorat, 2010.

C. Paulin-mohring, Inductive definitions in the system Coq rules and properties, Typed Lambda Calculi and Applications, pp.328-345
DOI : 10.1007/BFb0037116

C. Paulin-mohring, Définitions Inductives en Théorie des Types d'Ordre Supérieur Habilitation à diriger les recherches, 1996.

A. J. Perlis, Special Feature: Epigrams on programming, ACM SIGPLAN Notices, vol.17, issue.9, pp.7-13, 1982.
DOI : 10.1145/947955.1083808

T. Peterfalvi, Character Theory for the Odd Order Theorem
DOI : 10.1017/CBO9780511565861

S. Peyton-jones, M. P. Jones, and E. Meijer, Type classes: an exploration of the design space, 1997.

F. Pfenning, Unification and anti-unification in the calculus of constructions, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science, 1991.
DOI : 10.1109/LICS.1991.151632

B. I. Plotkin, The functorials, radicals and coradicals in groups, Ural. Gos. Univ. Mat. Zap, vol.7, issue.3, pp.150-182, 1969.

B. I. Plotkin, Radicals in groups, operations on classes of groups, and radical classes, pp.205-244, 1983.
DOI : 10.1090/trans2/119/10

G. Plotkin and M. Abadi, A logic for parametric polymorphism, Typed Lambda Calculi and Applications, pp.361-375, 1993.
DOI : 10.1007/BFb0037118

R. Pollack, Implicit syntax, Informal Proceedings of First Workshop on Logical Frameworks, Antibes, pp.421-434, 1990.

R. Pollack, Typechecking in pure type systems, Informal Proceedings of the 1992 Workshop on Types for Proofs and Programs, pp.271-288, 1992.

R. Pollack, Dependently Typed Records for Representing Mathematical Structure, Theorem Proving in Higher Order Logics, pp.462-479
DOI : 10.1007/3-540-44659-1_29
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.9569

R. Pollack, Dependently Typed Records in Type Theory Formal Aspects of Computing, pp.386-402, 2002.

F. Pottier and D. Rémy, The Essence of ML Type Inference Advanced Topics in Types and Programming Languages, pp.389-489, 2005.

R. Prince, N. Ghani, and C. Mcbride, Proving Properties about Lists Using Containers, Functional and Logic Programming, pp.97-112, 2008.
DOI : 10.1007/978-3-540-78969-7_9

D. Pym, Proofs, Search and Computation in General Logic, 1990.

J. C. Reynolds, Types, Abstraction and Parametric Polymorphism, Proceedings of the IFIP 9th World Computer Congress, pp.513-523, 1983.

R. L. Rivest, A. Shamir, and L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, vol.21, issue.2, pp.120-126
DOI : 10.1145/359340.359342

J. Rotman, An introduction to the theory of groups, 1995.
DOI : 10.1007/978-1-4612-4176-8

P. Rudnicki, Commutative Algebra in the Mizar System, Journal of Symbolic Computation, vol.32, issue.1-2, pp.143-169, 2001.
DOI : 10.1006/jsco.2001.0456

C. and S. Coen, A Semi-reflexive Tactic for (Sub-)Equational Reasoning, Types for Proofs and Programs, pp.98-11410, 2006.
DOI : 10.1007/11617990_7

S. Coen and E. Tassi, Working with Mathematical Structures in Type Theory, Types for Proofs and Programs, pp.157-172, 2008.
DOI : 10.1007/978-3-540-68103-8_11

A. Saibi, Typing algorithm in type theory with inheritance, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '97, pp.292-301, 1997.
DOI : 10.1145/263699.263742

A. Saibi, Outils Génériques de modélisation et de démonstration pour la Formalisation des Mathématiques en théorie des Types, Application à la théorie des catégories, Thèse de doctorat, 1999.

A. Saibi and G. Huet, Constructive category theory, Proof, language, and interaction, pp.239-275, 2000.

H. Saidi, Résolution d'équations dans le système T de Gödel Master's thesis, DEA d'Informatique Fondamentale

T. Santen, Isomorphisms ??? A Link Between the Shallow and the Deep, Theorem Proving in Higher Order Logics, pp.10-1007, 1999.
DOI : 10.1007/3-540-48256-3_4

L. Scott, R. Solomon, J. Thompson, J. Walter, and E. Zelmanov, Notices of the, pp.728-735, 1930.

D. Seidel and J. Voigtländer, Automatically Generating Counterexamples to Naive Free Theorems, Functional and Logic Programming, pp.175-190978, 2010.
DOI : 10.1007/978-3-642-12251-4_14
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.148.6409

J. Shapiro, S. Sridhar, and S. Doerrie, BitC language specification The EROS Group, LLC, 2008.

V. Siles, Investigation on the typing of equality in type systems, 2010.
URL : https://hal.archives-ouvertes.fr/pastel-00556578

W. Snyder and J. Gallier, Higher-order unification revisited: Complete sets of transformations, Journal of Symbolic Computation, vol.8, issue.1-2, pp.101-140, 1989.
DOI : 10.1016/S0747-7171(89)80023-9

E. Soubiran, Modular development of theories and name-space management for the Coq proof assistant, Thèse de doctorat, École Polytechnique, 2010.
URL : https://hal.archives-ouvertes.fr/tel-00679201

M. Sozeau, Un environnement pour la programmation avec types dépendants, Thèse de doctorat, 2008.

M. Sozeau, A New Look At Generalized Rewriting in Type Theory, Journal of Formalized Reasoning, vol.2, issue.1, pp.41-62, 1077.
URL : https://hal.archives-ouvertes.fr/inria-00628904

M. Sozeau and N. Oury, First-Class Type Classes, Theorem Proving in Higher Order Logics, pp.278-293, 2008.
DOI : 10.1007/11542384_8
URL : https://hal.archives-ouvertes.fr/inria-00628864

B. Spitters and E. Van-der-weegen, Type classes for mathematics in type theory, Mathematical Structures in Computer Science, vol.2, issue.04, pp.795-825, 2011.
DOI : 10.1007/3-540-48256-3_10

A. Spiwack, Followup (GT 3d of July) on reification. Email on the coqdev mailing-list URL https, 2011.

A. Stepanov, M. Lee, and . Hewlett-packard, The Standard Template Library, 1995.

J. Stillwell, Elements of Algebra, 1994.
DOI : 10.1007/978-1-4757-3976-3

C. Strachey, Fundamental Concepts in Programming Languages, Higher-Order and Symbolic Computation, pp.11-491010000313106, 2000.

T. Streicher, Semantical Investigations into Intensional Type Theory Habilitation thesis, Ludwig-Maximilians, 1993.

W. Swierstra, Data types ?? la carte, Journal of Functional Programming, vol.18, issue.04, pp.423-436, 2008.
DOI : 10.1017/S0956796808006758

I. Takeuti, The theory of parametricity in lambda cube, 2001.

E. Tassi, Interactive Theorem Provers: issues faced as a user and tackled as a developer Dottorato di ricerca, 2008.

W. Verbruggen, E. De-vries, and A. Hughes, Polytypic programming in COQ, Proceedings of the ACM SIGPLAN workshop on Generic programming, WGP '08, pp.4910-1145, 2008.
DOI : 10.1145/1411318.1411326

J. Voigtländer, Free theorems involving type constructor classes, Proceedings of the 14th ACM SIGPLAN international conference on Functional programming -ICFP '09, 2009.

D. Vytiniotis and S. Weirich, Parametricity, type equality, and higher-order polymorphism, Journal of Functional Programming, vol.20, issue.02, p.175, 2010.
DOI : 10.1016/j.entcs.2007.02.043

P. Wadler, Theorems for free!, Proceedings of the fourth international conference on Functional programming languages and computer architecture , FPCA '89, pp.347-359, 1989.
DOI : 10.1145/99370.99404

P. Wadler, The Expression Problem. Email on java-genericity mailing list, 1998.

P. Wadler, The Girard-Reynolds isomorphism (second edition) Theoretical Computer Science, pp.201-226, 2007.

P. Wadler and S. Blott, How to make ad-hoc polymorphism less ad hoc, Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '89, pp.60-76, 1989.
DOI : 10.1145/75277.75283

S. Wehr and M. Chakravarty, ML Modules and Haskell Type Classes: A Constructive Comparison, Programming Languages and Systems, pp.188-204, 2008.
DOI : 10.1017/S0956796806006034

S. Wehr, R. Lämmel, and P. Thiemann, JavaGI: Generalized Interfaces for Java, ECOOP 2007 ? Object-Oriented Programming, pp.347-372, 2007.
DOI : 10.1007/978-3-540-73589-2_17
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.9850

J. Wells, Typability and type checking in System F are equivalent and undecidable. Annals of Pure and Applied Logic, pp.111-156, 1999.

B. Werner, Une théorie des constructions inductives, Thèse de doctorat, 1994.

J. Yallop, Practical generic programming in OCaml, Proceedings of the 2007 workshop on Workshop on ML , ML '07, p.83, 2007.
DOI : 10.1145/1292535.1292548

X. Yu, A. Nogin, A. Kopylov, and J. Hickey, Formalizing abstract algebra in type theory with dependent records, 16th International Conference on Theorem Proving in Higher Order Logics Emerging Trends Proceedings, pp.13-27, 2003.