Abstract
Formally proving the correctness of computation systems has traditionally been divided into two high-level steps: first implement a framework for mathematics and then encode computation systems into the resulting mathematical formalism. The firrst step generally involves typed λ-calculus, set theory, or higher-order intuitionistic or classical logic; the second step generally involves encoding a model theoretic semantics of the computation system. Such frameworks have been successful in a number of ways and they continue to attract researchers and system developers.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Miller, D. (2003). Reasoning about Proof Search Specifications: An Abstract. In: Basin, D., Wolff, B. (eds) Theorem Proving in Higher Order Logics. TPHOLs 2003. Lecture Notes in Computer Science, vol 2758. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10930755_13
Download citation
DOI: https://doi.org/10.1007/10930755_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40664-8
Online ISBN: 978-3-540-45130-3
eBook Packages: Springer Book Archive