The practical utility of interactive, user-guided, theorem proving depends on the design of good interaction environments, the study of which should be grounded in methods of research into human–computer interaction (HCI). This paper discusses the relevance of classifications of programming errors developed by the HCI community to the problem of interactive theorem prov-ing. A new taxonomy of errors is proposed for interaction with theorem provers and its adequacy as
The automation of first order logic has received comparatively little attention from researcher inte...
A first step in systematically engineering better interfaces for theorem proving assistants (TPAs) i...
Abstract. Interactive Theorem Provers have a long tradition, going back to the 1970s when interactio...
AbstractIn this paper the interaction between users and the interactive theorem prover HOL is invest...
Interactive theorem provers are software tools that help users create machine-checked proofs. Althou...
none2In spite of the remarkable achievements recently obtained in the field of mechanization of form...
Often user interfaces of theorem proving systems focus on assisting particularly trained and skilled...
Abstract: This note considers the design of user interfaces for interactive theorem provers. The bas...
This paper describes the use of an automated theorem prover to analyse properties of interactive beh...
AbstractIn this paper the interaction between users and the interactive theorem prover HOL is invest...
Theorem provers have highly complex interfaces, but there are not many systematic studies of their...
AbstractA technique for finding errors in computer programs is to translate a given program and its ...
Interactive theorem proving is the modern way of formalizing mathematics using a computer as a proof...
In recent years the effectiveness of interactive theorem provers has increased to an extent that the...
Automatic program verification is a computationally intense task. When a verifier declares a program...
The automation of first order logic has received comparatively little attention from researcher inte...
A first step in systematically engineering better interfaces for theorem proving assistants (TPAs) i...
Abstract. Interactive Theorem Provers have a long tradition, going back to the 1970s when interactio...
AbstractIn this paper the interaction between users and the interactive theorem prover HOL is invest...
Interactive theorem provers are software tools that help users create machine-checked proofs. Althou...
none2In spite of the remarkable achievements recently obtained in the field of mechanization of form...
Often user interfaces of theorem proving systems focus on assisting particularly trained and skilled...
Abstract: This note considers the design of user interfaces for interactive theorem provers. The bas...
This paper describes the use of an automated theorem prover to analyse properties of interactive beh...
AbstractIn this paper the interaction between users and the interactive theorem prover HOL is invest...
Theorem provers have highly complex interfaces, but there are not many systematic studies of their...
AbstractA technique for finding errors in computer programs is to translate a given program and its ...
Interactive theorem proving is the modern way of formalizing mathematics using a computer as a proof...
In recent years the effectiveness of interactive theorem provers has increased to an extent that the...
Automatic program verification is a computationally intense task. When a verifier declares a program...
The automation of first order logic has received comparatively little attention from researcher inte...
A first step in systematically engineering better interfaces for theorem proving assistants (TPAs) i...
Abstract. Interactive Theorem Provers have a long tradition, going back to the 1970s when interactio...