Abstract
The LCF system provides a logic of fixed point theory and is useful to reason about nontermination, recursive definitions and infinite-valued types such as lazy lists. Because of continual presence of bottom elements, it is clumsy for reasoning about finite-valued types and strict functions. The HOL system provides set theory and supports reasoning about finite-valued types and total functions well. In this paper a number of examples are used to demonstrate that an extension of HOL with domain theory combines the benefits of both systems. The examples illustrate reasoning about infinite values and nonterminating functions and show how domain and set theoretic reasoning can be mixed to advantage. An example presents a proof of correctness of a recursive unification algorithm using well-founded induction.
Basic Research in Computer Science, Centre of the Danish National Research Foundation.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Agerholm, ‘Mechanizing Program Verification in HOL'. In the Proceedings of the 1991 International Workshop on the HOL Theorem Proving System and Its Applications, Davis California, August 28–30, 1991 (IEEE Computer Society Press). Also in Report IR-111, M.Sc. Thesis, Aarhus University, Computer Science Department, April 1992.
S. Agerholm, ‘Domain Theory in HOL'. In the Proceedings of the 6th International Workshop on Higher Order Logic Theorem Proving and its Applications, Jeffrey J. Joyce and Carl-Johan H. Seger (Eds.), Vancouver, B.C., Canada, August 11–13 1993, LNCS 780, 1994.
S. Agerholm, A HOL Basis for Reasoning about Functional Programs. Ph.D. Thesis, Aarhus University, Computer Science Department, June 1994.
M.J.C. Gordon and T.F. Melham, Introduction to HOL: A Theorem Proving Environment for Higher Order Logic. Cambridge University Press, 1993.
M.J.C. Gordon, R. Milner and C.P. Wadsworth, Edinburgh LCF: A Mechanised Logic of Computation. Springer-Verlag, LNCS 78, 1979.
Z. Manna and R. Waldinger, ‘Deductive Synthesis of the Unification Algorithm'. Science of Computer Programming, Vol. 1, 1981, pp. 5–48.
T.F. Melham, ‘Automating Recursive Type Definitions in Higher Order Logic'. In G. Birtwistle and P.A. Subrahmanyam (eds.), Current Trends in Hardware Verification and Theorem Proving, Springer-Verlag, 1989.
L.C. Paulson, 'structural Induction in LCF'. Springer-Verlag, LNCS 173, 1984. Also in Technical Report No. 44, University of Cambridge, Computer Laboratory, February 1984.
L.C. Paulson, ‘Lessons Learned from LCF'. Technical Report No. 54, University of Cambridge, Computer Laboratory, August 1984.
L.C. Paulson, ‘Verifying the Unification Algorithm in LCF'. Science of Computer Programming, Vol. 5, 1985, pp. 143–169. Also in Technical Report No. 50, University of Cambridge, Computer Laboratory, March 1984.
L.C. Paulson, Logic and Computation: Interactive Proof with Cambridge LCF. Cambridge Tracts in Theoretical Computing 2, Cambridge University Press, 1987.
K.D. Petersen, ‘Graph Model of LAMBDA in Higher Order Logic'. In the Proceedings of the 6th International Workshop on Higher Order Logic Theorem Proving and its Applications, Jeffrey J. Joyce and Carl-Johan H. Seger (Eds.), Vancouver, B.C., Canada, August 11–13 1993, LNCS 780, 1994.
G. Winskel, The Formal Semantics of Programming Languages. The MIT Press, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Agerholm, S. (1994). LCF examples in HOL. In: Melham, T.F., Camilleri, J. (eds) Higher Order Logic Theorem Proving and Its Applications. HUG 1994. Lecture Notes in Computer Science, vol 859. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58450-1_31
Download citation
DOI: https://doi.org/10.1007/3-540-58450-1_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58450-6
Online ISBN: 978-3-540-48803-3
eBook Packages: Springer Book Archive