src/Sequents/modal.ML
author wenzelm
Sat, 07 Apr 2012 16:41:59 +0200
changeset 47389 e8552cba702d
parent 41449 7339f0e7c513
child 54742 7a86358a3c0b
permissions -rw-r--r--
explicit checks stable_finished_theory/stable_command allow parallel asynchronous command transactions; tuned;
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
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
     3
    Copyright   1992  University of Cambridge
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
     4
29269
5c25a2012975 moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents: 24584
diff changeset
     5
Simple modal reasoner.
7096
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
     6
*)
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
signature MODAL_PROVER_RULE =
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
     9
sig
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    10
    val rewrite_rls      : thm list
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    11
    val safe_rls         : thm list
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    12
    val unsafe_rls       : thm list
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    13
    val bound_rls        : thm list
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    14
    val aside_rls        : thm list
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    15
end;
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    16
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    17
signature MODAL_PROVER = 
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    18
sig
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    19
    val rule_tac   : thm list -> int ->tactic
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    20
    val step_tac   : int -> tactic
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    21
    val solven_tac : int -> int -> tactic
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    22
    val solve_tac  : int -> tactic
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    23
end;
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    24
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    25
functor Modal_ProverFun (Modal_Rule: MODAL_PROVER_RULE) : MODAL_PROVER = 
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    26
struct
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    27
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    28
(*Returns the list of all formulas in the sequent*)
38500
d5477ee35820 more antiquotations
haftmann
parents: 32960
diff changeset
    29
fun forms_of_seq (Const(@{const_name SeqO'},_) $ P $ u) = P :: forms_of_seq u
7096
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    30
  | forms_of_seq (H $ u) = forms_of_seq u
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    31
  | forms_of_seq _ = [];
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    32
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    33
(*Tests whether two sequences (left or right sides) could be resolved.
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    34
  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
    35
  Assumes each formula in seqc is surrounded by sequence variables
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    36
  -- checks that each concl formula looks like some subgoal formula.*)
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    37
fun could_res (seqp,seqc) =
29269
5c25a2012975 moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents: 24584
diff changeset
    38
      forall (fn Qc => exists (fn Qp => Term.could_unify (Qp,Qc)) 
7096
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    39
                              (forms_of_seq seqp))
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    40
             (forms_of_seq seqc);
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    41
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    42
(*Tests whether two sequents G|-H could be resolved, comparing each side.*)
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    43
fun could_resolve_seq (prem,conc) =
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    44
  case (prem,conc) of
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    45
      (_ $ Abs(_,_,leftp) $ Abs(_,_,rightp),
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    46
       _ $ Abs(_,_,leftc) $ Abs(_,_,rightc)) =>
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    47
          could_res (leftp,leftc)  andalso  could_res (rightp,rightc)
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    48
    | _ => false;
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    49
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    50
(*Like filt_resolve_tac, using could_resolve_seq
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    51
  Much faster than resolve_tac when there are many rules.
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    52
  Resolve subgoal i using the rules, unless more than maxr are compatible. *)
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    53
fun filseq_resolve_tac rules maxr = SUBGOAL(fn (prem,i) =>
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    54
  let val rls = filter_thms could_resolve_seq (maxr+1, prem, rules)
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    55
  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
    56
  end);
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    57
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    58
fun fresolve_tac rls n = filseq_resolve_tac rls 999 n;
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    59
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    60
(* NB No back tracking possible with aside rules *)
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    61
41449
7339f0e7c513 do not open ML structures;
wenzelm
parents: 38500
diff changeset
    62
fun aside_tac n = DETERM(REPEAT (filt_resolve_tac Modal_Rule.aside_rls 999 n));
7096
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    63
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
    64
41449
7339f0e7c513 do not open ML structures;
wenzelm
parents: 38500
diff changeset
    65
val fres_safe_tac = fresolve_tac Modal_Rule.safe_rls;
7339f0e7c513 do not open ML structures;
wenzelm
parents: 38500
diff changeset
    66
val fres_unsafe_tac = fresolve_tac Modal_Rule.unsafe_rls THEN' aside_tac;
7339f0e7c513 do not open ML structures;
wenzelm
parents: 38500
diff changeset
    67
val fres_bound_tac = fresolve_tac Modal_Rule.bound_rls;
7096
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
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
    70
                                    else tf(i) THEN tac(i-1)
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    71
                    in fn st => tac (nprems_of st) st end;
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
(* Depth first search bounded by d *)
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    74
fun solven_tac d n state = state |>
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    75
       (if d<0 then no_tac
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    76
        else if (nprems_of state = 0) then all_tac 
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    77
        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
    78
                 ((fres_unsafe_tac n  THEN UPTOGOAL n (solven_tac d)) APPEND
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    79
                   (fres_bound_tac n  THEN UPTOGOAL n (solven_tac (d-1)))));
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    80
41449
7339f0e7c513 do not open ML structures;
wenzelm
parents: 38500
diff changeset
    81
fun solve_tac d = rewrite_goals_tac Modal_Rule.rewrite_rls THEN solven_tac d 1;
7096
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    82
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    83
fun step_tac n = 
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    84
    COND (has_fewer_prems 1) all_tac 
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    85
         (DETERM(fres_safe_tac n) ORELSE 
32960
69916a850301 eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents: 29269
diff changeset
    86
          (fres_unsafe_tac n APPEND fres_bound_tac n));
7096
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    87
8c9278991d9c split off modal.ML from provers.ML
paulson
parents:
diff changeset
    88
end;