src/Pure/Isar/calculation.ML
author wenzelm
Fri Nov 02 22:02:41 2001 +0100 (2001-11-02)
changeset 12021 8809efda06d3
parent 11784 b66b198ee29a
child 12055 a9c44895cc8c
permissions -rw-r--r--
declare transitive;
wenzelm@6778
     1
(*  Title:      Pure/Isar/calculation.ML
wenzelm@6778
     2
    ID:         $Id$
wenzelm@6778
     3
    Author:     Markus Wenzel, TU Muenchen
wenzelm@8807
     4
    License:    GPL (GNU GENERAL PUBLIC LICENSE)
wenzelm@6778
     5
wenzelm@6778
     6
Support for calculational proofs.
wenzelm@6778
     7
*)
wenzelm@6778
     8
wenzelm@6778
     9
signature CALCULATION =
wenzelm@6778
    10
sig
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@7414
    17
  val also: thm list option -> (thm list -> unit) -> Proof.state -> Proof.state Seq.seq
wenzelm@7414
    18
  val finally: thm list option -> (thm list -> unit) -> Proof.state -> Proof.state Seq.seq
wenzelm@8562
    19
  val moreover: (thm list -> unit) -> Proof.state -> Proof.state
wenzelm@8588
    20
  val ultimately: (thm list -> unit) -> Proof.state -> Proof.state
wenzelm@6778
    21
  val setup: (theory -> theory) list
wenzelm@6778
    22
end;
wenzelm@6778
    23
wenzelm@6778
    24
structure Calculation: CALCULATION =
wenzelm@6778
    25
struct
wenzelm@6778
    26
wenzelm@6778
    27
(** global and local calculation data **)
wenzelm@6778
    28
wenzelm@8300
    29
(* theory data kind 'Isar/calculation' *)
wenzelm@6778
    30
wenzelm@10008
    31
fun print_rules sg rs = Pretty.writeln (Pretty.big_list "transitivity rules:"
wenzelm@10008
    32
  (map (Display.pretty_thm_sg sg) (NetRules.rules rs)));
wenzelm@6778
    33
wenzelm@6778
    34
structure GlobalCalculationArgs =
wenzelm@6778
    35
struct
wenzelm@6778
    36
  val name = "Isar/calculation";
wenzelm@8300
    37
  type T = thm NetRules.T
wenzelm@6778
    38
wenzelm@11784
    39
  val empty = NetRules.elim;
wenzelm@6778
    40
  val copy = I;
wenzelm@6778
    41
  val prep_ext = I;
wenzelm@8300
    42
  val merge = NetRules.merge;
wenzelm@10008
    43
  val print = print_rules;
wenzelm@6778
    44
end;
wenzelm@6778
    45
wenzelm@6778
    46
structure GlobalCalculation = TheoryDataFun(GlobalCalculationArgs);
wenzelm@6778
    47
val print_global_rules = GlobalCalculation.print;
wenzelm@6778
    48
wenzelm@6778
    49
wenzelm@6778
    50
(* proof data kind 'Isar/calculation' *)
wenzelm@6778
    51
wenzelm@6778
    52
structure LocalCalculationArgs =
wenzelm@6778
    53
struct
wenzelm@6778
    54
  val name = "Isar/calculation";
wenzelm@8300
    55
  type T = thm NetRules.T * (thm list * int) option;
wenzelm@6778
    56
wenzelm@6778
    57
  fun init thy = (GlobalCalculation.get thy, None);
wenzelm@10008
    58
  fun print ctxt (rs, _) = print_rules (ProofContext.sign_of ctxt) rs;
wenzelm@6778
    59
end;
wenzelm@6778
    60
wenzelm@6778
    61
structure LocalCalculation = ProofDataFun(LocalCalculationArgs);
wenzelm@6787
    62
val get_local_rules = #1 o LocalCalculation.get_st;
wenzelm@6778
    63
val print_local_rules = LocalCalculation.print;
wenzelm@6778
    64
wenzelm@6778
    65
wenzelm@6778
    66
(* access calculation *)
wenzelm@6778
    67
wenzelm@6778
    68
fun get_calculation state =
wenzelm@6787
    69
  (case #2 (LocalCalculation.get_st state) of
wenzelm@6778
    70
    None => None
wenzelm@7414
    71
  | Some (thms, lev) => if lev = Proof.level state then Some thms else None);
wenzelm@6778
    72
wenzelm@7414
    73
fun put_calculation thms state =
wenzelm@7414
    74
  LocalCalculation.put_st (get_local_rules state, Some (thms, Proof.level state)) state;
wenzelm@6778
    75
wenzelm@6787
    76
fun reset_calculation state =
wenzelm@6787
    77
  LocalCalculation.put_st (get_local_rules state, None) state;
wenzelm@6787
    78
wenzelm@6778
    79
wenzelm@6778
    80
wenzelm@6778
    81
(** attributes **)
wenzelm@6778
    82
wenzelm@6778
    83
(* trans add/del *)
wenzelm@6778
    84
wenzelm@6778
    85
fun mk_att f g (x, thm) = (f (g thm) x, thm);
wenzelm@6778
    86
wenzelm@8300
    87
val trans_add_global = mk_att GlobalCalculation.map NetRules.insert;
wenzelm@8300
    88
val trans_del_global = mk_att GlobalCalculation.map NetRules.delete;
wenzelm@8300
    89
val trans_add_local = mk_att LocalCalculation.map (Library.apfst o NetRules.insert);
wenzelm@8300
    90
val trans_del_local = mk_att LocalCalculation.map (Library.apfst o NetRules.delete);
wenzelm@6778
    91
wenzelm@6778
    92
wenzelm@6778
    93
(* concrete syntax *)
wenzelm@6778
    94
wenzelm@6778
    95
val trans_attr =
wenzelm@8634
    96
 (Attrib.add_del_args trans_add_global trans_del_global,
wenzelm@8634
    97
  Attrib.add_del_args trans_add_local trans_del_local);
wenzelm@6778
    98
wenzelm@6778
    99
wenzelm@6787
   100
wenzelm@6778
   101
(** proof commands **)
wenzelm@6778
   102
wenzelm@8588
   103
(* maintain calculation register *)
wenzelm@8562
   104
wenzelm@6778
   105
val calculationN = "calculation";
wenzelm@6778
   106
wenzelm@8588
   107
fun maintain_calculation false calc state =
wenzelm@8588
   108
      state
wenzelm@8588
   109
      |> put_calculation calc
wenzelm@8588
   110
      |> Proof.simple_have_thms calculationN calc
wenzelm@8588
   111
      |> Proof.reset_facts
wenzelm@8588
   112
  | maintain_calculation true calc state =
wenzelm@8588
   113
      state
wenzelm@8588
   114
      |> reset_calculation
wenzelm@8588
   115
      |> Proof.reset_thms calculationN
wenzelm@8588
   116
      |> Proof.simple_have_thms "" calc
wenzelm@8588
   117
      |> Proof.chain;
wenzelm@8562
   118
wenzelm@8562
   119
wenzelm@8562
   120
(* 'also' and 'finally' *)
wenzelm@8562
   121
wenzelm@8588
   122
fun err_if state b msg = if b then raise Proof.STATE (msg, state) else ();
wenzelm@8588
   123
wenzelm@6877
   124
fun calculate final opt_rules print state =
wenzelm@6778
   125
  let
wenzelm@9322
   126
    val strip_assums_concl = Logic.strip_assums_concl o #prop o Thm.rep_thm;
wenzelm@9322
   127
    val eq_prop = op aconv o pairself (Pattern.eta_contract o strip_assums_concl);
wenzelm@11097
   128
    fun projection ths th = Library.exists (Library.curry eq_prop th) ths;
wenzelm@8300
   129
wenzelm@11097
   130
    fun combine ths =
wenzelm@11097
   131
      (case opt_rules of Some rules => rules
wenzelm@11097
   132
      | None =>
wenzelm@11097
   133
          (case ths of [] => NetRules.rules (get_local_rules state)
wenzelm@11784
   134
          | th :: _ => NetRules.retrieve (get_local_rules state) (strip_assums_concl th)))
wenzelm@11097
   135
      |> Seq.of_list |> Seq.map (Method.multi_resolve ths) |> Seq.flat
wenzelm@11097
   136
      |> Seq.filter (not o projection ths);
wenzelm@7414
   137
wenzelm@11097
   138
    val facts = Proof.the_facts (Proof.assert_forward state);
wenzelm@6903
   139
    val (initial, calculations) =
wenzelm@6778
   140
      (case get_calculation state of
wenzelm@7414
   141
        None => (true, Seq.single facts)
wenzelm@11097
   142
      | Some calc => (false, Seq.map single (combine (calc @ facts))));
wenzelm@6778
   143
  in
wenzelm@8588
   144
    err_if state (initial andalso final) "No calculation yet";
wenzelm@8588
   145
    err_if state (initial andalso is_some opt_rules) "Initial calculation -- no rules to be given";
wenzelm@8588
   146
    calculations |> Seq.map (fn calc => (print calc; state |> maintain_calculation final calc))
wenzelm@6778
   147
  end;
wenzelm@6778
   148
wenzelm@6782
   149
fun also print = calculate false print;
wenzelm@6782
   150
fun finally print = calculate true print;
wenzelm@6778
   151
wenzelm@6778
   152
wenzelm@8588
   153
(* 'moreover' and 'ultimately' *)
wenzelm@8562
   154
wenzelm@8588
   155
fun collect final print state =
wenzelm@8588
   156
  let
wenzelm@10478
   157
    val facts = Proof.the_facts (Proof.assert_forward state);
wenzelm@8588
   158
    val (initial, thms) =
wenzelm@8588
   159
      (case get_calculation state of
wenzelm@8588
   160
        None => (true, [])
wenzelm@8588
   161
      | Some thms => (false, thms));
wenzelm@8588
   162
    val calc = thms @ facts;
wenzelm@8588
   163
  in
wenzelm@8588
   164
    err_if state (initial andalso final) "No calculation yet";
wenzelm@8588
   165
    print calc;
wenzelm@8588
   166
    state |> maintain_calculation final calc
wenzelm@8588
   167
  end;
wenzelm@8588
   168
wenzelm@8588
   169
fun moreover print = collect false print;
wenzelm@8588
   170
fun ultimately print = collect true print;
wenzelm@8562
   171
wenzelm@8562
   172
wenzelm@6778
   173
wenzelm@6778
   174
(** theory setup **)
wenzelm@6778
   175
wenzelm@6778
   176
val setup = [GlobalCalculation.init, LocalCalculation.init,
wenzelm@12021
   177
  Attrib.add_attributes [("trans", trans_attr, "declaration of transitivity rule")],
wenzelm@12021
   178
  #1 o PureThy.add_thms [(("", transitive_thm), [trans_add_global])]];
wenzelm@6778
   179
wenzelm@6778
   180
wenzelm@6778
   181
end;