Type classes and overloading in higher-order logic

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

Volumn 1275, Issue , 1997, Pages 307-322

  Wenzel, Markus ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; POLYMORPHISM;

ABSTRACT THEORY; HASKELL; HIGHER ORDER LOGIC; ISABELLE; MODEL-THEORETIC; SINGLE CARRIER; SYNTACTIC FEATURES; TYPE CLASS;

THEOREM PROVING;

EID: 84949648890     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0028402     Document Type: Conference Paper

References (15)

1. P. B. Andrews. An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof. Academic Press, 1986.
2. A. Church. A formulation of the simple theory of types. Journal of Symbolic Logic, pages 56-68, 1940.
3. M. J. C. Gordon. Set theory, higher order logic or both? In Proc. 9th TPHOLs, volume 1125 of Lecture Notes in Computer Science, pages 191-201. Springer-Verlag, 1996.
4. M. J. C. Gordon and T. P. Melham (editors). Introduction to HOL: A theorem proving environment for higher order logic. Cambridge University Press, 1993.
5. L. Henkin. Completeness in the theory of types. Journal of Symbolic Logic, 15(2):81-91, 1950.
6. P. Hudak, S. L. P. Jones, and P. Wadler (editors). Report on the programming language Haskell, a non-strict purely functional language (Version 1.2). SIGPLAN Notices, March, 1992.
7. The Isabelle library, http://www4.informatik.tu-muenchen.de/-nipkow/isabelle/.
8. M. P. Jones. Qualified Types: Theory and Practice. PhD thesis, University of Oxford, 1992.
9. T. Nipkow. Order-sorted polymorphism in Isabelle. In G. Huet and G. Piotkin, editors, Logical Environments, pages 164-188. Cambridge University Press, 1993.
10. T. Nipkow and C. Prehofer. Type checking type classes. In 20th ACM Symp. Principles of Programming Languages, 1993.
11. L. C. Paulson. The foundation of a generic theorem prover. Journal of Automated Reasoning, 5(3):363-397, 1989.
12. L. C. Paulson. Isabelle: A Generic Theorem Prover, volume 828 of Lecture Notes in Computer Science. Springer-Verlag, 1994.
13. A. Pitts. The HOL logic. In Gordon and Melham [4], pages 191-232.
14. M. Schmidt-Schauß. Computational Aspects of an Order-Sorted Logic with Term Declarations, volume 395 of Lecture Notes in Artificial Intelligence. Springer-Verlag, 1989.
15. M. Wenzel. Using axiomatic type classes in Isabelle - a tutorial. Available at http://www4.informatik.tu-muenchen.de/-nipkow/isadist/axclass.dvi.gz.