src/Pure/goal.ML
author wenzelm
Wed Aug 02 22:26:44 2006 +0200 (2006-08-02)
changeset 20290 3f886c176c9b
parent 20260 990dbc007ca6
child 21516 c2a116a2c4fd
permissions -rw-r--r--
normalized Proof.context/method type aliases;
simplified Assumption/ProofContext.export;
tuned;
wenzelm@17980
     1
(*  Title:      Pure/goal.ML
wenzelm@17980
     2
    ID:         $Id$
wenzelm@17980
     3
    Author:     Makarius and Lawrence C Paulson
wenzelm@17980
     4
wenzelm@18139
     5
Goals in tactical theorem proving.
wenzelm@17980
     6
*)
wenzelm@17980
     7
wenzelm@17980
     8
signature BASIC_GOAL =
wenzelm@17980
     9
sig
wenzelm@17980
    10
  val SELECT_GOAL: tactic -> int -> tactic
wenzelm@17980
    11
end;
wenzelm@17980
    12
wenzelm@17980
    13
signature GOAL =
wenzelm@17980
    14
sig
wenzelm@17980
    15
  include BASIC_GOAL
wenzelm@17980
    16
  val init: cterm -> thm
wenzelm@18027
    17
  val protect: thm -> thm
wenzelm@17980
    18
  val conclude: thm -> thm
wenzelm@17980
    19
  val finish: thm -> thm
wenzelm@18119
    20
  val compose_hhf: thm -> int -> thm -> thm Seq.seq
wenzelm@18119
    21
  val compose_hhf_tac: thm -> int -> tactic
wenzelm@18027
    22
  val comp_hhf: thm -> thm -> thm
wenzelm@20250
    23
  val prove_raw: cterm list -> cterm -> (thm list -> tactic) -> thm
wenzelm@20290
    24
  val prove_multi: Proof.context -> string list -> term list -> term list ->
wenzelm@20290
    25
    ({prems: thm list, context: Proof.context} -> tactic) -> thm list
wenzelm@20290
    26
  val prove: Proof.context -> string list -> term list -> term ->
wenzelm@20290
    27
    ({prems: thm list, context: Proof.context} -> tactic) -> thm
wenzelm@20056
    28
  val prove_global: theory -> string list -> term list -> term -> (thm list -> tactic) -> thm
wenzelm@19184
    29
  val extract: int -> int -> thm -> thm Seq.seq
wenzelm@19184
    30
  val retrofit: int -> int -> thm -> thm -> thm Seq.seq
wenzelm@17980
    31
end;
wenzelm@17980
    32
wenzelm@17980
    33
structure Goal: GOAL =
wenzelm@17980
    34
struct
wenzelm@17980
    35
wenzelm@18027
    36
(** goals **)
wenzelm@18027
    37
wenzelm@18027
    38
(*
wenzelm@18027
    39
  -------- (init)
wenzelm@18027
    40
  C ==> #C
wenzelm@18027
    41
*)
wenzelm@20290
    42
val init =
wenzelm@20290
    43
  let val A = #1 (Drule.dest_implies (Thm.cprop_of Drule.protectI))
wenzelm@20290
    44
  in fn C => Thm.instantiate ([], [(A, C)]) Drule.protectI end;
wenzelm@17980
    45
wenzelm@17980
    46
(*
wenzelm@18119
    47
   C
wenzelm@18119
    48
  --- (protect)
wenzelm@18119
    49
  #C
wenzelm@17980
    50
*)
wenzelm@18027
    51
fun protect th = th COMP Drule.incr_indexes th Drule.protectI;
wenzelm@17980
    52
wenzelm@17980
    53
(*
wenzelm@18027
    54
  A ==> ... ==> #C
wenzelm@18027
    55
  ---------------- (conclude)
wenzelm@17980
    56
  A ==> ... ==> C
wenzelm@17980
    57
*)
wenzelm@17980
    58
fun conclude th =
wenzelm@18497
    59
  (case SINGLE (Thm.compose_no_flatten false (th, Thm.nprems_of th) 1)
wenzelm@18027
    60
      (Drule.incr_indexes th Drule.protectD) of
wenzelm@17980
    61
    SOME th' => th'
wenzelm@17980
    62
  | NONE => raise THM ("Failed to conclude goal", 0, [th]));
wenzelm@17980
    63
wenzelm@17980
    64
(*
wenzelm@18027
    65
  #C
wenzelm@18027
    66
  --- (finish)
wenzelm@18027
    67
   C
wenzelm@17983
    68
*)
wenzelm@17980
    69
fun finish th =
wenzelm@17980
    70
  (case Thm.nprems_of th of
wenzelm@17980
    71
    0 => conclude th
wenzelm@17980
    72
  | n => raise THM ("Proof failed.\n" ^
wenzelm@17980
    73
      Pretty.string_of (Pretty.chunks (Display.pretty_goals n th)) ^
wenzelm@17980
    74
      ("\n" ^ string_of_int n ^ " unsolved goal(s)!"), 0, [th]));
wenzelm@17980
    75
wenzelm@17980
    76
wenzelm@18027
    77
wenzelm@18027
    78
(** results **)
wenzelm@18027
    79
wenzelm@18027
    80
(* composition of normal results *)
wenzelm@18027
    81
wenzelm@18027
    82
fun compose_hhf tha i thb =
wenzelm@18145
    83
  Thm.bicompose false (false, Drule.lift_all (Thm.cprem_of thb i) tha, 0) i thb;
wenzelm@18027
    84
wenzelm@18119
    85
fun compose_hhf_tac th i = PRIMSEQ (compose_hhf th i);
wenzelm@18119
    86
wenzelm@18027
    87
fun comp_hhf tha thb =
wenzelm@19862
    88
  (case Seq.chop 2 (compose_hhf tha 1 thb) of
wenzelm@18119
    89
    ([th], _) => th
wenzelm@18119
    90
  | ([], _) => raise THM ("comp_hhf: no unifiers", 1, [tha, thb])
wenzelm@18119
    91
  | _  => raise THM ("comp_hhf: multiple unifiers", 1, [tha, thb]));
wenzelm@17986
    92
wenzelm@17986
    93
wenzelm@18027
    94
wenzelm@18027
    95
(** tactical theorem proving **)
wenzelm@18027
    96
wenzelm@20250
    97
(* prove_raw -- no checks, no normalization of result! *)
wenzelm@20250
    98
wenzelm@20250
    99
fun prove_raw casms cprop tac =
wenzelm@20250
   100
  (case SINGLE (tac (map Assumption.assume casms)) (init cprop) of
wenzelm@20250
   101
    SOME th => Drule.implies_intr_list casms (finish th)
wenzelm@20250
   102
  | NONE => error "Tactic failed.");
wenzelm@20250
   103
wenzelm@20250
   104
wenzelm@18119
   105
(* prove_multi *)
wenzelm@17986
   106
wenzelm@20056
   107
fun prove_multi ctxt xs asms props tac =
wenzelm@17980
   108
  let
wenzelm@20056
   109
    val thy = Context.theory_of_proof ctxt;
wenzelm@20056
   110
    val string_of_term = Sign.string_of_term thy;
wenzelm@20056
   111
wenzelm@20250
   112
    fun err msg = cat_error msg
wenzelm@20250
   113
      ("The error(s) above occurred for the goal statement:\n" ^
wenzelm@20250
   114
        string_of_term (Logic.list_implies (asms, Logic.mk_conjunction_list props)));
wenzelm@17980
   115
wenzelm@20250
   116
    fun cert_safe t = Thm.cterm_of thy (Envir.beta_norm (Term.no_dummy_patterns t))
wenzelm@17980
   117
      handle TERM (msg, _) => err msg | TYPE (msg, _, _) => err msg;
wenzelm@20250
   118
    val casms = map cert_safe asms;
wenzelm@20250
   119
    val cprops = map cert_safe props;
wenzelm@17980
   120
wenzelm@20250
   121
    val (prems, ctxt') = ctxt
wenzelm@20250
   122
      |> Variable.add_fixes_direct xs
wenzelm@20250
   123
      |> fold Variable.declare_internal (asms @ props)
wenzelm@20250
   124
      |> Assumption.add_assumes casms;
wenzelm@17980
   125
wenzelm@20250
   126
    val goal = init (Conjunction.mk_conjunction_list cprops);
wenzelm@19774
   127
    val res =
wenzelm@20250
   128
      (case SINGLE (tac {prems = prems, context = ctxt'}) goal of
wenzelm@19774
   129
        NONE => err "Tactic failed."
wenzelm@19774
   130
      | SOME res => res);
wenzelm@20250
   131
    val [results] = Conjunction.elim_precise [length props] (finish res)
wenzelm@20250
   132
      handle THM (msg, _, _) => err msg;
wenzelm@20250
   133
    val _ = Unify.matches_list thy (map Thm.term_of cprops) (map Thm.prop_of results)
wenzelm@20056
   134
      orelse err ("Proved a different theorem: " ^ string_of_term (Thm.prop_of res));
wenzelm@17980
   135
  in
wenzelm@20056
   136
    results
wenzelm@20290
   137
    |> map (Assumption.export false ctxt' ctxt)
wenzelm@20056
   138
    |> Variable.export ctxt' ctxt
wenzelm@20250
   139
    |> map Drule.zero_var_indexes
wenzelm@17980
   140
  end;
wenzelm@17980
   141
wenzelm@17980
   142
wenzelm@18119
   143
(* prove *)
wenzelm@17980
   144
wenzelm@20056
   145
fun prove ctxt xs asms prop tac = hd (prove_multi ctxt xs asms [prop] tac);
wenzelm@20056
   146
wenzelm@20056
   147
fun prove_global thy xs asms prop tac =
wenzelm@20250
   148
  Drule.standard (prove (Context.init_proof thy) xs asms prop (fn {prems, ...} => tac prems));
wenzelm@18027
   149
wenzelm@18027
   150
wenzelm@17980
   151
wenzelm@19184
   152
(** local goal states **)
wenzelm@18207
   153
wenzelm@19184
   154
fun extract i n st =
wenzelm@19184
   155
  (if i < 1 orelse n < 1 orelse i + n - 1 > Thm.nprems_of st then Seq.empty
wenzelm@19184
   156
   else if n = 1 then Seq.single (Thm.cprem_of st i)
wenzelm@19423
   157
   else Seq.single (foldr1 Conjunction.mk_conjunction (map (Thm.cprem_of st) (i upto i + n - 1))))
wenzelm@20260
   158
  |> Seq.map (Thm.adjust_maxidx_cterm ~1 #> init);
wenzelm@17980
   159
wenzelm@19221
   160
fun retrofit i n st' st =
wenzelm@19221
   161
  (if n = 1 then st
wenzelm@19423
   162
   else st |> Drule.rotate_prems (i - 1) |> Conjunction.uncurry n |> Drule.rotate_prems (1 - i))
wenzelm@19221
   163
  |> Thm.compose_no_flatten false (conclude st', Thm.nprems_of st') i;
wenzelm@18207
   164
wenzelm@17980
   165
fun SELECT_GOAL tac i st =
wenzelm@19191
   166
  if Thm.nprems_of st = 1 andalso i = 1 then tac st
wenzelm@19184
   167
  else Seq.lifts (retrofit i 1) (Seq.maps tac (extract i 1 st)) st;
wenzelm@17980
   168
wenzelm@18207
   169
end;
wenzelm@18207
   170
wenzelm@17980
   171
structure BasicGoal: BASIC_GOAL = Goal;
wenzelm@17980
   172
open BasicGoal;