Type classes for mathematics in type theory

Mathematical Structures in Computer Science

Volumn 21, Issue 4, 2011, Pages 795-825

  Spitters, Bas ^a   Van Der Weegen, Eelis ^a  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT INTERFACES; ABSTRACTION PENALTY; CATEGORICAL LANGUAGE; CATEGORY THEORY; COQ SYSTEMS; EFFICIENT COMPUTATION; EFFICIENT IMPLEMENTATION; FORMALISATION; PROOF ENGINEERING; TYPE CLASS; TYPE THEORY; UNIQUE FEATURES; UNIVERSAL ALGEBRA;

ABSTRACTING; ALGEBRA; SEMANTICS;

SET THEORY;

EID: 79961206116     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129511000119     Document Type: Article

References (38)

1. Armand, M., Grégoire, B., Spiwack, A. and Théry, L. (2010) Extending Coq with imperative features and its application to SAT verification. In: Kaufmann, M. and Paulson, L. (eds.) Proceedings, Interactive Theorem Proving, ITP 2010. Springer-Verlag Lecture Notes in Computer Science 6172 83-98.
2. Asperti, A., Ricciotti, W., Sacerdoti Coen, C. and Tassi, E. (2009) Hints in unification. In: Berghofer, S., Nipkow, T. Urban, C. and Wenzel, M. (eds.) Theorem Proving in Higher Order Logics, 22nd International Conference (TPHOLs 2009). Springer-Verlag Lecture Notes in Computer Science 5674 84-98.
3. Asperti, A., Sacerdoti Coen, C., Tassi, E. and Zacchiroli, S. (2007) User interaction with the Matita proof assistant. Journal of Automated Reasoning 39 (2) 109-139. (Pubitemid 47324833)
4. Barthe, G., Capretta, V. and Pons, O. (2003) Setoids in type theory. Journal of Functional Programming 13 (2) 261-293. (Special issue on 'Logical frameworks and metalanguages'.) (Pubitemid 36392874)
5. Bertot, Y. and Castéran, P. (2004) Interactive Theorem Proving and Program Development. Coq'Art: The Calculus of Inductive Constructions, Texts in Theoretical Computer Science, Springer-Verlag.
6. Bishop, E.A. (1967) Foundations of constructive analysis, McGraw-Hill.
7. Boldo, S., Filliâtre, J. and Melquiond, G. (2009) Combining Coq and Gappa for Certifying Floating-Point Programs. In: Carette, J., Dixon, L., Coen, C. and Watt, S. (eds.) Intelligent Computer Mathematics: Proceedings of the 16th Symposium, Calculemus 2009, held as Part of CICM 2009. Springer-Verlag Lecture Notes in Computer Science 5625 59-74.
8. Brus, T.H., van Eekelen, C. J. D., van Leer, M.O. and Plasmeijer, M. J. (1987) Clean -A language for functional graph rewriting. In: Kahn, G. (ed.) Functional programming languages and computer architecture. Springer-Verlag Lecture Notes in Computer Science 274 364-384.
9. Capretta, V. (1999) Universal algebra in type theory. In: Bertot, Y., Dowek, G., Hirschowitz, A., Paulin, C. and Théry, L. (eds.) Theorem Proving in Higher Order Logics (TPHOLs 1999) Springer-Verlag Lecture Notes in Computer Science 1690 131-148.
10. Cartmell, J. (1978) Generalized algebraic theories and contextual categories, Ph.D. thesis, University of Oxford.
11. Coq Development Team (2008) The Coq Proof Assistant Reference Manual, INRIA-Rocquencourt.
12. Coquand, T. and Huet, G. (1988) The calculus of constructions. Information and Computation 76 (2-3) 95-120.
13. Coquand, T. and Paulin, C. (1990) Inductively defined types. In: Martin-Löf, P. and Mints, G. (eds.) COLOG-88. Springer-Verlag Lecture Notes in Computer Science 417 50-66.
14. Cruz-Filipe, L., Geuvers, H. and Wiedijk, F. (2004) C-CoRN, the Constructive Coq Repository at Nijmegen. In: Asperti, A., Bancerek, G. and Trybulec, A. (eds.) Proceedings of MKM2004. Springer-Verlag Lecture Notes in Computer Science 3119 88-103. (Pubitemid 39738959)
15. Dominguez, C. (2008) Formalizing in Coq Hidden Algebras to Specify Symbolic Computation Systems. In: Autexier, S. et al. (eds.) Intelligent Computer Mathematics: Proceedings 9th International Conference, AISC 2008. Springer-Verlag Lecture Notes in Computer Science 5144 270-284.
16. Garillot, F., Gonthier, G., Mahboubi, A. and Rideau, L. (2009) Packaging mathematical structures. In: Berghofer, S., Nipkow, T., Urban, C. and Wenzel, M. (eds.) Theorem Proving in Higher Order Logics, 22nd International Conference (TPHOLs 2009). Springer-Verlag Lecture Notes in Computer Science 5674 327-342.
17. Geuvers, H., Pollack, R., Wiedijk, F. and Zwanenburg, J. (2002) A constructive algebraic hierarchy in Coq. Journal of Symbolic Computation 34 (4) 271-286.
18. Haftmann, F. and Wenzel, M. (2008) Local theory specifications in Isabelle/Isar. In: Berardi, S., Damiani, F. and de'Liguoro, U. (eds.) Types for Proofs and Programs International Conference, TYPES 2008. Springer-Verlag Lecture Notes in Computer Science 5497 153-168.
19. Hofmann, M. (1997) Extensional constructs in intensional type theory, CPHC/BCS Distinguished Dissertations, Springer-Verlag.
20. Huet, G. and Saibi, A. (1995) Constructive category theory. In: Proceedings of the Joint CLICSTYPES Workshop on Categories and Type Theory, Göteborg.
21. Jenks, R., Sutor, R. and Morrison, S. (1992) AXIOM: the scientific computation system, Springer-Verlag.
22. Mac Lane, S. (1998) Categories for the working mathematician, Springer-Verlag.
23. Martin-Löf, P. (1982) Constructive mathematics and computer programming. In: Cohen, L. J., Los, J., Pfeiffer, H. and Podewski, K.-P. (eds.) Logic, methodology and philosophy of science, VI, Studies in Logic and the Foundations of Mathematics, North-Holland 104 153-175.
24. Martin-Löf, P. (1998) An intuitionistic theory of types. In: Twenty-five years of constructive type theory, Oxford Logic Guides 36, Oxford University Press 127-172.
25. Meinke, K. and Tucker, J. (1993) Universal algebra. In: Abramsky, S., Gabbay, D. and Maibaum, T. (eds.) Handbook of logic in computer science (volume 1), Oxford University Press 189-411.
26. O'Connor, R. (2008) Certified exact transcendental real number computation in Coq. Mohamed, O. A., Muñoz, C. and Tahar, S. (eds.) Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2008). Springer-Verlag Lecture Notes in Computer Science 5170 246-261.
27. O'Connor, R. and Spitters, B. (2010) A computer verified, monadic, functional implementation of the integral. Theoretical Computer Science 411 (37) 3386-3402.
28. Palmgren, E. (2009) Constructivist and Structuralist Foundations: Bishops and Lawveres Theories of Sets. Technical Report 4.
29. Palmgren, E. and Vickers, S. (2007) Partial Horn logic and cartesian categories. Annals of Pure and Applied Logic 145 (3) 314-353.
30. Pitts, A. (2001) Categorical logic. Handbook of Logic in Computer Science: Logic and algebraic methods (volume 5), Oxford University Press 39-123.
31. Pollack, R. (2002) Dependently typed records in type theory. Formal Aspects of Computing 13 386-402. (Pubitemid 41204159)
32. Sacerdoti Coen, C. and Tassi, E. (2008) Working with mathematical structures in type theory. In: Miculan, M., Scagnetto, I. and Honsell, F. (eds.) Types for Proofs and Programs. Springer-Verlag Lecture Notes in Computer Science 4941 157-172. (Pubitemid 351775489)
33. Santas, P. (1995) A type system for computer algebra. Journal of Symbolic Computation 19 (1-3) 79-109.
34. Sozeau, M. (2009) A new look at generalized rewriting in type theory. Journal of Formalized Reasoning 2 (1) 41-62.
35. Sozeau, M. and Oury, N. (2008) First-class type classes. In: Mohamed, O. A., Muñoz, C. and Tahar, S. (eds.) Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2008). Springer-Verlag Lecture Notes in Computer Science 5170 278-293.
36. Wadler, P. and Blott, S. (1989) How to make ad-hoc polymorphism less ad hoc. In: Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, ACM 60-76.
37. Weber, A. and Klaeren, H. (1993) Type systems for computer algebra. Relation 10 (1.54) 2615.
38. Zumkeller, R. (2008) Global Optimization in Type Theory, Ph.D. thesis, École Polytechnique, Paris.