A generic modular data structure for proof attempts alternating on ideas and granularity

Abstract

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. © Springer-Verlag Berlin Heidelberg 2006.