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