A Mizar Mode for HOL

@inproceedings{Harrison1996AMM,
  title={A Mizar Mode for HOL},
  author={John Harrison},
  booktitle={TPHOLs},
  year={1996}
}
The HOL theorem prover is implemented in the LCF manner. All inference is ultimately reduced to a collection of very simple (forward) primitive inference rules, but by programming it is possible to build alternative means of proving theorems on top, while preserving security. Existing HOL proofs styles are, however, very different from those used in textbooks. Here we describe the addition of another style, inspired by Mizar. We believe the resulting system combines the secure extensibility and… CONTINUE READING
Highly Influential
This paper has highly influenced 13 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 79 citations. REVIEW CITATIONS

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
54 Extracted Citations
35 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 54 extracted citations

79 Citations

0510'96'00'05'10'15
Citations per Year
Semantic Scholar estimates that this publication has 79 citations based on the available data.

See our FAQ for additional information.

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 35 references

Isabelle: a generic theorem prover, volume 828 of Lecture Notes in Computer Science

  • L. C. Paulson
  • Springer-Verlag,
  • 1994
Highly Influential
4 Excerpts

A note on mechanizing higher order logic

  • J. A. Robinson
  • In B. Meltzer and D. Michie, editors, Machine…
  • 1969
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…