Packaging mathematical structures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5674 LNCS, Issue , 2009, Pages 327-342

  Garillot, François ^a   Gonthier, Georges ^b   Mahboubi, Assia ^c   Rideau, Laurence ^d  

^a Parc Orsay Université   (France)

^b MICROSOFT RESEARCH   (United Kingdom)

^c ÉCOLE POLYTECHNIQUE   (France)

^d INRIA   (France)

Author keywords

Coercive subtyping; COQ; Formalization of algebra; SSREFLECT; Type inference

Indexed keywords

COERCIVE SUBTYPING; COQ; FORMALIZATION OF ALGEBRA; SSREFLECT; TYPE INFERENCE;

ALGEBRA; MATHEMATICAL OPERATORS; PROBLEM SOLVING;

THEOREM PROVING;

EID: 70350338448     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03359-9_23     Document Type: Conference Paper

References (22)

1. Lang, S.: Algebra. Springer, Heidelberg (2002)
2. Jackson, P.: Enhancing the Nuprl proof-development system and applying it to computational abstract algebra. PhD thesis, Cornell University (1995)
3. Betarte, G., Tasistro, A.: Formalisation of systems of algebras using dependent record types and subtyping: An example. In: Proc. 7th Nordic workshop on Programming Theory (1995)
4. Pottier, L.: User contributions in Coq, Algebra (1999), http://coq.inria.fr/contribs/Algebra.html
5. Geuvers, H., Pollack, R., Wiedijk, F., Zwanenburg, J.: A constructive algebraic hierarchy in Coq. Journal of Symbolic Computation 34(4), 271-286 (2002)
6. Haftmann, F., Wenzel, M.: Local theory specifications in Isabelle/Isar. In: Berardi, S., Damiani, F., de'Liguoro, U. (eds.) TYPES 2008. LNCS, vol. 5497, pp. 153-168. Springer, Heidelberg (2009)
7. Rudnicki, P., Schwarzweller, C., Trybulec, A.: Commutative algebra in the Mizar system. J. Symb. Comput. 32(1), 143-169 (2001)
8. Gonthier, G., Mahboubi, A., Rideau, L., Tassi, E., Théry, L.: A Modular Formalisation of Finite Group Theory. In: Schneider, K., Brandt, J. (eds.) TPHOLs 2007. LNCS, vol. 4732, pp. 86-101. Springer, Heidelberg (2007)
9. Bertot, Y., Gonthier, G., Ould Biha, S., Pasca, I.: Canonical big operators. In: Mohamed, O.A., Muñoz, C., Tahar, S. (eds.) TPHOLs 2008. LNCS, vol. 5170, pp. 86-101. Springer, Heidelberg (2008)
10. Gonthier, G., Mahboubi, A.: A small scale reflection extension for the Coq system. INRIA Technical report, http://hal.inria.fr/inria-00258384
11. Paulin-Mohring, C.: Définitions Inductives en Théorie des Types d'Ordre Supérieur. Habilitation à diriger les recherches, Université Claude Bernard Lyon I (1996)
12. Sozeau, M., Oury, N.: First-Class Type Classes. In: Mohamed, O.A., Muñoz, C., Tahar, S. (eds.) TPHOLs 2008. LNCS, vol. 5170, pp. 278-293. Springer, Heidelberg (2008)
13. Pollack, R.: Dependently typed records in type theory. Formal Aspects of Computing 13, 386-402 (2002)
14. Bruijn, N.G.D.: Telescopic mappings in typed lambda calculus. Information and Computation 91, 189-204 (1991)
15. Paulson, L.C.: Defining Functions on Equivalence Classes. ACM Transactions on Computational Logic 7(4), 658-675 (2006)
16. Barthe, G., Capretta, V., Pons, O.: Setoids in type theory. Journal of Functional Programming 13(2), 261-293 (2003)
17. Altenkirch, T., McBride, C., Swierstra, W.: Observational equality, now! In: Proceedings of the PLPV 2007 workshop, pp. 57-68. ACM, New York (2007)
18. Olteanu, G.: Computing the Wedderburn decomposition of group algebras by the Brauer-Witt theorem. Mathematics of Computation 76(258), 1073-1087 (2007)
19. Rotman, J.J.: An Introduction to the Theory of Groups. Springer, Heidelberg (1994)
20. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. McGraw-Hill, New York (2003)
21. Sacerdoti Coen, C., Tassi, E.: Working with Mathematical Structures in Type Theory. In: Miculan, M., Scagnetto, I., Honsell, F. (eds.) TYPES 2007. LNCS, vol. 4941, pp. 157-172. Springer, Heidelberg (2008)
22. Sacerdoti Coen, C., Tassi, E.: A constructive and formal proof of Lebesgue Dominated Convergence Theorem in the interactive theorem prover Matita. Journal of Formalized Reasoning 1, 51-89 (2008)