Higher order quotients and their implementation in isabelle HOL

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

Volumn 1275, Issue , 1997, Pages 291-306

  Slotosch, Oscar ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; SET THEORY;

ARBITRARY FUNCTIONS; EQUIVALENCE RELATIONS; HIGHER-ORDER; ISABELLE; PARTIAL EQUIVALENCE RELATIONS; TYPE CLASS;

THEOREM PROVING;

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

References (16)

1. Michel Bidoit and Rolf Hennicker. Behavioural Theories and The Proof of Behavioural Properties. Technical report, Paris, 1995.
2. Kim Bruce and John C. Mitchell. PER models of subtyping, recursive types and higher-order polymorphism. In Principles of Programming Languages 19, pages 316-327, Albequerque, New Mexico, 1992.
3. Alonzo Church. A formulation of the simple theory of types. J. Symbolic Logic, 5:56-68, 1940.
4. M. Gordon and T. Melham. Introduction to HOL: A Theorem Proving Environment for Higher Order Logic. Cambridge University Press, 1993.
5. John Robert Harrison. Theorem Proving with the Real Numbers. PhD thesis, University of Cambridge Computer Laboratory, New Museums Site, Pembroke Street, Cambridge, CB2 3QG, UK, 1996. Technical Report No 408.
6. P. Hudak, S. Peyton Jones, and P. Wadler, editors. Report on the Programming Language Haskell, A Non-strict Purely Functional Language (Version 1.2). ACM SIGPLAN Notices, May 1992.
7. M. P. Jones. An Introduction to Gofer, August 1993.
8. T. Nipkow. Order-Sorted Polymorphism in Isabelle. In G. Huet, G. Plotkin, and C. Jones, editors, Proc. 2nd Workshop on Logical Frameworks, pages 307-321, 1991.
9. Lawrence C. Paulson. Isabelle: A Generic Theorem Prover, volume 828 of LNCS. Springer, 1994.
10. Franz Regensburger. HOLCF: Eine konservative Erweiterung von HOL um LCF. PhD thesis, Technische Universität München, 1994.
11. Edmund Robinson. How Complete is PER? In Fourth Annual Symposium on Logic in Computer Science, pages 106-111, 1989.
12. Oscar Slotosch. Refinements in HOLCF: Implementation of Interactive Systems. PhD thesis, Technische Universität München, 1997.
13. Norbert Völker. On the Representation of Datatypes in Isabelle/HOL. Technical Report 379, University of Cambridge Computer Laboratory, 1995. Proceedings of the First Isabelle Users Workshop.
14. Markus Wenzel. Axiomatische Typklassen in Isabelle. Master’s thesis, Institut für Informatik, TU München, 1994.
15. M. Wenzel. Using axiomatic type classes in Isabelle - a tutorial, 1995. Available at http://www4.informatik.tu-muenchen.de/-nipkow/isadist/axclass.dvi.gz.
16. M. Wenzel. Type Classes and Overloading in Higher-Order Logic. In Proceedings of Theorem Proving in Higher Order Logics, 1997. in this volume.