src/Pure/Isar/calculation.ML
author wenzelm
Sun Jun 26 15:16:58 2005 +0200 (2005-06-26)
changeset 16571 c1f41c98fd3c
parent 16424 18a07ad8fea8
child 17350 26cd3756377a
permissions -rw-r--r--
export get_calculation;
wenzelm@6778
     1
(*  Title:      Pure/Isar/calculation.ML
wenzelm@6778
     2
    ID:         $Id$
wenzelm@6778
     3
    Author:     Markus Wenzel, TU Muenchen
wenzelm@6778
     4
wenzelm@6778
     5
Support for calculational proofs.
wenzelm@6778
     6
*)
wenzelm@6778
     7
wenzelm@6778
     8
signature CALCULATION =
wenzelm@6778
     9
sig
wenzelm@16571
    10
  val get_calculation: Proof.state -> thm list option
wenzelm@6778
    11
  val print_global_rules: theory -> unit
wenzelm@6778
    12
  val print_local_rules: Proof.context -> unit
wenzelm@6778
    13
  val trans_add_global: theory attribute
wenzelm@6778
    14
  val trans_del_global: theory attribute
wenzelm@6778
    15
  val trans_add_local: Proof.context attribute
wenzelm@6778
    16
  val trans_del_local: Proof.context attribute
wenzelm@12379
    17
  val sym_add_global: theory attribute
wenzelm@12379
    18
  val sym_del_global: theory attribute
wenzelm@12379
    19
  val sym_add_local: Proof.context attribute
wenzelm@12379
    20
  val sym_del_local: Proof.context attribute
wenzelm@12379
    21
  val symmetric_global: theory attribute
wenzelm@12379
    22
  val symmetric_local: Proof.context attribute
wenzelm@12055
    23
  val also: thm list option -> (Proof.context -> thm list -> unit)
wenzelm@12055
    24
    -> Proof.state -> Proof.state Seq.seq
wenzelm@12055
    25
  val finally: thm list option -> (Proof.context -> thm list -> unit)
wenzelm@12055
    26
    -> Proof.state -> Proof.state Seq.seq
wenzelm@12055
    27
  val moreover: (Proof.context -> thm list -> unit) -> Proof.state -> Proof.state
wenzelm@12055
    28
  val ultimately: (Proof.context -> thm list -> unit) -> Proof.state -> Proof.state
wenzelm@6778
    29
end;
wenzelm@6778
    30
wenzelm@6778
    31
structure Calculation: CALCULATION =
wenzelm@6778
    32
struct
wenzelm@6778
    33
wenzelm@6778
    34
(** global and local calculation data **)
wenzelm@6778
    35
wenzelm@16424
    36
(* global calculation *)
wenzelm@6778
    37
wenzelm@12379
    38
fun print_rules prt x (trans, sym) =
wenzelm@12379
    39
  [Pretty.big_list "transitivity rules:" (map (prt x) (NetRules.rules trans)),
wenzelm@12379
    40
    Pretty.big_list "symmetry rules:" (map (prt x) sym)]
wenzelm@12379
    41
  |> Pretty.chunks |> Pretty.writeln;
wenzelm@6778
    42
wenzelm@16424
    43
structure GlobalCalculation = TheoryDataFun
wenzelm@16424
    44
(struct
wenzelm@6778
    45
  val name = "Isar/calculation";
wenzelm@12379
    46
  type T = thm NetRules.T * thm list
wenzelm@6778
    47
wenzelm@12379
    48
  val empty = (NetRules.elim, []);
wenzelm@6778
    49
  val copy = I;
wenzelm@16424
    50
  val extend = I;
wenzelm@16424
    51
  fun merge _ ((trans1, sym1), (trans2, sym2)) =
wenzelm@12379
    52
    (NetRules.merge (trans1, trans2), Drule.merge_rules (sym1, sym2));
wenzelm@12055
    53
  val print = print_rules Display.pretty_thm_sg;
wenzelm@16424
    54
end);
wenzelm@6778
    55
wenzelm@15801
    56
val _ = Context.add_setup [GlobalCalculation.init];
wenzelm@6778
    57
val print_global_rules = GlobalCalculation.print;
wenzelm@6778
    58
wenzelm@6778
    59
wenzelm@16424
    60
(* local calculation *)
wenzelm@6778
    61
wenzelm@16424
    62
structure LocalCalculation = ProofDataFun
wenzelm@16424
    63
(struct
wenzelm@6778
    64
  val name = "Isar/calculation";
wenzelm@12379
    65
  type T = (thm NetRules.T * thm list) * (thm list * int) option;
wenzelm@6778
    66
skalberg@15531
    67
  fun init thy = (GlobalCalculation.get thy, NONE);
wenzelm@12055
    68
  fun print ctxt (rs, _) = print_rules ProofContext.pretty_thm ctxt rs;
wenzelm@16424
    69
end);
wenzelm@6778
    70
wenzelm@15801
    71
val _ = Context.add_setup [LocalCalculation.init];
wenzelm@13371
    72
val get_local_rules = #1 o LocalCalculation.get o Proof.context_of;
wenzelm@6778
    73
val print_local_rules = LocalCalculation.print;
wenzelm@6778
    74
wenzelm@6778
    75
wenzelm@6778
    76
(* access calculation *)
wenzelm@6778
    77
wenzelm@6778
    78
fun get_calculation state =
wenzelm@13371
    79
  (case #2 (LocalCalculation.get (Proof.context_of state)) of
skalberg@15531
    80
    NONE => NONE
skalberg@15531
    81
  | SOME (thms, lev) => if lev = Proof.level state then SOME thms else NONE);
wenzelm@6778
    82
wenzelm@7414
    83
fun put_calculation thms state =
wenzelm@13371
    84
  Proof.map_context
skalberg@15531
    85
    (LocalCalculation.put (get_local_rules state, SOME (thms, Proof.level state))) state;
wenzelm@6778
    86
wenzelm@6787
    87
fun reset_calculation state =
skalberg@15531
    88
  Proof.map_context (LocalCalculation.put (get_local_rules state, NONE)) state;
wenzelm@6787
    89
wenzelm@6778
    90
wenzelm@6778
    91
wenzelm@6778
    92
(** attributes **)
wenzelm@6778
    93
wenzelm@12379
    94
(* add/del rules *)
wenzelm@12379
    95
wenzelm@12379
    96
fun global_att f (x, thm) = (GlobalCalculation.map (f thm) x, thm);
wenzelm@12379
    97
fun local_att f (x, thm) = (LocalCalculation.map (apfst (f thm)) x, thm);
wenzelm@6778
    98
wenzelm@12379
    99
val trans_add_global = global_att (apfst o NetRules.insert);
wenzelm@12379
   100
val trans_del_global = global_att (apfst o NetRules.delete);
wenzelm@12379
   101
val trans_add_local = local_att (apfst o NetRules.insert);
wenzelm@12379
   102
val trans_del_local = local_att (apfst o NetRules.delete);
wenzelm@6778
   103
skalberg@15531
   104
val sym_add_global = global_att (apsnd o Drule.add_rule) o ContextRules.elim_query_global NONE;
wenzelm@12402
   105
val sym_del_global = global_att (apsnd o Drule.del_rule) o ContextRules.rule_del_global;
skalberg@15531
   106
val sym_add_local = local_att (apsnd o Drule.add_rule) o ContextRules.elim_query_local NONE;
wenzelm@12402
   107
val sym_del_local = local_att (apsnd o Drule.del_rule) o ContextRules.rule_del_local;
wenzelm@12379
   108
wenzelm@12379
   109
wenzelm@12379
   110
(* symmetry *)
wenzelm@12379
   111
wenzelm@12379
   112
fun gen_symmetric get_sym = Drule.rule_attribute (fn x => fn th =>
wenzelm@12379
   113
  (case Seq.chop (2, Method.multi_resolves [th] (get_sym x)) of
wenzelm@12379
   114
    ([th'], _) => th'
wenzelm@12379
   115
  | ([], _) => raise THM ("symmetric: no unifiers", 1, [th])
wenzelm@12379
   116
  | _ => raise THM ("symmetric: multiple unifiers", 1, [th])));
wenzelm@12379
   117
wenzelm@12379
   118
val symmetric_global = gen_symmetric (#2 o GlobalCalculation.get);
wenzelm@12379
   119
val symmetric_local = gen_symmetric (#2 o #1 o LocalCalculation.get);
wenzelm@6778
   120
wenzelm@6778
   121
wenzelm@6778
   122
(* concrete syntax *)
wenzelm@6778
   123
wenzelm@6778
   124
val trans_attr =
wenzelm@8634
   125
 (Attrib.add_del_args trans_add_global trans_del_global,
wenzelm@8634
   126
  Attrib.add_del_args trans_add_local trans_del_local);
wenzelm@6778
   127
wenzelm@12379
   128
val sym_attr =
wenzelm@12379
   129
 (Attrib.add_del_args sym_add_global sym_del_global,
wenzelm@12379
   130
  Attrib.add_del_args sym_add_local sym_del_local);
wenzelm@12379
   131
wenzelm@15801
   132
val _ = Context.add_setup
wenzelm@15801
   133
 [Attrib.add_attributes
wenzelm@15801
   134
   [("trans", trans_attr, "declaration of transitivity rule"),
wenzelm@15801
   135
    ("sym", sym_attr, "declaration of symmetry rule"),
wenzelm@15801
   136
    ("symmetric", (Attrib.no_args symmetric_global, Attrib.no_args symmetric_local),
wenzelm@15801
   137
      "resolution with symmetry rule")],
wenzelm@15801
   138
  #1 o PureThy.add_thms
wenzelm@15801
   139
   [(("", transitive_thm), [trans_add_global]),
wenzelm@15801
   140
    (("", symmetric_thm), [sym_add_global])]];
wenzelm@15801
   141
wenzelm@6778
   142
wenzelm@6787
   143
wenzelm@6778
   144
(** proof commands **)
wenzelm@6778
   145
wenzelm@14555
   146
fun assert_sane final =
wenzelm@14555
   147
  if final then Proof.assert_forward else Proof.assert_forward_or_chain;
wenzelm@14555
   148
wenzelm@14555
   149
wenzelm@8588
   150
(* maintain calculation register *)
wenzelm@8562
   151
wenzelm@6778
   152
val calculationN = "calculation";
wenzelm@6778
   153
wenzelm@8588
   154
fun maintain_calculation false calc state =
wenzelm@8588
   155
      state
wenzelm@8588
   156
      |> put_calculation calc
wenzelm@14555
   157
      |> Proof.put_thms (calculationN, calc)
wenzelm@8588
   158
  | maintain_calculation true calc state =
wenzelm@8588
   159
      state
wenzelm@8588
   160
      |> reset_calculation
wenzelm@8588
   161
      |> Proof.reset_thms calculationN
wenzelm@14564
   162
      |> Proof.simple_note_thms "" calc
wenzelm@8588
   163
      |> Proof.chain;
wenzelm@8562
   164
wenzelm@8562
   165
wenzelm@8562
   166
(* 'also' and 'finally' *)
wenzelm@8562
   167
wenzelm@8588
   168
fun err_if state b msg = if b then raise Proof.STATE (msg, state) else ();
wenzelm@8588
   169
wenzelm@6877
   170
fun calculate final opt_rules print state =
wenzelm@6778
   171
  let
wenzelm@12805
   172
    val strip_assums_concl = Logic.strip_assums_concl o Thm.prop_of;
wenzelm@9322
   173
    val eq_prop = op aconv o pairself (Pattern.eta_contract o strip_assums_concl);
wenzelm@11097
   174
    fun projection ths th = Library.exists (Library.curry eq_prop th) ths;
wenzelm@8300
   175
wenzelm@11097
   176
    fun combine ths =
skalberg@15531
   177
      (case opt_rules of SOME rules => rules
skalberg@15531
   178
      | NONE =>
wenzelm@12379
   179
          (case ths of [] => NetRules.rules (#1 (get_local_rules state))
wenzelm@12379
   180
          | th :: _ => NetRules.retrieve (#1 (get_local_rules state)) (strip_assums_concl th)))
wenzelm@11097
   181
      |> Seq.of_list |> Seq.map (Method.multi_resolve ths) |> Seq.flat
wenzelm@11097
   182
      |> Seq.filter (not o projection ths);
wenzelm@7414
   183
wenzelm@14555
   184
    val facts = Proof.the_facts (assert_sane final state);
wenzelm@6903
   185
    val (initial, calculations) =
wenzelm@6778
   186
      (case get_calculation state of
skalberg@15531
   187
        NONE => (true, Seq.single facts)
skalberg@15531
   188
      | SOME calc => (false, Seq.map single (combine (calc @ facts))));
wenzelm@6778
   189
  in
wenzelm@8588
   190
    err_if state (initial andalso final) "No calculation yet";
wenzelm@15973
   191
    err_if state (initial andalso is_some opt_rules) "Initial calculation -- no rules to be given";
wenzelm@12055
   192
    calculations |> Seq.map (fn calc => (print (Proof.context_of state) calc;
wenzelm@12055
   193
        state |> maintain_calculation final calc))
wenzelm@6778
   194
  end;
wenzelm@6778
   195
wenzelm@6782
   196
fun also print = calculate false print;
wenzelm@6782
   197
fun finally print = calculate true print;
wenzelm@6778
   198
wenzelm@6778
   199
wenzelm@8588
   200
(* 'moreover' and 'ultimately' *)
wenzelm@8562
   201
wenzelm@8588
   202
fun collect final print state =
wenzelm@8588
   203
  let
wenzelm@14555
   204
    val facts = Proof.the_facts (assert_sane final state);
wenzelm@8588
   205
    val (initial, thms) =
wenzelm@8588
   206
      (case get_calculation state of
skalberg@15531
   207
        NONE => (true, [])
skalberg@15531
   208
      | SOME thms => (false, thms));
wenzelm@8588
   209
    val calc = thms @ facts;
wenzelm@8588
   210
  in
wenzelm@8588
   211
    err_if state (initial andalso final) "No calculation yet";
wenzelm@12055
   212
    print (Proof.context_of state) calc;
wenzelm@8588
   213
    state |> maintain_calculation final calc
wenzelm@8588
   214
  end;
wenzelm@8588
   215
wenzelm@8588
   216
fun moreover print = collect false print;
wenzelm@8588
   217
fun ultimately print = collect true print;
wenzelm@8562
   218
wenzelm@8562
   219
wenzelm@6778
   220
end;