The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
HOL Light: A tutorial introduction
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
PVS: A prototype verification system
Owre, S., Rushby, J. M., & Shankar, N. (1992) · Lecture Notes in Computer Science · doi:10.1007/3-540-55602-8_217 · Cited by 1,415
Isabelle: A Generic Theorem Prover
Paulson, L. C., & Nipkow, T. (1994) · Cited by 1,196
IEEE Standard for Binary Floating Point Arithmetic
Ieee, A. (1985) · Medical Entomology and Zoology · Cited by 886
Gordon, M. J., Milner, A. J., & Wadsworth, C. P. (1979) · Lecture Notes in Computer Science · doi:10.1007/3-540-09724-4 · Cited by 628
(1994) · Lecture Notes in Computer Science · doi:10.1007/bfb0030541 · Cited by 612
Edinburgh LCF: A mechanised logic of computation
Gordon, M. J. C. (1979) · Medical Entomology and Zoology · Cited by 606
Mechanizing Programming Logics in Higher Order Logic
Gordon, M. J. C. (1989) · Springer eBooks · doi:10.1007/978-1-4612-3658-0_10 · Cited by 240
Experience with Embedding Hardware Description Languages in HOL
Boulton, R. J., Gordon, A. D., Gordon, M. J. C., Harrison, J., Herbert, J., & Tassel, J. V. (1992) · Cited by 224
Self-citationLogic and computation : interactive proof with Cambridge LCF
Paulson, L. C. (1990) · Medical Entomology and Zoology · Cited by 186
Specification and Verification using Higher-Order Logic: A Case Study
Hanna, K. J., & Daeche, N. (1986) · Kent Academic Repository (University of Kent) · Cited by 32
Cited by
Mechanized Metatheory for the Masses: The PoplMark Challenge
Aydemir, B. E., Bohannon, A., Fairbairn, M., Foster, J. N., Pierce, B. C., Sewell, P., Vytiniotis, D., Washburn, G., Weirich, S., & Zdancewic, S. (2005) · Lecture Notes in Computer Science · doi:10.1007/11541868_4 · Cited by 303
History of Interactive Theorem Proving
Harrison, J., Urban, J., & Wiedijk, F. (2014) · Handbook of the History of Logic · doi:10.1016/b978-0-444-51624-4.50004-6 · Cited by 107
Self-citationINT: An Inequality Benchmark for Evaluating Generalization in Theorem Proving
Wu, Y., Jiang, A. Q., Ba, J., & Grosse, R. (2020) · arXiv · doi:10.48550/arxiv.2007.02924 · Cited by 30
A Promising Path Towards Autoformalization and General Artificial Intelligence
Szegedy, C. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-53518-6_1 · Cited by 29
Zombori, Z., Csiszárik, A., Michalewski, H., Kaliszyk, C., & Urban, J. (2021) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-86059-2_10 · Cited by 22
Olympiad-level formal mathematical reasoning with reinforcement learning
Hubert, T., Mehta, R., Sartran, L., Horváth, M. Z., Žužić, G., Wieser, E., Huang, A., Schrittwieser, J., Schroecker, Y., Masoom, H., et al. (2026) · Nature · doi:10.1038/s41586-025-09833-y · Cited by 19
“Our research is grounded in the field of interactive theorem proving, where humans formalize theorems and construct verifiable proofs using proof assistants such as Isabelle 29 , HOL Light 30 , Rocq 31 and Lean 1 .”
Solving Quantitative Reasoning Problems with Language Models
Lewkowycz, A., Andreassen, A., Dohan, D., Dyer, E., Michalewski, H., Ramasesh, V., Slone, A., Anil, C., Schlag, I., Gutman-Solo, T., et al. (2022) · arXiv · doi:10.48550/arxiv.2206.14858 · Cited by 358
Metadata
- Authors
- Harrison, J.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1996
- Pages
- 265-269
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1497011154
- Cited by
- 335
- References
- 10
- FWCI
- 1.37
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.