The Computer Journal
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
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
TAS - A Generic Window Inference System
TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
Functional design and implementation of graphical user interfaces for theorem provers
Journal of Functional Programming
A Refinement of de Bruijn's Formal Language of Mathematics
Journal of Logic, Language and Information
Electronic Notes in Theoretical Computer Science (ENTCS)
Proof general in Eclipse: system and architecture overview
eclipse '06 Proceedings of the 2006 OOPSLA workshop on eclipse technology eXchange
PlatΩ: A Mediator between Text-Editors and Proof Assistance Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
A Framework for Interactive Proof
Calculemus '07 / MKM '07 Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference
Managing Proof Documents for Asynchronous Processing
Electronic Notes in Theoretical Computer Science (ENTCS)
Crystal: Integrating Structured Queries into a Tactic Language
Journal of Automated Reasoning
Cost-effective integration of MKM semantic services into editing environments
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
Engineering the Prover Interface
Electronic Notes in Theoretical Computer Science (ENTCS)
Narrating Formal Proof (Work in Progress)
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
Recently, significant advances have been made in formalised mathematical texts for large, demanding proofs. But although such large developments are possible, they still take an inordinate amount of effort and time, and there is a significant gap between the resulting formalised machine-checkable proof scripts and the corresponding human-readable mathematical texts. We present an authoring system for formal proof which addresses these concerns. It is based on a central document format which, in the tradition of literate programming, allows one to extract either a formal proof script or a human-readable document; the two may have differing structure and detail levels, but are developed together in a synchronised way. Additionally, we introduce ways to assist production of the central document, by allowing tools to contribute backflow to update and extend it. Our authoring system builds on the new PG Kit architecture for Proof General, bringing the extra advantage that it works in a uniform interface, generically across various interactive theorem provers.