Some considerations on the usability of interactive provers

@inproceedings{Asperti2010SomeCO,
  title={Some considerations on the usability of interactive provers},
  author={A. Asperti and C. Coen},
  booktitle={AISC'10/MKM'10/Calculemus'10},
  year={2010}
}
In spite of the remarkable achievements recently obtained in the field of mechanization of formal reasoning, 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. We try to analyze the reasons of such a slow progress, pointing out the main problems and suggesting some possible research directions. 

Figures and Topics from this paper

Development and user testing of new user interfaces for mathematics and programming tools
TLDR
Several novel user interface ideas for interactive theorem provers are presented, generalizable to other mathematics and programming tools, and developed and tested in an experiment with human participants. Expand
Proof, Message and Certificate
TLDR
It is claimed that it is important to prevent the divorce between these two epistemological functions, discussing the implications for the field of mathematical knowledge management. Expand
VeriML: A Dependently-Typed, User-Extensible and Language-Centric Approach to Proof Assistants
TLDR
A novel programming language called VeriML is designed, which combines the benefits of the different extension languages used in current proof assistants while eschewing their limitations, and retains at the level of types information about the proofs manipulated inside automation procedures. Expand
A formalization of multi-tape Turing machines
TLDR
The work is meant to be a preliminary step towards the creation of a formal repository in Complexity Theory, and is a small piece in the long-term Reverse Complexity program, aiming to a comfortable, machine independent axiomatization of the field. Expand
Formalizing Turing Machines
We discuss the formalization, in the Matita Theorem Prover, of a few, basic results on Turing Machines, up to the existence of a (certified) Universal Machine. The work is meant to be a preliminaryExpand
Automating Automated Reasoning - The Case of Two Generic Automated Reasoning Tools
TLDR
The performance of the tools is evaluated, the results of a preliminary empirical study where user experiences of expert logicians using the two tools are compared are compared, and criteria relevant for comparing their performance and usability are examined. Expand
The QED manifesto — Version 2.0
  • Ittay Weiss
  • Computer Science
  • Asia-Pacific World Congress on Computer Science and Engineering
  • 2014
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 toolsExpand
The QED Manifesto after Two Decades - Version 2.0
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 toolsExpand
Basic first-order model theory in Mizar
TLDR
Goedel's completeness and Lowenheim-Skolem theorems have also been formalized for the countable case, to offer a first application of it and to showcase its utility. Expand
Ontologies and languages for representing mathematical knowledge on the Semantic Web
  • C. Lange
  • Computer Science
  • Semantic Web
  • 2013
TLDR
It is shown that MathML and OpenMath, the standard XML-based exchange languages for mathematical knowledge, can be fully integrated with RDF representations in order to contribute existing mathematical knowledge to the Web of Data. Expand
...
1
2
...

References

SHOWING 1-10 OF 32 REFERENCES
Smart matching
TLDR
The paper describes the superpositionbased implementation of this feature inside the Matita interactive theorem prover, focusing in particular on the so called smart application tactic, supporting smart matching between a goal and a given result. Expand
Social processes, program verification and all that
TLDR
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
Twenty Years of Theorem Proving for HOLs Past, Present and Future
TLDR
The emphasis here is on user guided proof assistants, but future developments in automatic higher order proof methods are likely to be incorporated into these as the automatic methods available today are mainly propositional or first order. Expand
A Short Survey of Automated Reasoning
This paper surveys the field of automated reasoning, giving some historical background and outlining a few of the main current research themes. We particularly emphasize the points of contact and theExpand
From LCF to HOL: a short history
  • M. Gordon
  • Computer Science
  • Proof, Language, and Interaction
  • 2000
TLDR
The original LCF system was a proof-checking program developed at Stanford University by Robin Milner in 1972, and one of the descendents is HOL, a proof assistant for higher order logic originally developed for reasoning about hardware. Expand
Proof assistants: History, ideas and future
TLDR
This paper is also a position paper that pushes the further use of proof assistants, believing that these systems will become the future of mathematics, where definitions, statements, computations and proofs are all available in a computerized form. Expand
A New Implementation of Automath
  • F. Wiedijk
  • Computer Science
  • Journal of Automated Reasoning
  • 2004
TLDR
This program was written to restore a damaged version of Jutting's translation of Landau's Grundlagen, and is a straightforward re-implementation of the Zandleven Automath checker from the seventies. Expand
Formalising Java's Data Race Free Guarantee
TLDR
The data race free (DRF) guarantee provided by Java, as captured by the semi-formal Java Memory Model (JMM), is formalised and found that not all of the anticipated conditions in the JMM definition were actually necessary for the DRF guarantee. Expand
Proof, language, and interaction: essays in honour of Robin Milner
This collection of original essays reflects the breadth of current research in computer science. Robin Milner, a major figure in the field, has made many fundamental contributions, particularly inExpand
About the Formalization of Some Results by Chebyshev in Number Theory
We discuss the formalization, in the Matita Interactive Theorem Prover, of a famous result by Chebyshev concerning the distribution of prime numbers, essentially subsuming, as a corollary, Bertrand'sExpand
...
1
2
3
4
...