Organizing numerical theories using axiomatic type classes

Journal of Automated Reasoning

Volumn 33, Issue 1, 2004, Pages 29-49

  Paulson, Lawrence C ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Arithmetic; Axiomatic type classes; Isabelle; Overloading; Polymorphism

Indexed keywords

DIGITAL ARITHMETIC; INTEGER PROGRAMMING; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; POLYNOMIALS; SET THEORY; THEOREM PROVING;

ARITHMETIC; AXIOMATIC TYPE CLASSES; ISABELLE; OVERLOADING; POLYMORPHISMS;

NUMERICAL METHODS;

EID: 14844338623     PISSN: 01687433     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10817-004-3997-6     Document Type: Article

References (13)

1. Farmer, W. M., Guttman, J. D. and Thayer, F. J.: IMPS: An interactive mathematical proof system, J. Automated Reasoning 11(2) (1993), 213-248.
2. Fleuriot, J. D. and Paulson, L. C.: Mechanizing nonstandard real analysis, LMS J. Comput. Math. 3 (2000), 140-190, http://vww.lms.ac.uk/jcm/3/ lms1999-027/.
3. Geuvers, H., Pollack, R., Wiedijk, F. and Zwanenburg, J.: A constructive algebraic hierarchy in Coq, J. Symbolic Comput. 34(4) (2002), 271-286.
4. Gordon, M. J. C. and Melham, T. F.: Introduction to HOL: A Theorem Proving Environment for Higher Order Logic, Cambridge University Press, 1993.
5. Hudak, P.: The Haskell School of Expression, Cambridge University Press, 2000.
6. Klein, G. and Nipkow, T.: Verified bytecode verifiers, Theoret. Comput. Sci. 298 (2003), 583-626.
7. Nipkow, T.: Order-sorted polymorphism in Isabelle, in G. Huet and G. Plotkin (eds.), Logical Environments, Cambridge University Press, 1993, pp. 164-188.
8. Nipkow, T., Paulson, L. C. and Wenzel, M.: Isabelle/HOL: A Proof Assistant for Higher-Order Logic, LNCS 2283, Springer, 2002.
9. Paulson, L. C.: ML for the Working Programmer, 2nd edn, Cambridge University Press, 1996.
10. Paulson, L. C.: Inductive analysis of the Internet protocol TLS, ACM Transactions on Information and System Security 2(3) (1999), 332-351.
11. The PVS standard prelude, http://pvs.csl.sri.com/doc/prelude.html, 2003.
12. Wadler, P. and Blott, S.: How to make ad-hoc polymorphism less ad hoc, in 16th Annual Symposium on Principles of Programming Languages, ACM Press, 1989, pp. 60-76.
13. Wenzel, M.: Type classes and overloading in higher-order logic, in E. L. Gunter and A. Felty (eds.), Theorem Proving in Higher Order Logics: TPHOLs '97, LNCS 1275, Springer, 1997, pp. 307-322.