Article

Structured proofs in isar/HOL

Author:

TYPES'02: Proceedings of the 2002 international conference on Types for proofs and programs

Pages 259 - 278

Published: 24 April 2002 Publication History

Abstract

Isar is an extension of the theorem prover Isabelle with a language for writing human-readable structured proofs. This paper is an introduction to the basic constructs of this language.

References

[1]

Gertrud Bauer and Markus Wenzel. Calculational reasoning revisited -- an Isabelle/ Isar experience. In R. Boulton and P . Jackson, editors, Theorem Proving in Higher Order Logics, TPHOLs 2001, volume 2152 of Lect. Notes in Comp. Sci., pages 75-90. Springer-Verlag, 2001.

Digital Library

Google Scholar

[2]

M.C.J. Gordon, Robin Milner, and C.P. Wadsworth. Edinburgh LCF:a Mechanised Logic of Computation, volume 78 of Lect. Notes in Comp. Sci. Springer-Verlag, 1979.

Google Scholar

[3]

Florian Kammüller, Markus Wenzel, andLa wrence C. Paulson. Locales: A sectioning concept for Isabelle. In Y. Bertot, G. Dowek, A. Hirschowitz, C. Paulin, and L. Thery, editors, Theorem Proving in Higher Order Logics, TPHOLs'99, volume 1690 of Lect. Notes in Comp. Sci., pages 149-165. Springer-Verlag, 1999.

Digital Library

Google Scholar

[4]

Tobias Nipkow, Lawrence Paulson, and Markus Wenzel. Isabelle/HOL -- A Proof Assistant for Higher-Order Logic, volume 2283 of Lect. Notes in Comp. Sci. Springer-Verlag, 2002. http://www.in.tum.de/~nipkow/LNCS2283/.

Digital Library

Google Scholar

[5]

P. Rudnicki. An overview of the Mizar project. In Workshop on Types for Proofs and Programs. Chalmers University of Technology, 1992.

Google Scholar

[6]

Markus Wenzel. Isabelle/Isar -- A Versatile Environment for Human-Readable Formal Proof Documents. PhD thesis, Institut für Informatik, Technische Universit ät München, 2002. http://tumb1.biblio.tu-muenchen.de/publ/diss/in/2002/ wenzel.html.

Google Scholar

[7]

Markus Wenzel. The Isabelle/Isar Reference Manual. Technische Universität München, 2002. http://isabelle.in.tum.de/dist/Isabelle2002/doc/isar-ref.pdf.

Google Scholar

[8]

Markus Wenzel andF reek Wiedijk. A comparison of the mathematical proof languages Mizar and Isar. J. Automated Reasoning, 2003. To appear.

Google Scholar

Cited By

View all

Vazou NBreitner JKunkel RVan Horn DHutton G(2018)Theorem proving for all: equational reasoning in liquid Haskell (functional pearl)ACM SIGPLAN Notices10.1145/3299711.324275653:7(132-144)Online publication date: 17-Sep-2018
https://dl.acm.org/doi/10.1145/3299711.3242756
Vazou NBreitner JKunkel RVan Horn DHutton GWu N(2018)Theorem proving for all: equational reasoning in liquid Haskell (functional pearl)Proceedings of the 11th ACM SIGPLAN International Symposium on Haskell10.1145/3242744.3242756(132-144)Online publication date: 17-Sep-2018
https://dl.acm.org/doi/10.1145/3242744.3242756
Avigad JBlanchette JKlein GPaulson LPopescu ASnelting G(2018)Introduction to Milestones in Interactive Theorem ProvingJournal of Automated Reasoning10.1007/s10817-018-9465-561:1-4(1-8)Online publication date: 1-Jun-2018
https://dl.acm.org/doi/10.1007/s10817-018-9465-5
Show More Cited By

Structured proofs in isar/HOL

Recommendations

Semi-intelligible Isar Proofs from Machine-Generated Proofs

Sledgehammer is a component of the Isabelle/HOL proof assistant that integrates external automatic theorem provers (ATPs) to discharge interactive proof obligations. As a safeguard against bugs, the proofs found by the external provers are reconstructed ...
An Isabelle/HOL Framework for Synthetic Completeness Proofs
CPP '25: Proceedings of the 14th ACM SIGPLAN International Conference on Certified Programs and Proofs

Proof assistants like Isabelle/HOL provide the perfect opportunity to develop more than just one-off formalizations, but frameworks for developing new results within a given area. Completeness results for logical calculi often include bespoke versions of ...
PNL to HOL: From the logic of nominal sets to the logic of higher-order functions

Permissive-Nominal Logic (PNL) extends first-order predicate logic with term-formers that can bind names in their arguments. It takes a semantics in (permissive-)nominal sets. In PNL, the @?-quantifier or @l-binder are just term-formers satisfying ...

Comments

Information & Contributors

Information

Published In

TYPES'02: Proceedings of the 2002 international conference on Types for proofs and programs

April 2002

331 pages

ISBN:354014031X

Editors:
Herman Geuvers
University of Nijmegen, Department of Computer Science, Nijmegen, The Netherlands
,
Freek Wiedijk
University of Nijmegen, Department of Computer Science, Nijmegen, The Netherlands

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 24 April 2002

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

18
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 20 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Vazou NBreitner JKunkel RVan Horn DHutton G(2018)Theorem proving for all: equational reasoning in liquid Haskell (functional pearl)ACM SIGPLAN Notices10.1145/3299711.324275653:7(132-144)Online publication date: 17-Sep-2018
https://dl.acm.org/doi/10.1145/3299711.3242756
Vazou NBreitner JKunkel RVan Horn DHutton GWu N(2018)Theorem proving for all: equational reasoning in liquid Haskell (functional pearl)Proceedings of the 11th ACM SIGPLAN International Symposium on Haskell10.1145/3242744.3242756(132-144)Online publication date: 17-Sep-2018
https://dl.acm.org/doi/10.1145/3242744.3242756
Avigad JBlanchette JKlein GPaulson LPopescu ASnelting G(2018)Introduction to Milestones in Interactive Theorem ProvingJournal of Automated Reasoning10.1007/s10817-018-9465-561:1-4(1-8)Online publication date: 1-Jun-2018
https://dl.acm.org/doi/10.1007/s10817-018-9465-5
Kahl W(2011)The teaching tool CALCCHECKProceedings of the First international conference on Certified Programs and Proofs10.1007/978-3-642-25379-9_17(216-230)Online publication date: 7-Dec-2011
https://dl.acm.org/doi/10.1007/978-3-642-25379-9_17
Chapman PMckinna JUrban C(2008)Mechanising a Proof of Craig's Interpolation Theorem for Intuitionistic Logic in Nominal IsabelleProceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics10.1007/978-3-540-85110-3_5(38-52)Online publication date: 28-Jul-2008
https://dl.acm.org/doi/10.1007/978-3-540-85110-3_5
Paulson LSusanto K(2007)Source-level proof reconstruction for interactive theorem provingProceedings of the 20th international conference on Theorem proving in higher order logics10.5555/1792233.1792251(232-245)Online publication date: 10-Sep-2007
https://dl.acm.org/doi/10.5555/1792233.1792251
Billingsley WRobinson P(2007)Student Proof Exercises Using MathsTiles and Isabelle/HOL in an Intelligent BookJournal of Automated Reasoning10.1007/s10817-007-9072-339:2(181-218)Online publication date: 1-Aug-2007
https://dl.acm.org/doi/10.1007/s10817-007-9072-3
Haftmann FWenzel M(2006)Constructive type classes in IsabelleProceedings of the 2006 international conference on Types for proofs and programs10.5555/1789277.1789288(160-174)Online publication date: 18-Apr-2006
https://dl.acm.org/doi/10.5555/1789277.1789288
Nipkow T(2006)Verifying a hotel key card systemProceedings of the Third international conference on Theoretical Aspects of Computing10.1007/11921240_1(1-14)Online publication date: 20-Nov-2006
https://dl.acm.org/doi/10.1007/11921240_1
Abrial JButler MHallerstede SVoisin L(2006)An open extensible tool environment for event-bProceedings of the 8th international conference on Formal Methods and Software Engineering10.1007/11901433_32(588-605)Online publication date: 1-Nov-2006
https://dl.acm.org/doi/10.1007/11901433_32
Show More Cited By

Abstract

References

Cited By

Recommendations

Semi-intelligible Isar Proofs from Machine-Generated Proofs

An Isabelle/HOL Framework for Synthetic Completeness Proofs

PNL to HOL: From the logic of nominal sets to the logic of higher-order functions

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations