Abstract
A well-designed proof is a hierarchically structured collection of assumptions and statements. To check the proof with almost any current theorem prover, one must first eliminate the structure and encode the assumptions and statements in the idiosynchratic logic of the prover. One must then check and debug the proof with the particular set of algorithms the prover happens to implement, using an interface that provides an extremely myopic view of the proof. Some people believe that this process can be made wonderful by providing a screen interface that displays typeset formulas and replaces some typing with mouse clicks. In this talk, I propose a more drastic change.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lamport, L. (1996). Managing proofs. In: Margaria, T., Steffen, B. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 1996. Lecture Notes in Computer Science, vol 1055. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61042-1_36
Download citation
DOI: https://doi.org/10.1007/3-540-61042-1_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61042-7
Online ISBN: 978-3-540-49874-2
eBook Packages: Springer Book Archive