Implementing mathematics with the Nuprl proof development system
Implementing mathematics with the Nuprl proof development system
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
Interactive theorem proving: an empirical study of user activity
Journal of Symbolic Computation - Special issue graphical user interfaces and protocols
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
A New Interface for HOL - Ideas, Issues and Implementation
Proceedings of the 8th International Workshop on Higher Order Logic Theorem Proving and Its Applications
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Computer Aided Systems Theory - EUROCAST 2001-Revised Papers
Comparing Mathematical Provers
MKM '03 Proceedings of the Second International Conference on Mathematical Knowledge Management
The Mathematica Book
Interactive Theorem Proving and Program Development
Interactive Theorem Proving and Program Development
Thoughts on Requirements and Design Issues of User Interfaces for Proof Assistants
Electronic Notes in Theoretical Computer Science (ENTCS)
A new symbolic method for solving linear two-point boundary value problems on the level of operators
Journal of Symbolic Computation
Mathscape and molecular integrals
Journal of Symbolic Computation
Hi-index | 0.00 |
We describe an environment that allows the users of the Theorema system to flexibly control aspects of computer-supported proof development. The environment supports the display and manipulation of proof trees and proof situations, logs the user activities (commands communicated with the system during the proving session), and presents (also unfinished) proofs in a human-oriented style. In particular, the user can navigate through the proof object, expand/remove proof branches, provide witness terms, develop several proofs concurrently, proceed step by step or automatically and so on. The environment enhances the effectiveness and flexibility of the reasoners of the Theorema system.