Abstract
This paper describes the concept of higher order quotients and an implementation in Isabelle. Higher order quotients are a generalization of quotients. They use partial equivalence relations (PERs) instead of equivalence relations to group together different elements. This makes them applicable to arbitrary function spaces. Higher order quotients are conservatively implemented in the Isabelle logic HOL with a type constructor and a type class for PERs. Ordinary quotients are a special case of higher order quotients. An example shows how they can be used in Isabelle.
This work is partially sponsored by the German Federal Ministry of Education and Research (BMBF) as part of the compound project “KorSys”.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Michel Bidoit and Rolf Hennicker. Behavioural Theories and The Proof of Behavioural Properties. Technical report, Paris, 1995.
Kim Bruce and 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. Albequerque, New Mexico, 1992.
Alonzo Church. A formulation of the simple theory of types. J. Symbolic Logic, 5:56–68, 1940.
M. Gordon and T. Melham. Introduction to HOL: A Theorem Proving Environment for Higher Order Logic. Cambridge University Press, 1993.
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.
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.
M. P. Jones. An Introduction to Gofer, August 1993.
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.
Lawrence C. Paulson. Isabelle: A Generic Theorem Prover, volume 828 of LNCS. Springer, 1994.
Franz Regensburger. HOLCF: Eine konservative Erweiterung von HOL um LCF. PhD thesis, Technische Universität München, 1994.
Edmund Robinson. How Complete is PER? In Fourth Annual Symposium on Logic in Computer Science, pages 106–111, 1989.
Oscar Slotosch. Refinements in HOLCF: Implementation of Interactive Systems. PhD thesis, Technische Universität München, 1997.
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.
Markus Wenzel. Axiomatische Typklassen in Isabelle. Master's thesis, Institut für Informatik, TU München, 1994.
M. Wenzel. Using axiomatic type classes in Isabelle — a tutorial, 1995. Available at http://www4.informatik.tu-muenchen.de/-nipkow/isadist/axclass.dvi.gz.
M. Wenzel. Type Classes and Overloading in Higher-Order Logic. In Proceedings of Theorem Proving in Higher Order Logics, 1997. in this volume.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Slotosch, O. (1997). Higher order quotients and their implementation in Isabelle HOL. In: Gunter, E.L., Felty, A. (eds) Theorem Proving in Higher Order Logics. TPHOLs 1997. Lecture Notes in Computer Science, vol 1275. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028401
Download citation
DOI: https://doi.org/10.1007/BFb0028401
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63379-2
Online ISBN: 978-3-540-69526-4
eBook Packages: Springer Book Archive