The QED Manifesto after Two Decades - Version 2.0

  title={The QED Manifesto after Two Decades - Version 2.0},
  author={Ittay Weiss},
  journal={J. Softw.},
In 1994 the QED Manifesto described an ideal whereby mathematics is communicated via a computerized system in a fully formalized fashion complete with automatic proof checking and other derived tools facilitating profound improvements to the way mathematics is taught, the way new results are disseminated, and ultimately to how mathematics is practiced. Two decades later it is safe to say the dream is not yet a reality. Analyzing some of the difficulties met thus far in the realization of the… Expand


Social processes, program verification and all that
It is believed that the social nature of proof and program development is uncontroversial and ineluctable, but formal verification is not antithetical to it, and formal verification should strive not only to cope with, but to ease and enhance the collaborative, organic nature of this process, eventually helping us to master the growing complexity of scientific knowledge. Expand
A Language for Mathematical Knowledge Management
We argue that the language of Zermelo Fraenkel set theory with definitions and partial functions provides the most promising bedrock se- mantics for communicating and sharing mathematical knowledge.Expand
The QED Manifesto Revisited
An overview of the current state of formalization of mathematics is presented, and what will be needed to make the vision from the QED manifesto come true is argued. Expand
Towards a Self-Reflective, Context-Aware Semantic Representation of Mathematical Specifications
This work discusses a framework for the representation and processing of mathematics developed within and for the MoSMathproject, and introduces the semantic memory, a data structure to represent semantic information, a type system to define and assign types to data, and the semantic virtual machine (SVM), a low level, Turing-complete programming system that processes data represented in the semanticMemory. Expand
Learning-Assisted Automated Reasoning with Flyspeck
It is shown that 39 % of the 14185 theorems could be proved in a push-button mode (without any high-level advice and user interaction) in 30 seconds of real time on a fourteen-CPU workstation. Expand
Representing, Archiving, and Searching the Space of Mathematical Knowledge
There is an interesting duality between the forms and extents of mathematical knowledge that is verbally expressed and the forms that are needed to successfully extend and apply mathematics. Expand
Some considerations on the usability of interactive provers
The overall usability of interactive provers does not seem to be sensibly improved since the advent of the "second generation" of systems, in the mid of the eighties. Expand
Formal Proof
D aily, we confront the errors of computers. They crash, hang, succumb to viruses, run buggy software, and harbor spyware. Our tabloids report bizarre computer glitches: the library patron who isExpand
Collaborative Interactive Theorem Proving with Clide
Clide is introduced, a collaborative web interface for the Isabelle theorem prover that allows users to jointly edit Isabelle proof scripts over the web; editing operations are synchronised in real-time to all users. Expand
Using L A T E X as a Semantic Markup Format
This work evaluates the sTEX macro collection on a large case study: the course materials of a two-semester course in Computer Science was annotated se- mantically and converted to the OMDoc MKM format by Bruce Miller's LaTeXML system. Expand