Predicate calculus and program semantics
Predicate calculus and program semantics
Symbolic model checking: an approach to the state explosion problem
Symbolic model checking: an approach to the state explosion problem
Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
TPHOLs '96 Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics
Proof Presentation for Isabelle
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
Isar - A Generic Interpretative Approach to Readable Formal Proof Documents
TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
On the Implementation of an Extensible Declarative Proof Language
TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
Computer-Assisted Mathematics at Work (The Hahn-Banach Theorem in Isabelle/Isar)
TYPES '99 Selected papers from the International Workshop on Types for Proofs and Programs
Structured Derivations: A Method for Doing High-School Mathematics Carefully
Structured Derivations: A Method for Doing High-School Mathematics Carefully
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Automated engineering of relational and algebraic methods in isabelle/hol
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Structured induction proofs in isabelle/isar
MKM'06 Proceedings of the 5th international conference on Mathematical Knowledge Management
| Hi-index | 0.00 |
We discuss the general concept of calculational reasoning within Isabelle/Isar, which provides a framework for high-level natural deduction proofs that may be written in a human-readable fashion. Setting out from a few basic logical concepts of the underlying metalogical framework of Isabelle, such as higher-order unification and resolution, calculational commands are added to the basic Isar proof language in a flexible and non-intrusive manner. Thus calculational proof style may be combined with the remaining natural deduction proof language in a liberal manner, resulting in many useful proof patterns. A case-study on formalizing Computational Tree Logic (CTL) in simply-typed set-theory demonstrates common calculational idioms in practice.