- Serge Autexier, Christoph Benzmüller, Dominik Dietrich, Andreas
Meier, Claus-Peter Wirth
- A Generic Modular Data Structure for Proof Attempts Alternating
on Ideas and Granularity
- Mathematical Knowledge Management: 4th International Conference, MKM 2005,
Bremen, Germany, July 15-17, 2005, Revised Selected Papers,
LNAI 3863, pp. 126-142, Springer, 2006, ISBN 354031430X.
- Copyright Owner
A practically useful mathematical assistant system requires the
sophisticated combination of interaction and automation. Central in
such a system is the proof data structure, which has to maintain the
current proof state and which has to allow the flexible interplay of
various components including the human user. We describe a
parameterized proof data structure for the management of proofs,
which includes our experience with the development of two proof
assistants. It supports and bridges the gap between
abstract level proof explanation and low-level proof verification.
The proof data structure enables, in particular, the flexible
handling of lemmas, the maintenance of different proof alternatives,
and the representation of different granularities of proof attempts.
- No review yet
- Full paper
- .2 Mbytes
- .1 Mbytes
- The fonts of the following pdf version differ from the original,
some originally identical fonts are different in this version,
but the whole file can be searched!
- .2 Mbytes