WikiCreole:: a common wiki markup
Proceedings of the 2007 international symposium on Wikis
Cooperative Repositories for Formal Proofs
Calculemus '07 / MKM '07 Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference
The Four Colour Theorem: Engineering of a Formal Proof
Computer Mathematics
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Proviola: a tool for proof re-animation
AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Large formal wikis: issues and solutions
MKM'11 Proceedings of the 18th Calculemus and 10th international conference on Intelligent computer mathematics
The Seventeen Provers of the World
Point-and-write: documenting formal mathematics by reference
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
Engineering mathematics: the odd order theorem proof
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Dense Sphere Packings: A Blueprint for Formal Proofs
Dense Sphere Packings: A Blueprint for Formal Proofs
Hi-index | 0.00 |
We introduce a platform for presenting and cross-linking formal and informal proof developments together. The platform supports writing natural language 'narratives' that include islands of formal text. The formal text contains hyperlinks and gives on-demand state information at every proof step. We argue that such a system significantly lowers the threshold for understanding formal development and facilitates collaboration on informal and formal parts of large developments. As an example, we show the Flyspeck formal development (in HOL Light) and the Flyspeck informal mathematical text as a narrative linked to the formal development. To make this possible, we use the Agora system, a MathWiki platform developed at Nijmegen which has so far mainly been used with the Coq theorem prover: we show that the system itself is generic and easily adapted to the HOL Light case.