68 search results - page 1 / 14 » Three Tactic Theorem Proving |
TPHOL
1999
IEEE
13 years 10 months ago
1999
IEEE
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...
TPHOL
2000
IEEE
13 years 10 months ago
2000
IEEE
Theorem provers for higher-order logics often use tactics to implement automated proof search. Tactics use a general-purpose metalanguage to implement both general-purpose reasonin...
TPHOL
2002
IEEE
13 years 10 months ago
2002
IEEE
g Higher Order Abstract Syntax with Tactical Theorem Proving and (Co)Induction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 ...
MICS
2010
13 years 4 months ago
2010
Abstract. There is something of a discontinuity at the heart of popular tactical theorem provers. Low-level, fully-checked mechanical proofs are large trees consisting of primitive...
DM
2000
13 years 5 months ago
2000
We will prove a d-dimensional version of the Geelen and Simpson theorem. c 2000 Elsevier Science B.V. All rights reserved.