Abstract
This paper presents a survey of HOLCF, a higher order logic of computable functions. The logic HOLCF is based on HOLC, a variant of the well known higher order logic HOL, which offers the additional concept of type classes.
HOLCF extends HOLC with concepts of domain theory such as complete partial orders, continuous functions and a fixed point operator. With the help of type classes the extension can be formulated in a way such that the logic LCF constitutes a proper sublanguage of HOLCF. Therefore techniques from higher order logic and LCF can be combined in a fruitful manner avoiding drawbacks of both logics. The development of HOLCF was entirely conducted within the Isabelle system.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Sten Agerholm. A HOL Basis for Reasoning about Functional Programs. PhD thesis, University of Aarhus, BRICS Departement of Computer Science, 1994. BRICS Report Series RS-94-44.
Manfred Broy, Frank Dederichs, Claus Dendorfer, Max Fuchs, Thomas Gritzner, and Rainer Weber. The Design of Distributed Systems: An Introduction to FOCUS. Technical Report TUM-I9202-2, Institut für Informatik, Technische Universität München, 1993.
H.D. Ehrich, M. Gogolla, and U.W. Lippeck. Algebraische Spezifikation abstrakter Datentypen. Teubner, 1989.
M.J.C. Gordon and T.F. Melham. Introduction to HOL: A Theorem Proving Environment for Higher Order Logic. Cambridge University Press, 1993.
M. Gordon, R. Milner, and C. Wadsworth. Edinburgh LCF: A Mechanised Logic of Computation, volume 78 of LNCS. Springer, 1979.
Carl A. Gunter. Semantics of Programming Languages: Structures and Techniques. The MIT Press, 1992.
Tobias 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.
Tobias Nipkow and Christian Prehofer. Type checking type classes. In Proc. 20th ACM Symp. Principles of Programming Languages, pages 409–418, 1993.
L.C. Paulson. Deriving Structural Induction in LCF, volume 173 of LNCS, pages 197–214. Springer, 1984.
L.C. Paulson. Logic and Computation, Interactive Proof with Cambridge LCF, volume 2 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1987.
L.C. Paulson. The foundation of a generic theorem prover. Journal of Automated Reasoning, 5(3):363–397, 1989.
L.C. Paulson. Isabelle: A Generic Theorem Prover, volume 828 of LNCS. Springer, 1994.
Andrew Pitts. A co-induction principle for recursively defined domains. Technical Report 252, University of Cambridge, Computer Laboratory, 1992.
Franz Regensburger. HOLCF: Eine konservative Erweiterung von HOL um LCF, 1994. Dissertation, Technische Universität München.
G. Winskel. The Formal Semantics of Programming Languages. The MIT Press, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Regensburger, F. (1995). HOLCF: Higher order logic of computable functions. In: Thomas Schubert, E., Windley, P.J., Alves-Foss, J. (eds) Higher Order Logic Theorem Proving and Its Applications. TPHOLs 1995. Lecture Notes in Computer Science, vol 971. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60275-5_72
Download citation
DOI: https://doi.org/10.1007/3-540-60275-5_72
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60275-0
Online ISBN: 978-3-540-44784-9
eBook Packages: Springer Book Archive