Abstract
The mathematical proof checker Mizar by Andrzej Trybulec uses a proof input language that is much more readable than the input languages of most other proof assistants. This system also differs in many other respects from most current systems. John Harrison has shown that one can have a Mizar mode on top of a tactical prover, allowing one to combine a mathematical proof language with other styles of proof checking. Currently the only fully developed Mizar mode in this style is the Isar proof language for the Isabelle theorem prover. In fact the Isar language has become the official input language to the Isabelle system, even though many users still use its low-level tactical part only. In this paper we compare Mizar and Isar. A small example, Euclid's proof of the existence of infinitely many primes, is shown in both systems. We also include slightly higher-level views of formal proof sketches. Moreover, a list of differences between Mizar and Isar is presented, highlighting the strengths of both systems from the perspective of end-users. Finally, we point out some key differences of the internal mechanisms of structured proof processing in either system.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aspinall, D.: Proof general: A generic tool for poof development, in European Joint Conferences on Theory and Practice of Software (ETAPS), 2000.
Bauer, G. and Wenzel, M.: Computer-assisted mathematics at work – The Hahn-Banach theorem in Isabelle/Isar, in T. Coquand, P. Dybjer, B. Nordström and J. Smith (eds), Types for Proofs and Programs: TYPES'99, LNCS 1956, 2000.
Bauer, G. and Wenzel, M.: Calculational reasoning revisited – An Isabelle/Isar experience, in R. J. Boulton and P. B. Jackson (eds), Theorem Proving in Higher Order Logics: TPHOLs 2001, LNCS 2152, 2001.
Berghofer, S. and Nipkow, T.: Proof terms for simply typed higher order logic, in J. Harrison and M. Aagaard (eds), Theorem Proving in Higher Order Logics: TPHOLs 2000, LNCS 1869, 2000.
Burstall, R.: Teaching people to write proofs: A tool, in CafeOBJ Symposium, Numazu, Japan, 1998.
de Bruijn, N.: The mathematical vernacular, a language for mathematics with typed sets, in P. Dybjer et al. (eds), Proceedings of theWorkshop on Programming Languages, Marstrand, Sweden, 1987.
Harrison, J.: A Mizar mode for HOL, in Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics, TPHOLs'96, LNCS 1125, Springer, 1996.
Muzalewski, M.: An Outline of PC Mizar, Fondation Philippe le Hodey, Brussels, 1993. http://www.cs.kun.nl/~freek/mizar/mizarmanual.ps.gz.
Nipkow, T., Paulson, L. and Wenzel, M.: Isabelle/HOL – A Proof Assistant for Higher-Order Logic, LNCS 2283, Springer, 2002.
Paulson, L. C.: The foundation of a generic theorem prover, J. Automated Reasoning 5(3) (1989).
Paulson, L.: Isabelle: A Generic Theorem Prover, LNCS 828, Springer, 1994.
Paulson, L.: The Isabelle reference manual, 2002a. http://isabelle.in.tum.de/doc/ref.pdf. A COMPARISON OF MIZAR AND ISAR 411
Paulson, L. C.: Isabelle's logics: FOL and ZF, 2002b. http://isabelle.in.tum.de/doc/logics-ZF.pdf.
Rudnicki, P.: An overview of the MIZAR project, in 1992 Workshop on Types for Proofs and Programs, Bastad, 1992.
Syme, D.: DECLARE: A prototype declarative proof system for higher order logic, Technical Report 416, University of Cambridge Computer Laboratory, 1997.
Syme, D.: Declarative theorem proving for operational semantics, Ph.D. thesis, University of Cambridge, 1998.
Syme, D.: Three tactic theorem proving, in Theorem Proving in Higher Order Logics, TPHOLs'99, Nice, France, LNCS 1690, Springer, 1999.
Trybulec, A.: Some features of the Mizar language, Presented at a workshop in Turin, Italy, 1993.
Wenzel, M.: Isar – A generic interpretative approach to readable formal proof documents, in Y. Bertot, G. Dowek, A. Hirschowitz, C. Paulin and L. Thery (eds), Theorem Proving in Higher Order Logics: TPHOLs'99, LNCS 1690, 1999.
Wenzel, M.: Isabelle/Isar – A versatile environment for human-readable formal proof documents, Ph.D. thesis, Institut für Informatik, Technische Universität München, 2002a. http://tumb1.biblio.tu-muenchen.de/publ/diss/in/2002/wenzel.html.
Wenzel, M.: The Isabelle/Isar Reference Manual, TU München, 2002b. http://isabelle.in.tum.de/doc/isar-ref.pdf.
Wiedijk, F.: Mizar: An impression, 1993. http://www.cs.kun.nl/~freek/mizar/mizarintro.ps.gz.
Wiedijk, F.: The mathematical vernacular, 2000. http://www.cs.kun.nl/~freek/notes/mv.ps.gz.
Wiedijk, F.: Mizar light for HOL light, in R. J. Boulton and P. B. Jackson (eds), Theorem Proving in Higher Order Logics: TPHOLs 2001, LNCS 2152, 2001.
Wiedijk, F.: Formal proof sketches, 2002. http://www.cs.kun.nl/~freek/notes/sketches.ps.gz.
Zammit, V.: On the implementation of an extensible declarative proof language, in Theorem Proving in Higher Order Logics, TPHOLs'99, Nice, France, LNCS 1690, Springer, 1999a.
Zammit, V.: On the readability of machine checkable formal proofs, Ph.D. thesis, University of Kent, 1999b.
Rights and permissions
About this article
Cite this article
Wenzel, M., Wiedijk, F. A Comparison of Mizar and Isar. Journal of Automated Reasoning 29, 389–411 (2002). https://doi.org/10.1023/A:1021935419355
Issue Date:
DOI: https://doi.org/10.1023/A:1021935419355