We describe a prototype theorem prover, U·(TP)2, developed to match the style of hand-written proof work in the Unifying Theories of Programming semantical framework. This is based on alphabetised predicates in a 2nd-order logic, with a strong emphasis on equational reasoning. We present here an overview of the user-interface of this prover, which was developed from the outset using a point-and-click approach. We contrast this with the command-line paradigm that continues to dominate the mainstream theorem provers, and raises the question: can we have the best of both worlds?
AbstractIn this paper, we present the results of an ongoing effort in building user interfaces for p...
peer-reviewedSaoithin is a theorem prover developed to support the Unifying Theories of Programming ...
An automated theorem-proving system called TPS for proving theorems of first or higher-order logic i...
Saoith?n is a theorem prover developed to support the Unifying Theories of Programming (UTP) framewo...
One of the main reasons why computer generated proofs are not widely accepted is often their complex...
Language Since logic programming systems directly implement search and unification and since these o...
peer-reviewedU (TP)2 is a theorem prover developed to support the Unifying Theories of Programming ...
. We report on the integration of Tps as an external reasoning component into the mathematical assis...
Abstract. Saoith́ın is a theorem prover developed to support the Uni-fying Theories of Programming (...
Since logic programming systems directly implement search and unification and since these operations...
Logic programming languages have many characteristics that indicate that they should serve as good i...
The Thousands of Problems for Theorem Provers (TPTP) problem library is the basis of a well known an...
One of the main success stories of automatic theorem provers has been their integration into proof a...
Twee is an automated theorem prover for equational logic. It implements unfailing Knuth-Bendix compl...
We argue that a logic programming language with a higher-order intuitionistic logic as its foundatio...
AbstractIn this paper, we present the results of an ongoing effort in building user interfaces for p...
peer-reviewedSaoithin is a theorem prover developed to support the Unifying Theories of Programming ...
An automated theorem-proving system called TPS for proving theorems of first or higher-order logic i...
Saoith?n is a theorem prover developed to support the Unifying Theories of Programming (UTP) framewo...
One of the main reasons why computer generated proofs are not widely accepted is often their complex...
Language Since logic programming systems directly implement search and unification and since these o...
peer-reviewedU (TP)2 is a theorem prover developed to support the Unifying Theories of Programming ...
. We report on the integration of Tps as an external reasoning component into the mathematical assis...
Abstract. Saoith́ın is a theorem prover developed to support the Uni-fying Theories of Programming (...
Since logic programming systems directly implement search and unification and since these operations...
Logic programming languages have many characteristics that indicate that they should serve as good i...
The Thousands of Problems for Theorem Provers (TPTP) problem library is the basis of a well known an...
One of the main success stories of automatic theorem provers has been their integration into proof a...
Twee is an automated theorem prover for equational logic. It implements unfailing Knuth-Bendix compl...
We argue that a logic programming language with a higher-order intuitionistic logic as its foundatio...
AbstractIn this paper, we present the results of an ongoing effort in building user interfaces for p...
peer-reviewedSaoithin is a theorem prover developed to support the Unifying Theories of Programming ...
An automated theorem-proving system called TPS for proving theorems of first or higher-order logic i...