Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
Javalight is type-safe—definitely
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Automated reasoning and its applications
A generic approach to building user interfaces for theorem provers
Journal of Symbolic Computation - Special issue graphical user interfaces and protocols
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
TPHOLs '96 Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics
An Interface between Clam and HOL
Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics
Winskel is (Almost) Right: Towards a Mechanized Semantics Textbook
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
PVS: Combining Specification, Proof Checking, and Model Checking
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
More Church-Rosser Proofs (in Isabelle/HOL)
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Omega: Towards a Mathematical Assistant
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Proof General: A Generic Tool for Proof Development
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Weak Alternating Automata in Isabelle/HOL
TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
Formalizing Stålmarck's Algorithm in Coq
TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
Calculational Reasoning Revisited (An Isabelle/Isar Experience)
TPHOLs '01 Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics
A Generic Library for Floating-Point Numbers and Its Application to Exact Computing
TPHOLs '01 Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics
TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
Restoring Natural Language as a Computerised Mathematics Input Method
Calculemus '07 / MKM '07 Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference
Barendregt's Variable Convention in Rule Inductions
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Implementing Spi Calculus Using Nominal Techniques
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
A Tactic Language for Hiproofs
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Logic-Free Reasoning in Isabelle/Isar
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
On Correctness of Mathematical Texts from a Logical and Practical Point of View
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Local Theory Specifications in Isabelle/Isar
Types for Proofs and Programs
Formal Proof: Reconciling Correctness and Understanding
Calculemus '09/MKM '09 Proceedings of the 16th Symposium, 8th International Conference. Held as Part of CICM '09 on Intelligent Computer Mathematics
MathLang Translation to Isabelle Syntax
Calculemus '09/MKM '09 Proceedings of the 16th Symposium, 8th International Conference. Held as Part of CICM '09 on Intelligent Computer Mathematics
A Logically Saturated Extension of ${{\bar\lambda\mu\tilde{\mu}}}$
Calculemus '09/MKM '09 Proceedings of the 16th Symposium, 8th International Conference. Held as Part of CICM '09 on Intelligent Computer Mathematics
Liveness Reasoning with Isabelle/HOL
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Recent developments in mega's proof search programming language
ACM Communications in Computer Algebra
MathAbs: a representational language for mathematics
Proceedings of the 8th International Conference on Frontiers of Information Technology
Translating between language and logic: what is easy and what is difficult
CADE'11 Proceedings of the 23rd international conference on Automated deduction
The Matita interactive theorem prover
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Towards formal proof script refactoring
MKM'11 Proceedings of the 18th Calculemus and 10th international conference on Intelligent computer mathematics
Structured induction proofs in isabelle/isar
MKM'06 Proceedings of the 5th international conference on Mathematical Knowledge Management
Assisted proof document authoring
MKM'05 Proceedings of the 4th international conference on Mathematical Knowledge Management
Reasoning, Action and Interaction in AI Theories and Systems
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
A tactic language for declarative proofs
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
A coherent logic based geometry theorem prover capable of producing formal and readable proofs
ADG'10 Proceedings of the 8th international conference on Automated Deduction in Geometry
Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation
Zeno: an automated prover for properties of recursive data structures
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Extending MKM formats at the statement level
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
CDCL-based abstract state transition system for coherent logic
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
Capturing hiproofs in HOL light
CICM'13 Proceedings of the 2013 international conference on Intelligent Computer Mathematics
Hi-index | 0.00 |
We present a generic approach to readable formal proof documents, called Intelligible semi-automated reasoning (Isar). It addresses the major problem of existing interactive theorem proving systems that there is no appropriate notion of proof available that is suitable for human communication, or even just maintenance. Isar's main aspect is its formal language for natural deduction proofs, which sets out to bridge the semantic gap between internal notions of proof given by state-of-the-art interactive theorem proving systems and an appropriate level of abstraction for user-level work. The Isar language is both human readable and machine-checkable, by virtue of the Isar/VM interpreter. Compared to existing declarative theorem proving systems, Isar avoids several shortcomings: it is based on a few basic principles only, it is quite independent of the underlying logic, and supports a broad range of automated proof methods. Interactive proof development is supported as well. Most of the Isar concepts have already been implemented within Isabelle. The resulting system already accommodates simple applications.