src/Sequents/modal.ML
author paulson
Fri, 05 Oct 2007 09:59:03 +0200
changeset 24854 0ebcd575d3c6
parent 24584 01e83ffa6c54
child 29269 5c25a2012975
permissions -rw-r--r--
filtering out some package theorems
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
24584
01e83ffa6c54 fixed title
haftmann
parents: 7096
diff changeset
     1
(*  Title:      Sequents/modal.ML
7096
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
     2
    ID:         $Id$
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
     3
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
     4
    Copyright   1992  University of Cambridge
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
     5
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
     6
Simple modal reasoner
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
     7
*)
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
     8
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
     9
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    10
signature MODAL_PROVER_RULE =
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    11
sig
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    12
    val rewrite_rls      : thm list
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    13
    val safe_rls         : thm list
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    14
    val unsafe_rls       : thm list
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    15
    val bound_rls        : thm list
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    16
    val aside_rls        : thm list
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    17
end;
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    18
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    19
signature MODAL_PROVER = 
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    20
sig
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    21
    val rule_tac   : thm list -> int ->tactic
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    22
    val step_tac   : int -> tactic
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    23
    val solven_tac : int -> int -> tactic
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    24
    val solve_tac  : int -> tactic
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    25
end;
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    26
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    27
functor Modal_ProverFun (Modal_Rule: MODAL_PROVER_RULE) : MODAL_PROVER = 
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    28
struct
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    29
local open Modal_Rule
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    30
in 
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    31
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    32
(*Returns the list of all formulas in the sequent*)
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    33
fun forms_of_seq (Const("SeqO",_) $ P $ u) = P :: forms_of_seq u
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    34
  | forms_of_seq (H $ u) = forms_of_seq u
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    35
  | forms_of_seq _ = [];
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    36
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    37
(*Tests whether two sequences (left or right sides) could be resolved.
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    38
  seqp is a premise (subgoal), seqc is a conclusion of an object-rule.
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    39
  Assumes each formula in seqc is surrounded by sequence variables
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    40
  -- checks that each concl formula looks like some subgoal formula.*)
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    41
fun could_res (seqp,seqc) =
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    42
      forall (fn Qc => exists (fn Qp => could_unify (Qp,Qc)) 
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    43
                              (forms_of_seq seqp))
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    44
             (forms_of_seq seqc);
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    45
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    46
(*Tests whether two sequents G|-H could be resolved, comparing each side.*)
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    47
fun could_resolve_seq (prem,conc) =
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    48
  case (prem,conc) of
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    49
      (_ $ Abs(_,_,leftp) $ Abs(_,_,rightp),
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    50
       _ $ Abs(_,_,leftc) $ Abs(_,_,rightc)) =>
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    51
          could_res (leftp,leftc)  andalso  could_res (rightp,rightc)
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    52
    | _ => false;
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    53
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    54
(*Like filt_resolve_tac, using could_resolve_seq
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    55
  Much faster than resolve_tac when there are many rules.
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    56
  Resolve subgoal i using the rules, unless more than maxr are compatible. *)
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    57
fun filseq_resolve_tac rules maxr = SUBGOAL(fn (prem,i) =>
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    58
  let val rls = filter_thms could_resolve_seq (maxr+1, prem, rules)
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    59
  in  if length rls > maxr  then  no_tac  else resolve_tac rls i
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    60
  end);
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    61
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    62
fun fresolve_tac rls n = filseq_resolve_tac rls 999 n;
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    63
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    64
(* NB No back tracking possible with aside rules *)
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    65
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    66
fun aside_tac n = DETERM(REPEAT (filt_resolve_tac aside_rls 999 n));
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    67
fun rule_tac rls n = fresolve_tac rls n THEN aside_tac n;
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    68
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    69
val fres_safe_tac = fresolve_tac safe_rls;
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    70
val fres_unsafe_tac = fresolve_tac unsafe_rls THEN' aside_tac;
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    71
val fres_bound_tac = fresolve_tac bound_rls;
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    72
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    73
fun UPTOGOAL n tf = let fun tac i = if i<n then all_tac
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    74
                                    else tf(i) THEN tac(i-1)
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    75
                    in fn st => tac (nprems_of st) st end;
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    76
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    77
(* Depth first search bounded by d *)
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    78
fun solven_tac d n state = state |>
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    79
       (if d<0 then no_tac
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    80
        else if (nprems_of state = 0) then all_tac 
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    81
        else (DETERM(fres_safe_tac n) THEN UPTOGOAL n (solven_tac d)) ORELSE
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    82
                 ((fres_unsafe_tac n  THEN UPTOGOAL n (solven_tac d)) APPEND
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    83
                   (fres_bound_tac n  THEN UPTOGOAL n (solven_tac (d-1)))));
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    84
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    85
fun solve_tac d = rewrite_goals_tac rewrite_rls THEN solven_tac d 1;
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    86
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    87
fun step_tac n = 
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    88
    COND (has_fewer_prems 1) all_tac 
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    89
         (DETERM(fres_safe_tac n) ORELSE 
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    90
	  (fres_unsafe_tac n APPEND fres_bound_tac n));
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    91
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    92
end;
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    93
end;