src/FOL/intprover.ML
author paulson
Mon, 10 Feb 1997 12:31:54 +0100
changeset 2601 b301958c465d
parent 2572 8a47f85e7a03
child 4440 9ed4098074bc
permissions -rw-r--r--
Renamed structure Int (intuitionistic prover) to IntPr to prevent clash with Basis Library structure Int
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
1459
d12da312eff4 expanded tabs
clasohm
parents: 1005
diff changeset
     1
(*  Title:      FOL/int-prover
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     2
    ID:         $Id$
1459
d12da312eff4 expanded tabs
clasohm
parents: 1005
diff changeset
     3
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     4
    Copyright   1992  University of Cambridge
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     5
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     6
A naive prover for intuitionistic logic
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     7
2601
b301958c465d Renamed structure Int (intuitionistic prover) to IntPr to prevent clash
paulson
parents: 2572
diff changeset
     8
BEWARE OF NAME CLASHES WITH CLASSICAL TACTICS -- use IntPr.fast_tac ...
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     9
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    10
Completeness (for propositional logic) is proved in 
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    11
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    12
Roy Dyckhoff.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    13
Contraction-Free Sequent Calculi for Intuitionistic Logic.
1005
65188e520024 Updated comments.
lcp
parents: 702
diff changeset
    14
J. Symbolic Logic  57(3), 1992, pages 795-807.
65188e520024 Updated comments.
lcp
parents: 702
diff changeset
    15
65188e520024 Updated comments.
lcp
parents: 702
diff changeset
    16
The approach was developed independently by Roy Dyckhoff and L C Paulson.
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    17
*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    18
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    19
signature INT_PROVER = 
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    20
  sig
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    21
  val best_tac: int -> tactic
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    22
  val fast_tac: int -> tactic
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    23
  val inst_step_tac: int -> tactic
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    24
  val safe_step_tac: int -> tactic
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    25
  val safe_brls: (bool * thm) list
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    26
  val safe_tac: tactic
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    27
  val step_tac: int -> tactic
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    28
  val haz_brls: (bool * thm) list
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    29
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    30
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    31
2601
b301958c465d Renamed structure Int (intuitionistic prover) to IntPr to prevent clash
paulson
parents: 2572
diff changeset
    32
structure IntPr : INT_PROVER   = 
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    33
struct
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    34
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    35
(*Negation is treated as a primitive symbol, with rules notI (introduction),
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    36
  not_to_imp (converts the assumption ~P to P-->False), and not_impE
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    37
  (handles double negations).  Could instead rewrite by not_def as the first
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    38
  step of an intuitionistic proof.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    39
*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    40
val safe_brls = sort lessb 
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    41
    [ (true,FalseE), (false,TrueI), (false,refl),
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    42
      (false,impI), (false,notI), (false,allI),
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    43
      (true,conjE), (true,exE),
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    44
      (false,conjI), (true,conj_impE),
2572
8a47f85e7a03 ex_impE was incorrectly listed as Safe
paulson
parents: 1459
diff changeset
    45
      (true,disj_impE), (true,disjE), 
8a47f85e7a03 ex_impE was incorrectly listed as Safe
paulson
parents: 1459
diff changeset
    46
      (false,iffI), (true,iffE), (true,not_to_imp) ];
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    47
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    48
val haz_brls =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    49
    [ (false,disjI1), (false,disjI2), (false,exI), 
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    50
      (true,allE), (true,not_impE), (true,imp_impE), (true,iff_impE),
2572
8a47f85e7a03 ex_impE was incorrectly listed as Safe
paulson
parents: 1459
diff changeset
    51
      (true,all_impE), (true,ex_impE), (true,impE) ];
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    52
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    53
(*0 subgoals vs 1 or more: the p in safep is for positive*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    54
val (safe0_brls, safep_brls) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    55
    partition (apl(0,op=) o subgoals_of_brl) safe_brls;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    56
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    57
(*Attack subgoals using safe inferences -- matching, not resolution*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    58
val safe_step_tac = FIRST' [eq_assume_tac,
1459
d12da312eff4 expanded tabs
clasohm
parents: 1005
diff changeset
    59
                            eq_mp_tac,
d12da312eff4 expanded tabs
clasohm
parents: 1005
diff changeset
    60
                            bimatch_tac safe0_brls,
d12da312eff4 expanded tabs
clasohm
parents: 1005
diff changeset
    61
                            hyp_subst_tac,
d12da312eff4 expanded tabs
clasohm
parents: 1005
diff changeset
    62
                            bimatch_tac safep_brls] ;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    63
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    64
(*Repeatedly attack subgoals using safe inferences -- it's deterministic!*)
702
98fc1a8e832a FOL/intprover/safe_tac: now uses REPEAT_DETERM_FIRST instead of REPEAT_DETERM
lcp
parents: 0
diff changeset
    65
val safe_tac = REPEAT_DETERM_FIRST safe_step_tac;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    66
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    67
(*These steps could instantiate variables and are therefore unsafe.*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    68
val inst_step_tac =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    69
  assume_tac APPEND' mp_tac APPEND' 
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    70
  biresolve_tac (safe0_brls @ safep_brls);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    71
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    72
(*One safe or unsafe step. *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    73
fun step_tac i = FIRST [safe_tac, inst_step_tac i, biresolve_tac haz_brls i];
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    74
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    75
(*Dumb but fast*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    76
val fast_tac = SELECT_GOAL (DEPTH_SOLVE (step_tac 1));
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    77
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    78
(*Slower but smarter than fast_tac*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    79
val best_tac = 
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    80
  SELECT_GOAL (BEST_FIRST (has_fewer_prems 1, size_of_thm) (step_tac 1));
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    81
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    82
end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    83