# A Generic Approach to Building User Interfaces for Theorem Provers

@article{Bertot1998AGA, title={A Generic Approach to Building User Interfaces for Theorem Provers}, author={Yves Bertot and Laurent Th{\'e}ry}, journal={J. Symb. Comput.}, year={1998}, volume={25}, pages={161-194} }

In this paper, we present the results of an ongoing effort in building user interfaces for proof systems. Our approach is generic: we are not constructing a user interface for a particular proof system, rather we have developed techniques and tools that have been applied to several proof systems. We first propose and motivate a distributed architecture, where the proof system and the interface are two separate processes communicating through a protocol. Then we describe three high-level…

## 61 Citations

Proof General meets IsaWin: Combining Text-Based And Graphical User Interfaces

- Computer ScienceElectron. Notes Theor. Comput. Sci.
- 2004

Explorer Proof General meets IsaWin : Combining Text-Based And Graphical User Interfaces

- Computer Science
- 2004

The design and prototype implementation of a combination of theorem prover interface technologies that will provide a powerful, robust and generic environment for developing proofs within interactive proof assistants that also opens the way for studying and implementing new mechanisms for managing interactive proof development.

Explorer Proof General meets IsaWin : Combining Text-Based And Graphical User Interfaces

- Computer Science
- 2004

The design and prototype implementation of a combination of theorem prover interface technologies that will provide a powerful, robust and generic environment for developing proofs within interactive proof assistants that also opens the way for studying and implementing new mechanisms for managing interactive proof development.

Functional Design and Implementation of Graphical User Interfaces for Theorem Provers

- Computer ScienceJ. Funct. Program.
- 1999

This paper attempts to develop a metaphor suited to visualize the LCF-style prover design, and a methodology for the implementation of graphical user interfaces for these provers and encapsulations of formal methods.

Managing Proof Documents for Asynchronous Processing

- Computer ScienceElectron. Notes Theor. Comput. Sci.
- 2009

Proof General: A Generic Tool for Proof Development

- Computer ScienceTACAS
- 2000

This note describes Proof General, a tool for developing machine proofs with an interactive proof assistant that provides a powerful user-interface with relatively little effort, alleviating the need for a proof assistant to provide its own GUI, and providing a uniform appearance for diverse proof assistants.

Proof general in Eclipse: system and architecture overview

- Computer ScienceETX
- 2006

An overview of the Eclipse plugin and its underlying architecture is given, which brings the features of a industrial-strength IDE to theorem proving for the first time.

Proof General / Eclipse: A Generic Interface for Interactive Proof

- Computer ScienceIJCAI
- 2005

PG/Eclipse is introduced; a sophisticated new interface for interactive theorem provers, offering users a rich set of proof development tools, based upon two complementary frameworks, to define a clear separation between provers and interfaces, and to translate programming development tools to a theorem proving environment.

A Graphical User Interface Framework for Formal Verification

- Computer ScienceITP
- 2021

The ProofWidgets framework uses web technology and functional reactive programming, as well as metaprogramming features of advanced interactive theorem proving (ITP) systems to allow users to create arbitrary interactive UIs for representing the goal state.

An Architecture for Extensible Click ’ n Prove Interfaces

- Computer Science, Mathematics
- 2007

We present a novel software architecture for graphical interfaces to interactive theorem provers. It provides click’n prove functionality at the interface level without requiring support from the…

## References

SHOWING 1-10 OF 54 REFERENCES

Proof by Pointing

- Computer ScienceTACS
- 1994

This principle provides a natural and effective use of the mouse in the user-interface of computer proof assistants and annotates the inference rules to specify an algorithm that associates the construction of a proof tree to a location within a goal sequent.

Notational Definition and Top-Down Refinement for Interactive Proof Development Systems

- Computer Science
- 1988

The second part of the thesis presents a logic-independent framework for top-down proof development called abstract refinement, where tactics are viewed as the basic notion from which refinement trees arise as tree-structured representation of the iterated composition of tactics.

A New Interface for HOL - Ideas, Issues and Implementation

- Computer ScienceTPHOLs
- 1995

The topics considered in this paper are: the motivations for a new interface for HOL; the design objectives and usability targets for TkHolWorkbench; a description of the Tk HolWorkbench tools as they now stand; and the extensible design architecture used in the implementation.

Proof Explanation and Revision

- Computer Science
- 1987

The design of the X-proof system is presented, which is capable of making substantial changes in the presentation of proofs: proofs can be revised or restructuring in order to present their deductions in different styles.

A distributed architecture for programming environments

- Computer ScienceSDE
- 1990

This paper presents a proposal for a distributed architecture for programming environments, and outlines its implications in terms of size, reusability, and maintainability.

A formal approach to undo operations in programming languages

- Computer ScienceTOPL
- 1986

The main conclusion is that the notions of recovery and reversal of actions can become part of the programming process.

The implementation of ALF : a proof editor based on Martin-Löf's monomorphic type theory with explicit substitution

- Computer Science
- 1994

A modular type/proof checking algorithm for complete proof objects is presented, and it is proved sound and complete assuming some basic meta theory properties of the substitution calculus and the proof editing facilities are proved to construct valid proofs.

Real theorem provers deserve real user-interfaces

- Computer ScienceSDE 5
- 1992

This paper explains how to add a modern user interface to existing theorem provers, using principles and tools designed for programming environments.

Real theorem provers deserve real user-interfaces

- Computer ScienceSDE
- 1992

This paper explains how to add a modern user interface to existing theorem provers, using principles and tools designed for programming environments.

Centaur: the system

- Computer ScienceSDE 3
- 1988

This paper describes the organization of the CENTAUR system and its main components, which are a database component that provides standardized representation and access to formal objects and their persistent storage; a logical engine that is used to execute formal specifications; an object-oriented man-machine interface that gives easy access to the system's functions.