Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/oxford-university-press/representing-higher-order-logic-proofs-in-hol-ynqrenFZzJ
References (5)
-
Thorsten Altenkirch (1993)
A Formalization of the Strong Normalization Proof for System F in LEGO -
M. Gordon (1988)
HOL: A Proof Generating System for Higher-Order Logic -
J. McKinna, R. Pollack (1993)
Pure Type Systems Formalized -
Konrad Slind (1992)
Adding New Rules to an LCF-style Logic Implementation -
E. Schubert, P. Windley, J. Alves-Foss (1995)
Higher Order Logic Theorem Proving and its Applications 8th International Workshop, Aspen Grove, Ut, Usa, September 11-14, 1995 : Proceedings
- Publisher
- Oxford University Press
- ISSN
- 0010-4620
- eISSN
- 1460-2067
- DOI
- 10.1093/comjnl/38.2.171
- Publisher site
- See Article on Publisher Site
Abstract
Abstract We describe an embedding of higher order logic in the HOL theorem proving system. Types, terms, sequents and inferences are represented as new types in the logic of the HOL system, and notions of proof and provability are defined. Using this formalisation, it is possible to reason about the correctness of derived rules of inference and about the relations between different notions of proofs. The formalisation is also intended to make it possible to reason about programs that handle proofs as their data (e.g., proof checkers). * Abo Akademi University, 20520 Turku, Finland This content is only available as a PDF.
Journal
The Computer Journal – Oxford University Press
Published: Jan 1, 1995