src/Pure/Isar/proof_context.ML
author wenzelm
Thu Sep 30 21:20:36 1999 +0200 (1999-09-30 ago)
changeset 7663 460fedf14b09
parent 7606 7905a74eb068
child 7670 e302e4269087
permissions -rw-r--r--
export def_sort, def_type;
fix_i: typ option;
init: maxidx = 0 is workaround for obscure bug in Unify.smash_unifiers;
wenzelm@5819
     1
(*  Title:      Pure/Isar/proof_context.ML
wenzelm@5819
     2
    ID:         $Id$
wenzelm@5819
     3
    Author:     Markus Wenzel, TU Muenchen
wenzelm@5819
     4
wenzelm@5819
     5
Proof context information.
wenzelm@5819
     6
*)
wenzelm@5819
     7
wenzelm@5819
     8
signature PROOF_CONTEXT =
wenzelm@5819
     9
sig
wenzelm@5819
    10
  type context
wenzelm@5819
    11
  exception CONTEXT of string * context
wenzelm@5819
    12
  val theory_of: context -> theory
wenzelm@5819
    13
  val sign_of: context -> Sign.sg
wenzelm@7557
    14
  val prems_of: context -> thm list
wenzelm@6985
    15
  val show_hyps: bool ref
wenzelm@6985
    16
  val pretty_thm: thm -> Pretty.T
wenzelm@6528
    17
  val verbose: bool ref
wenzelm@5819
    18
  val print_binds: context -> unit
wenzelm@5819
    19
  val print_thms: context -> unit
wenzelm@7575
    20
  val strings_of_prems: context -> string list
wenzelm@6847
    21
  val strings_of_context: context -> string list
wenzelm@5819
    22
  val print_proof_data: theory -> unit
wenzelm@5874
    23
  val init: theory -> context
wenzelm@7663
    24
  val def_sort: context -> indexname -> sort option
wenzelm@7663
    25
  val def_type: context -> bool -> indexname -> typ option
wenzelm@5819
    26
  val read_typ: context -> string -> typ
wenzelm@5819
    27
  val cert_typ: context -> typ -> typ
wenzelm@5874
    28
  val read_termTs: context -> (string * typ) list -> term list * (indexname * typ) list
wenzelm@5819
    29
  val read_term: context -> string -> term
wenzelm@5819
    30
  val read_prop: context -> string -> term
wenzelm@5935
    31
  val read_term_pat: context -> string -> term
wenzelm@5935
    32
  val read_prop_pat: context -> string -> term
wenzelm@5819
    33
  val cert_term: context -> term -> term
wenzelm@5819
    34
  val cert_prop: context -> term -> term
wenzelm@5819
    35
  val declare_term: term -> context -> context
wenzelm@5819
    36
  val declare_terms: term list -> context -> context
wenzelm@5874
    37
  val declare_thm: thm -> context -> context
wenzelm@7606
    38
  val add_binds: (indexname * string option) list -> context -> context
wenzelm@7606
    39
  val add_binds_i: (indexname * term option) list -> context -> context
wenzelm@5935
    40
  val match_binds: (string list * string) list -> context -> context
wenzelm@5935
    41
  val match_binds_i: (term list * term) list -> context -> context
wenzelm@6931
    42
  val bind_propp: context * (string * (string list * string list)) -> context * term
wenzelm@6931
    43
  val bind_propp_i: context * (term * (term list * term list)) -> context * term
wenzelm@6789
    44
  val auto_bind_goal: term -> context -> context
wenzelm@6797
    45
  val auto_bind_facts: string -> term list -> context -> context
wenzelm@6091
    46
  val get_thm: context -> string -> thm
wenzelm@6091
    47
  val get_thms: context -> string -> thm list
wenzelm@6091
    48
  val get_thmss: context -> string list -> thm list
wenzelm@6091
    49
  val put_thm: string * thm -> context -> context
wenzelm@6091
    50
  val put_thms: string * thm list -> context -> context
wenzelm@6091
    51
  val put_thmss: (string * thm list) list -> context -> context
wenzelm@7606
    52
  val reset_thms: string -> context -> context
wenzelm@6875
    53
  val have_thmss: thm list -> string -> context attribute list
wenzelm@6091
    54
    -> (thm list * context attribute list) list -> context -> context * (string * thm list)
wenzelm@6931
    55
  val assumptions: context -> (cterm * ((int -> tactic) * (int -> tactic))) list
wenzelm@5819
    56
  val fixed_names: context -> string list
wenzelm@7270
    57
  val assume: ((int -> tactic) * (int -> tactic))
wenzelm@7270
    58
    -> (string * context attribute list * (string * (string list * string list)) list) list
wenzelm@7270
    59
    -> context -> context * ((string * thm list) list * thm list)
wenzelm@7270
    60
  val assume_i: ((int -> tactic) * (int -> tactic))
wenzelm@7270
    61
    -> (string * context attribute list * (term * (term list * term list)) list) list
wenzelm@7270
    62
    -> context -> context * ((string * thm list) list * thm list)
wenzelm@7411
    63
  val fix: (string list * string option) list -> context -> context
wenzelm@7663
    64
  val fix_i: (string list * typ option) list -> context -> context
wenzelm@5819
    65
  val setup: (theory -> theory) list
wenzelm@5819
    66
end;
wenzelm@5819
    67
wenzelm@5819
    68
signature PROOF_CONTEXT_PRIVATE =
wenzelm@5819
    69
sig
wenzelm@5819
    70
  include PROOF_CONTEXT
wenzelm@5819
    71
  val init_data: Object.kind -> (theory -> Object.T) * (context -> Object.T -> unit)
wenzelm@5819
    72
    -> theory -> theory
wenzelm@5819
    73
  val print_data: Object.kind -> context -> unit
wenzelm@5819
    74
  val get_data: Object.kind -> (Object.T -> 'a) -> context -> 'a
wenzelm@5819
    75
  val put_data: Object.kind -> ('a -> Object.T) -> 'a -> context -> context
wenzelm@5819
    76
end;
wenzelm@5819
    77
wenzelm@5819
    78
structure ProofContext: PROOF_CONTEXT_PRIVATE =
wenzelm@5819
    79
struct
wenzelm@5819
    80
wenzelm@5819
    81
wenzelm@5819
    82
(** datatype context **)
wenzelm@5819
    83
wenzelm@5819
    84
datatype context =
wenzelm@5819
    85
  Context of
wenzelm@6847
    86
   {thy: theory,                                                        (*current theory*)
wenzelm@6847
    87
    data: Object.T Symtab.table,                                        (*user data*)
wenzelm@5819
    88
    asms:
wenzelm@7663
    89
      ((cterm * ((int -> tactic) * (int -> tactic))) list *             (*assumes: A ==> _*)
wenzelm@6931
    90
        (string * thm list) list) *
wenzelm@6847
    91
      ((string * string) list * string list),                           (*fixes: !!x. _*)
wenzelm@7606
    92
    binds: (term * typ) option Vartab.table,                            (*term bindings*)
wenzelm@7606
    93
    thms: thm list option Symtab.table,                                 (*local thms*)
wenzelm@5819
    94
    defs:
wenzelm@6847
    95
      typ Vartab.table *                                                (*type constraints*)
wenzelm@6847
    96
      sort Vartab.table *                                               (*default sorts*)
wenzelm@6847
    97
      int *                                                             (*maxidx*)
wenzelm@6847
    98
      string list};                                                     (*used type var names*)
wenzelm@5819
    99
wenzelm@5819
   100
exception CONTEXT of string * context;
wenzelm@5819
   101
wenzelm@5819
   102
wenzelm@5819
   103
fun make_context (thy, data, asms, binds, thms, defs) =
wenzelm@5819
   104
  Context {thy = thy, data = data, asms = asms, binds = binds, thms = thms, defs = defs};
wenzelm@5819
   105
wenzelm@5819
   106
fun map_context f (Context {thy, data, asms, binds, thms, defs}) =
wenzelm@5819
   107
  make_context (f (thy, data, asms, binds, thms, defs));
wenzelm@5819
   108
wenzelm@5819
   109
fun theory_of (Context {thy, ...}) = thy;
wenzelm@5819
   110
val sign_of = Theory.sign_of o theory_of;
wenzelm@5819
   111
wenzelm@7270
   112
fun prems_of (Context {asms = ((_, asms), _), ...}) = flat (map #2 asms);
wenzelm@7270
   113
wenzelm@5819
   114
wenzelm@5819
   115
wenzelm@5819
   116
(** print context information **)
wenzelm@5819
   117
wenzelm@6985
   118
val show_hyps = ref false;
wenzelm@7575
   119
wenzelm@7575
   120
fun pretty_thm thm =
wenzelm@7575
   121
  if ! show_hyps then setmp Display.show_hyps true Display.pretty_thm_no_quote thm
wenzelm@7575
   122
  else Display.pretty_cterm (#prop (Thm.crep_thm thm));
wenzelm@6985
   123
wenzelm@6528
   124
val verbose = ref false;
wenzelm@6847
   125
fun verb f x = if ! verbose then f x else [];
wenzelm@6847
   126
val verb_string = verb (Library.single o Pretty.string_of);
wenzelm@5819
   127
wenzelm@6847
   128
fun strings_of_items prt name items =
wenzelm@5819
   129
  let
wenzelm@5819
   130
    fun pretty_itms (name, [x]) = Pretty.block [Pretty.str (name ^ ":"), Pretty.brk 1, prt x]
wenzelm@5819
   131
      | pretty_itms (name, xs) = Pretty.big_list (name ^ ":") (map prt xs);
wenzelm@6721
   132
  in
wenzelm@6847
   133
    if null items andalso not (! verbose) then []
wenzelm@6847
   134
    else [Pretty.string_of (Pretty.big_list name (map pretty_itms items))]
wenzelm@6721
   135
  end;
wenzelm@5819
   136
wenzelm@5819
   137
wenzelm@5819
   138
(* term bindings *)
wenzelm@5819
   139
wenzelm@7606
   140
val smash_option = fn (_, None) => None | (xi, Some b) => Some (xi, b);
wenzelm@7606
   141
wenzelm@7575
   142
fun strings_of_binds (ctxt as Context {binds, ...}) =
wenzelm@5819
   143
  let
wenzelm@7575
   144
    val prt_term = Sign.pretty_term (sign_of ctxt);
wenzelm@7479
   145
    fun pretty_bind (xi, (t, T)) = prt_term (Logic.mk_equals (Var (xi, T), t));
wenzelm@7606
   146
    val bs = mapfilter smash_option (Vartab.dest binds);
wenzelm@6721
   147
  in
wenzelm@7606
   148
    if null bs andalso not (! verbose) then []
wenzelm@7606
   149
    else [Pretty.string_of (Pretty.big_list "term bindings:" (map pretty_bind bs))]
wenzelm@6721
   150
  end;
wenzelm@5819
   151
wenzelm@6847
   152
val print_binds = seq writeln o strings_of_binds;
wenzelm@6847
   153
wenzelm@5819
   154
wenzelm@5819
   155
(* local theorems *)
wenzelm@5819
   156
wenzelm@6847
   157
fun strings_of_thms (Context {thms, ...}) =
wenzelm@7606
   158
  strings_of_items pretty_thm "local theorems:" (mapfilter smash_option (Symtab.dest thms));
wenzelm@6847
   159
wenzelm@6847
   160
val print_thms = seq writeln o strings_of_thms;
wenzelm@5819
   161
wenzelm@5819
   162
wenzelm@5819
   163
(* main context *)
wenzelm@5819
   164
wenzelm@7575
   165
fun strings_of_prems ctxt =
wenzelm@7575
   166
  (case prems_of ctxt of
wenzelm@7575
   167
    [] => []
wenzelm@7575
   168
  | prems => [Pretty.string_of (Pretty.big_list "prems:" (map pretty_thm prems))]);
wenzelm@7575
   169
wenzelm@7575
   170
fun strings_of_context (ctxt as Context {asms = (_, (fixes, _)),
wenzelm@7575
   171
    defs = (types, sorts, maxidx, used), ...}) =
wenzelm@5819
   172
  let
wenzelm@7575
   173
    val sign = sign_of ctxt;
wenzelm@5819
   174
wenzelm@5819
   175
    val prt_term = Sign.pretty_term sign;
wenzelm@5819
   176
    val prt_typ = Sign.pretty_typ sign;
wenzelm@5819
   177
    val prt_sort = Sign.pretty_sort sign;
wenzelm@5819
   178
wenzelm@5819
   179
    (*theory*)
wenzelm@5819
   180
    val pretty_thy = Pretty.block [Pretty.str "Theory:", Pretty.brk 1, Sign.pretty_sg sign];
wenzelm@5819
   181
wenzelm@5819
   182
    (*fixes*)
wenzelm@7606
   183
    fun prt_fix (x, x') = Pretty.block
wenzelm@7606
   184
      [prt_term (Syntax.free x), Pretty.str " =", Pretty.brk 1, prt_term (Syntax.free x')];
wenzelm@7606
   185
wenzelm@7575
   186
    fun prt_fixes xs = Pretty.block (Pretty.str "fixed variables:" :: Pretty.brk 1 ::
wenzelm@7606
   187
      Pretty.commas (map prt_fix xs));
wenzelm@7200
   188
wenzelm@5819
   189
wenzelm@5819
   190
    (* defaults *)
wenzelm@5819
   191
wenzelm@5819
   192
    fun prt_atom prt prtT (x, X) = Pretty.block
wenzelm@5819
   193
      [prt x, Pretty.str " ::", Pretty.brk 1, prtT X];
wenzelm@5819
   194
wenzelm@5819
   195
    fun prt_var (x, ~1) = prt_term (Syntax.free x)
wenzelm@5819
   196
      | prt_var xi = prt_term (Syntax.var xi);
wenzelm@5819
   197
wenzelm@5819
   198
    fun prt_varT (x, ~1) = prt_typ (TFree (x, []))
wenzelm@5819
   199
      | prt_varT xi = prt_typ (TVar (xi, []));
wenzelm@5819
   200
wenzelm@5819
   201
    val prt_defT = prt_atom prt_var prt_typ;
wenzelm@5819
   202
    val prt_defS = prt_atom prt_varT prt_sort;
wenzelm@5819
   203
  in
wenzelm@6847
   204
    verb_string pretty_thy @
wenzelm@7575
   205
    (if null fixes then [] else [Pretty.string_of (prt_fixes (rev fixes))]) @
wenzelm@7575
   206
    strings_of_prems ctxt @
wenzelm@6847
   207
    verb strings_of_binds ctxt @
wenzelm@6847
   208
    verb strings_of_thms ctxt @
wenzelm@7575
   209
    verb_string (Pretty.big_list "type constraints:" (map prt_defT (Vartab.dest types))) @
wenzelm@7575
   210
    verb_string (Pretty.big_list "default sorts:" (map prt_defS (Vartab.dest sorts))) @
wenzelm@7575
   211
    verb_string (Pretty.str ("maxidx: " ^ string_of_int maxidx)) @
wenzelm@7575
   212
    verb_string (Pretty.strs ("used type variable names:" :: used))
wenzelm@5819
   213
  end;
wenzelm@5819
   214
wenzelm@5819
   215
wenzelm@5819
   216
wenzelm@5819
   217
(** user data **)
wenzelm@5819
   218
wenzelm@5819
   219
(* errors *)
wenzelm@5819
   220
wenzelm@5819
   221
fun of_theory thy = "\nof theory " ^ Sign.str_of_sg (Theory.sign_of thy);
wenzelm@5819
   222
wenzelm@5819
   223
fun err_inconsistent kinds =
wenzelm@5819
   224
  error ("Attempt to merge different versions of " ^ commas_quote kinds ^ " proof data");
wenzelm@5819
   225
wenzelm@5819
   226
fun err_dup_init thy kind =
wenzelm@5819
   227
  error ("Duplicate initialization of " ^ quote kind ^ " proof data" ^ of_theory thy);
wenzelm@5819
   228
wenzelm@5819
   229
fun err_undef ctxt kind =
wenzelm@5819
   230
  raise CONTEXT ("Tried to access undefined " ^ quote kind ^ " proof data", ctxt);
wenzelm@5819
   231
wenzelm@5819
   232
fun err_uninit ctxt kind =
wenzelm@5819
   233
  raise CONTEXT ("Tried to access uninitialized " ^ quote kind ^ " proof data" ^
wenzelm@5819
   234
    of_theory (theory_of ctxt), ctxt);
wenzelm@5819
   235
wenzelm@5819
   236
fun err_access ctxt kind =
wenzelm@5819
   237
  raise CONTEXT ("Unauthorized access to " ^ quote kind ^ " proof data" ^
wenzelm@5819
   238
    of_theory (theory_of ctxt), ctxt);
wenzelm@5819
   239
wenzelm@5819
   240
wenzelm@5819
   241
(* data kind 'Isar/proof_data' *)
wenzelm@5819
   242
wenzelm@5819
   243
structure ProofDataDataArgs =
wenzelm@5819
   244
struct
wenzelm@5819
   245
  val name = "Isar/proof_data";
wenzelm@5819
   246
  type T = (Object.kind * ((theory -> Object.T) * (context -> Object.T -> unit))) Symtab.table;
wenzelm@5819
   247
wenzelm@5819
   248
  val empty = Symtab.empty;
wenzelm@6550
   249
  val copy = I;
wenzelm@5819
   250
  val prep_ext = I;
wenzelm@5819
   251
  fun merge tabs = Symtab.merge (Object.eq_kind o pairself fst) tabs
wenzelm@5819
   252
    handle Symtab.DUPS kinds => err_inconsistent kinds;
wenzelm@5819
   253
  fun print _ tab = Pretty.writeln (Pretty.strs (map #1 (Symtab.dest tab)));
wenzelm@5819
   254
end;
wenzelm@5819
   255
wenzelm@5819
   256
structure ProofDataData = TheoryDataFun(ProofDataDataArgs);
wenzelm@5819
   257
val print_proof_data = ProofDataData.print;
wenzelm@5819
   258
wenzelm@5819
   259
wenzelm@5819
   260
(* init proof data *)
wenzelm@5819
   261
wenzelm@5819
   262
fun init_data kind meths thy =
wenzelm@5819
   263
  let
wenzelm@5819
   264
    val name = Object.name_of_kind kind;
wenzelm@5819
   265
    val tab = Symtab.update_new ((name, (kind, meths)), ProofDataData.get thy)
wenzelm@5819
   266
      handle Symtab.DUP _ => err_dup_init thy name;
wenzelm@5819
   267
  in thy |> ProofDataData.put tab end;
wenzelm@5819
   268
wenzelm@5819
   269
wenzelm@5819
   270
(* access data *)
wenzelm@5819
   271
wenzelm@5819
   272
fun lookup_data (ctxt as Context {data, ...}) kind =
wenzelm@5819
   273
  let
wenzelm@5819
   274
    val thy = theory_of ctxt;
wenzelm@5819
   275
    val name = Object.name_of_kind kind;
wenzelm@5819
   276
  in
wenzelm@5819
   277
    (case Symtab.lookup (ProofDataData.get thy, name) of
wenzelm@5819
   278
      Some (k, meths) =>
wenzelm@5819
   279
        if Object.eq_kind (kind, k) then
wenzelm@5819
   280
          (case Symtab.lookup (data, name) of
wenzelm@5819
   281
            Some x => (x, meths)
wenzelm@5819
   282
          | None => err_undef ctxt name)
wenzelm@5819
   283
        else err_access ctxt name
wenzelm@5819
   284
    | None => err_uninit ctxt name)
wenzelm@5819
   285
  end;
wenzelm@5819
   286
wenzelm@5819
   287
fun get_data kind f ctxt =
wenzelm@5819
   288
  let val (x, _) = lookup_data ctxt kind
wenzelm@5819
   289
  in f x handle Match => Object.kind_error kind end;
wenzelm@5819
   290
wenzelm@5819
   291
fun print_data kind ctxt =
wenzelm@5819
   292
  let val (x, (_, prt)) = lookup_data ctxt kind
wenzelm@5819
   293
  in prt ctxt x end;
wenzelm@5819
   294
wenzelm@5819
   295
fun put_data kind f x ctxt =
wenzelm@5819
   296
  (lookup_data ctxt kind;
wenzelm@5819
   297
    ctxt |> map_context (fn (thy, data, asms, binds, thms, defs) =>
wenzelm@5819
   298
      (thy, Symtab.update ((Object.name_of_kind kind, f x), data), asms, binds, thms, defs)));
wenzelm@5819
   299
wenzelm@5819
   300
wenzelm@5819
   301
(* init context *)
wenzelm@5819
   302
wenzelm@5874
   303
fun init thy =
wenzelm@5874
   304
  let val data = Symtab.map (fn (_, (f, _)) => f thy) (ProofDataData.get thy) in
wenzelm@6797
   305
    make_context (thy, data, (([], []), ([], [])), Vartab.empty, Symtab.empty,
wenzelm@7663
   306
      (Vartab.empty, Vartab.empty, 0, []))
wenzelm@7663
   307
        (*Note: maxidx = 0 is workaround for obscure bug in Unify.smash_unifiers*)
wenzelm@5819
   308
  end;
wenzelm@5819
   309
wenzelm@5819
   310
wenzelm@7663
   311
(** default sorts and types **)
wenzelm@7663
   312
wenzelm@7663
   313
fun def_sort (Context {defs = (_, sorts, _, _), ...}) xi = Vartab.lookup (sorts, xi);
wenzelm@7663
   314
wenzelm@7663
   315
fun def_type (Context {binds, defs = (types, _, _, _), ...}) is_pat xi =
wenzelm@7663
   316
  (case Vartab.lookup (types, xi) of
wenzelm@7663
   317
    None =>
wenzelm@7663
   318
      if is_pat then None
wenzelm@7663
   319
      else (case Vartab.lookup (binds, xi) of Some (Some (_, T)) => Some T | _ => None)
wenzelm@7663
   320
  | some => some);
wenzelm@7663
   321
wenzelm@7663
   322
wenzelm@5819
   323
wenzelm@5819
   324
(** prepare types **)
wenzelm@5819
   325
wenzelm@7663
   326
fun read_typ ctxt s =
wenzelm@7663
   327
  transform_error (Sign.read_typ (sign_of ctxt, def_sort ctxt)) s
wenzelm@7663
   328
    handle ERROR_MESSAGE msg => raise CONTEXT (msg, ctxt);
wenzelm@5819
   329
wenzelm@5819
   330
fun cert_typ ctxt raw_T =
wenzelm@5819
   331
  Sign.certify_typ (sign_of ctxt) raw_T
wenzelm@5819
   332
    handle TYPE (msg, _, _) => raise CONTEXT (msg, ctxt);
wenzelm@5819
   333
wenzelm@5819
   334
wenzelm@5819
   335
wenzelm@5819
   336
(** prepare terms and propositions **)
wenzelm@5819
   337
wenzelm@5819
   338
(*
wenzelm@5819
   339
  (1) read / certify wrt. signature of context
wenzelm@5819
   340
  (2) intern Skolem constants
wenzelm@5819
   341
  (3) expand term bindings
wenzelm@5819
   342
*)
wenzelm@5819
   343
wenzelm@5819
   344
wenzelm@5819
   345
(* read / certify wrt. signature *)     (*exception ERROR*) (*exception TERM*)
wenzelm@5819
   346
wenzelm@5874
   347
fun read_def_termTs freeze sg (types, sorts, used) sTs =
wenzelm@5874
   348
  let val (cts, env) = Thm.read_def_cterms (sg, types, sorts) used freeze sTs
wenzelm@5874
   349
  in (map Thm.term_of cts, env) end;
wenzelm@5874
   350
wenzelm@5874
   351
fun read_def_termT freeze sg defs sT = apfst hd (read_def_termTs freeze sg defs [sT]);
wenzelm@5874
   352
wenzelm@5819
   353
wenzelm@6762
   354
fun read_term_sg freeze sg (defs as (_, _, used)) s =
wenzelm@7505
   355
  #1 (read_def_termT freeze sg defs (s, dummyT));
wenzelm@5819
   356
wenzelm@6762
   357
fun read_prop_sg freeze sg defs s =
wenzelm@6762
   358
  #1 (read_def_termT freeze sg defs (s, propT));
wenzelm@5819
   359
wenzelm@5819
   360
wenzelm@5819
   361
fun cert_term_sg sg t = Thm.term_of (Thm.cterm_of sg t);
wenzelm@5819
   362
wenzelm@5819
   363
fun cert_prop_sg sg tm =
wenzelm@5819
   364
  let
wenzelm@5819
   365
    val ctm = Thm.cterm_of sg tm;
wenzelm@5819
   366
    val {t, T, ...} = Thm.rep_cterm ctm;
wenzelm@5819
   367
  in
wenzelm@5819
   368
    if T = propT then t
wenzelm@5819
   369
    else raise TERM ("Term not of type prop", [t])
wenzelm@5819
   370
  end;
wenzelm@5819
   371
wenzelm@5819
   372
wenzelm@5819
   373
(* intern_skolem *)
wenzelm@5819
   374
wenzelm@5819
   375
fun get_skolem (Context {asms = (_, (fixes, _)), ...}) x = assoc (fixes, x);
wenzelm@5819
   376
wenzelm@5819
   377
fun check_skolem ctxt check x =
wenzelm@7200
   378
  if not check then x
wenzelm@7200
   379
  else if not (Syntax.is_identifier x) then
wenzelm@7200
   380
    raise CONTEXT ("Bad variable name: " ^ quote x, ctxt)
wenzelm@7200
   381
  else if can Syntax.dest_skolem x then
wenzelm@5819
   382
    raise CONTEXT ("Illegal reference to internal Skolem constant: " ^ quote x, ctxt)
wenzelm@5819
   383
  else x;
wenzelm@5819
   384
wenzelm@5819
   385
fun intern_skolem ctxt check =
wenzelm@5819
   386
  let
wenzelm@5819
   387
    fun intern (t as Free (x, T)) =
wenzelm@5819
   388
          (case get_skolem ctxt (check_skolem ctxt check x) of
wenzelm@5819
   389
            Some x' => Free (x', T)
wenzelm@5819
   390
          | None => t)
wenzelm@5819
   391
      | intern (t $ u) = intern t $ intern u
wenzelm@5819
   392
      | intern (Abs (x, T, t)) = Abs (x, T, intern t)
wenzelm@5819
   393
      | intern a = a;
wenzelm@5819
   394
  in intern end;
wenzelm@5819
   395
wenzelm@5819
   396
wenzelm@5819
   397
(* norm_term *)
wenzelm@5819
   398
wenzelm@5819
   399
(*beta normal form for terms (not eta normal form), chase variables in
wenzelm@5819
   400
  bindings environment (code taken from Pure/envir.ML)*)
wenzelm@5819
   401
wenzelm@5819
   402
fun norm_term (ctxt as Context {binds, ...}) =
wenzelm@5819
   403
  let
wenzelm@5819
   404
    (*raised when norm has no effect on a term, to do sharing instead of copying*)
wenzelm@5819
   405
    exception SAME;
wenzelm@5819
   406
wenzelm@5819
   407
    fun norm (t as Var (xi, T)) =
wenzelm@5819
   408
          (case Vartab.lookup (binds, xi) of
wenzelm@7606
   409
            Some (Some (u, U)) =>
wenzelm@5819
   410
              if T = U then (norm u handle SAME => u)
wenzelm@5819
   411
              else raise TYPE ("norm_term: ill-typed variable assigment", [T, U], [t, u])
wenzelm@7606
   412
          | _ => raise CONTEXT ("Unbound schematic variable: " ^ Syntax.string_of_vname xi, ctxt))
wenzelm@5819
   413
      | norm (Abs (a, T, body)) =  Abs (a, T, norm body)
wenzelm@5819
   414
      | norm (Abs (_, _, body) $ t) = normh (subst_bound (t, body))
wenzelm@5819
   415
      | norm (f $ t) =
wenzelm@5819
   416
          ((case norm f of
wenzelm@5819
   417
            Abs (_, _, body) => normh (subst_bound (t, body))
wenzelm@5819
   418
          | nf => nf $ (norm t handle SAME => t)) handle SAME => f $ norm t)
wenzelm@5819
   419
      | norm _ =  raise SAME
wenzelm@5819
   420
    and normh t = norm t handle SAME => t
wenzelm@5819
   421
  in normh end;
wenzelm@5819
   422
wenzelm@5819
   423
wenzelm@6550
   424
(* dummy patterns *)
wenzelm@6550
   425
wenzelm@6762
   426
local
wenzelm@6762
   427
wenzelm@6560
   428
fun is_dummy (Const (c, _)) = c = PureThy.dummy_patternN
wenzelm@6550
   429
  | is_dummy _ = false;
wenzelm@6550
   430
wenzelm@6762
   431
fun prep_dummy (i, t) =
wenzelm@6762
   432
  if is_dummy t then (i + 1, Var (("_dummy_", i), Term.fastype_of t)) else (i, t);
wenzelm@6762
   433
wenzelm@6762
   434
in
wenzelm@6762
   435
wenzelm@6762
   436
fun prepare_dummies tm = #2 (Term.foldl_map_aterms prep_dummy (1, tm));
wenzelm@6762
   437
wenzelm@6550
   438
fun reject_dummies ctxt tm =
wenzelm@6550
   439
  if foldl_aterms (fn (ok, t) => ok andalso not (is_dummy t)) (true, tm) then tm
wenzelm@6550
   440
  else raise CONTEXT ("Illegal dummy pattern(s) in term", ctxt);
wenzelm@6550
   441
wenzelm@6762
   442
end;
wenzelm@6550
   443
wenzelm@6550
   444
wenzelm@5819
   445
(* read terms *)
wenzelm@5819
   446
wenzelm@7663
   447
fun gen_read read app is_pat (ctxt as Context {defs = (_, _, _, used), ...}) s =
wenzelm@7663
   448
  (transform_error (read (sign_of ctxt) (def_type ctxt is_pat, def_sort ctxt, used)) s
wenzelm@7663
   449
    handle TERM (msg, _) => raise CONTEXT (msg, ctxt)
wenzelm@7663
   450
    | ERROR_MESSAGE msg => raise CONTEXT (msg, ctxt))
wenzelm@7663
   451
  |> app (intern_skolem ctxt true)
wenzelm@7663
   452
  |> app (if is_pat then I else norm_term ctxt)
wenzelm@7663
   453
  |> app (if is_pat then prepare_dummies else (reject_dummies ctxt));
wenzelm@5819
   454
wenzelm@5874
   455
val read_termTs = gen_read (read_def_termTs false) (apfst o map) false;
wenzelm@6762
   456
val read_term = gen_read (read_term_sg true) I false;
wenzelm@6762
   457
val read_prop = gen_read (read_prop_sg true) I false;
wenzelm@6762
   458
val read_term_pat = gen_read (read_term_sg false) I true;
wenzelm@6762
   459
val read_prop_pat = gen_read (read_prop_sg false) I true;
wenzelm@5819
   460
wenzelm@5819
   461
wenzelm@5819
   462
(* certify terms *)
wenzelm@5819
   463
wenzelm@5819
   464
fun gen_cert cert is_pat ctxt t =
wenzelm@5819
   465
  (cert (sign_of ctxt) t handle TERM (msg, _) => raise CONTEXT (msg, ctxt))
wenzelm@5819
   466
  |> intern_skolem ctxt false
wenzelm@5819
   467
  |> (if is_pat then I else norm_term ctxt);
wenzelm@5819
   468
wenzelm@5819
   469
val cert_term = gen_cert cert_term_sg false;
wenzelm@5819
   470
val cert_prop = gen_cert cert_prop_sg false;
wenzelm@5935
   471
val cert_term_pat = gen_cert cert_term_sg true;
wenzelm@5935
   472
val cert_prop_pat = gen_cert cert_prop_sg true;
wenzelm@5819
   473
wenzelm@5819
   474
wenzelm@5819
   475
(* declare terms *)
wenzelm@5819
   476
wenzelm@5819
   477
val ins_types = foldl_aterms
wenzelm@5819
   478
  (fn (types, Free (x, T)) => Vartab.update (((x, ~1), T), types)
wenzelm@5819
   479
    | (types, Var v) => Vartab.update (v, types)
wenzelm@5819
   480
    | (types, _) => types);
wenzelm@5819
   481
wenzelm@5819
   482
val ins_sorts = foldl_types (foldl_atyps
wenzelm@5819
   483
  (fn (sorts, TFree (x, S)) => Vartab.update (((x, ~1), S), sorts)
wenzelm@5819
   484
    | (sorts, TVar v) => Vartab.update (v, sorts)
wenzelm@5819
   485
    | (sorts, _) => sorts));
wenzelm@5819
   486
wenzelm@5819
   487
val ins_used = foldl_types (foldl_atyps
wenzelm@5819
   488
  (fn (used, TFree (x, _)) => x ins used
wenzelm@5819
   489
    | (used, TVar ((x, _), _)) => x ins used
wenzelm@5819
   490
    | (used, _) => used));
wenzelm@5819
   491
wenzelm@7663
   492
fun ins_skolem def_ty = foldr
wenzelm@5994
   493
  (fn ((x, x'), types) =>
wenzelm@7663
   494
    (case def_ty x' of
wenzelm@5994
   495
      Some T => Vartab.update (((x, ~1), T), types)
wenzelm@5994
   496
    | None => types));
wenzelm@5994
   497
wenzelm@5819
   498
fun map_defaults f = map_context
wenzelm@5819
   499
  (fn (thy, data, asms, binds, thms, defs) => (thy, data, asms, binds, thms, f defs));
wenzelm@5819
   500
wenzelm@5994
   501
fun declare (ctxt as Context {asms = (_, (fixes, _)), ...}, t) =
wenzelm@5819
   502
  ctxt
wenzelm@5819
   503
  |> map_defaults (fn (types, sorts, maxidx, used) => (ins_types (types, t), sorts, maxidx, used))
wenzelm@5819
   504
  |> map_defaults (fn (types, sorts, maxidx, used) => (types, ins_sorts (sorts, t), maxidx, used))
wenzelm@5819
   505
  |> map_defaults (fn (types, sorts, maxidx, used) => (types, sorts, maxidx, ins_used (used, t)))
wenzelm@5819
   506
  |> map_defaults (fn (types, sorts, maxidx, used) =>
wenzelm@5994
   507
      (types, sorts, Int.max (maxidx, Term.maxidx_of_term t), used))
wenzelm@5994
   508
  |> map_defaults (fn (types, sorts, maxidx, used) =>
wenzelm@5994
   509
      (ins_skolem (fn x => Vartab.lookup (types, (x, ~1))) (fixes, types), sorts, maxidx, used));
wenzelm@5819
   510
wenzelm@5819
   511
wenzelm@5819
   512
fun declare_term t ctxt = declare (ctxt, t);
wenzelm@5819
   513
fun declare_terms ts ctxt = foldl declare (ctxt, ts);
wenzelm@5819
   514
wenzelm@5874
   515
fun declare_thm thm ctxt =
wenzelm@5874
   516
  let val {prop, hyps, ...} = Thm.rep_thm thm
wenzelm@5874
   517
  in ctxt |> declare_terms (prop :: hyps) end;
wenzelm@5874
   518
wenzelm@5819
   519
wenzelm@5819
   520
wenzelm@5819
   521
(** bindings **)
wenzelm@5819
   522
wenzelm@5819
   523
(* update_binds *)
wenzelm@5819
   524
wenzelm@7606
   525
fun del_bind (ctxt, xi) =
wenzelm@7606
   526
  ctxt
wenzelm@7606
   527
  |> map_context (fn (thy, data, asms, binds, thms, defs) =>
wenzelm@7606
   528
      (thy, data, asms, Vartab.update ((xi, None), binds), thms, defs));
wenzelm@7606
   529
wenzelm@5819
   530
fun upd_bind (ctxt, (xi, t)) =
wenzelm@5819
   531
  let val T = fastype_of t in
wenzelm@5819
   532
    ctxt
wenzelm@5819
   533
    |> declare_term t
wenzelm@5819
   534
    |> map_context (fn (thy, data, asms, binds, thms, defs) =>
wenzelm@7606
   535
        (thy, data, asms, Vartab.update ((xi, Some (t, T)), binds), thms, defs))
wenzelm@5819
   536
  end;
wenzelm@5819
   537
wenzelm@7606
   538
fun del_upd_bind (ctxt, (xi, None)) = del_bind (ctxt, xi)
wenzelm@7606
   539
  | del_upd_bind (ctxt, (xi, Some t)) = upd_bind (ctxt, (xi, t));
wenzelm@7606
   540
wenzelm@5819
   541
fun update_binds bs ctxt = foldl upd_bind (ctxt, bs);
wenzelm@7663
   542
fun update_binds_env env =      (*Note: Envir.norm_term ensures proper type instantiation*)
wenzelm@7479
   543
  update_binds (map (apsnd (Envir.norm_term env)) (Envir.alist_of env));
wenzelm@5819
   544
wenzelm@7606
   545
fun delete_update_binds bs ctxt = foldl del_upd_bind (ctxt, bs);
wenzelm@7606
   546
wenzelm@5819
   547
wenzelm@5819
   548
(* add_binds(_i) -- sequential *)
wenzelm@5819
   549
wenzelm@5819
   550
fun gen_bind prep (ctxt, (xi as (x, _), raw_t)) =
wenzelm@7606
   551
  ctxt |> delete_update_binds [(xi, apsome (prep ctxt) raw_t)];
wenzelm@5819
   552
wenzelm@5819
   553
fun gen_binds prep binds ctxt = foldl (gen_bind prep) (ctxt, binds);
wenzelm@5819
   554
wenzelm@5819
   555
val add_binds = gen_binds read_term;
wenzelm@5819
   556
val add_binds_i = gen_binds cert_term;
wenzelm@5819
   557
wenzelm@5819
   558
wenzelm@5819
   559
(* match_binds(_i) -- parallel *)
wenzelm@5819
   560
wenzelm@5935
   561
fun prep_declare_match (prep_pat, prep) (ctxt, (raw_pats, raw_t)) =
wenzelm@5819
   562
  let
wenzelm@5935
   563
    val t = prep ctxt raw_t;
wenzelm@5994
   564
    val ctxt' = ctxt |> declare_term t;
wenzelm@6931
   565
    val matches = map (fn (f, raw_pat) => (prep_pat ctxt' raw_pat, f t)) raw_pats;
wenzelm@6931
   566
  in (ctxt', (matches, t)) end;
wenzelm@5819
   567
wenzelm@5935
   568
fun gen_match_binds _ [] ctxt = ctxt
wenzelm@6931
   569
  | gen_match_binds prepp args ctxt =
wenzelm@5935
   570
      let
wenzelm@6931
   571
        val raw_pairs = map (apfst (map (pair I))) args;
wenzelm@5935
   572
        val (ctxt', matches) = foldl_map (prep_declare_match prepp) (ctxt, raw_pairs);
wenzelm@5935
   573
        val pairs = flat (map #1 matches);
wenzelm@5935
   574
        val Context {defs = (_, _, maxidx, _), ...} = ctxt';
wenzelm@5935
   575
        val envs = Unify.smash_unifiers (sign_of ctxt', Envir.empty maxidx, pairs);
wenzelm@5935
   576
        val env =
wenzelm@5935
   577
          (case Seq.pull envs of
wenzelm@5935
   578
            None => raise CONTEXT ("Pattern match failed!", ctxt')
wenzelm@5935
   579
          | Some (env, _) => env);
wenzelm@5935
   580
      in ctxt' |> update_binds_env env end;
wenzelm@5935
   581
wenzelm@5935
   582
val match_binds = gen_match_binds (read_term_pat, read_term);
wenzelm@5935
   583
val match_binds_i = gen_match_binds (cert_term_pat, cert_term);
wenzelm@5935
   584
wenzelm@5935
   585
wenzelm@5935
   586
(* bind proposition patterns *)
wenzelm@5935
   587
wenzelm@6931
   588
fun gen_bind_propp prepp (ctxt, (raw_prop, (raw_pats1, raw_pats2))) =
wenzelm@6931
   589
  let
wenzelm@6931
   590
    val raw_pats = map (pair I) raw_pats1 @ map (pair Logic.strip_imp_concl) raw_pats2;
wenzelm@6931
   591
    val (ctxt', (pairs, prop)) = prep_declare_match prepp (ctxt, (raw_pats, raw_prop));
wenzelm@5935
   592
  in (ctxt' |> match_binds_i (map (apfst single) pairs), prop) end;
wenzelm@5935
   593
wenzelm@5935
   594
val bind_propp = gen_bind_propp (read_prop_pat, read_prop);
wenzelm@5935
   595
val bind_propp_i = gen_bind_propp (cert_prop_pat, cert_prop);
wenzelm@5819
   596
wenzelm@5819
   597
wenzelm@6789
   598
(* auto binds *)
wenzelm@6789
   599
wenzelm@6789
   600
val auto_bind_goal = add_binds_i o AutoBind.goal;
wenzelm@6797
   601
val auto_bind_facts = add_binds_i oo AutoBind.facts;
wenzelm@6789
   602
wenzelm@6789
   603
wenzelm@5819
   604
wenzelm@5819
   605
(** theorems **)
wenzelm@5819
   606
wenzelm@6091
   607
(* get_thm(s) *)
wenzelm@5819
   608
wenzelm@6091
   609
fun get_thm (ctxt as Context {thy, thms, ...}) name =
wenzelm@5819
   610
  (case Symtab.lookup (thms, name) of
wenzelm@7606
   611
    Some (Some [th]) => th
wenzelm@7606
   612
  | Some (Some _) => raise CONTEXT ("Single theorem expected: " ^ quote name, ctxt)
wenzelm@7606
   613
  | _ => (PureThy.get_thm thy name handle THEORY (msg, _) => raise CONTEXT (msg, ctxt)));
wenzelm@5819
   614
wenzelm@6091
   615
fun get_thms (ctxt as Context {thy, thms, ...}) name =
wenzelm@5819
   616
  (case Symtab.lookup (thms, name) of
wenzelm@7606
   617
    Some (Some ths) => ths
wenzelm@7606
   618
  | _ => (PureThy.get_thms thy name handle THEORY (msg, _) => raise CONTEXT (msg, ctxt)));
wenzelm@5819
   619
wenzelm@6091
   620
fun get_thmss ctxt names = flat (map (get_thms ctxt) names);
wenzelm@5819
   621
wenzelm@5819
   622
wenzelm@6091
   623
(* put_thm(s) *)
wenzelm@5819
   624
wenzelm@7479
   625
fun put_thms ("", _) = I
wenzelm@7479
   626
  | put_thms (name, ths) = map_context
wenzelm@7479
   627
      (fn (thy, data, asms, binds, thms, defs) =>
wenzelm@7606
   628
        (thy, data, asms, binds, Symtab.update ((name, Some ths), thms), defs));
wenzelm@5819
   629
wenzelm@6091
   630
fun put_thm (name, th) = put_thms (name, [th]);
wenzelm@5819
   631
wenzelm@6091
   632
fun put_thmss [] ctxt = ctxt
wenzelm@6091
   633
  | put_thmss (th :: ths) ctxt = ctxt |> put_thms th |> put_thmss ths;
wenzelm@5819
   634
wenzelm@5819
   635
wenzelm@7606
   636
(* reset_thms *)
wenzelm@7606
   637
wenzelm@7606
   638
fun reset_thms name = map_context (fn (thy, data, asms, binds, thms, defs) =>
wenzelm@7606
   639
  (thy, data, asms, binds, Symtab.update ((name, None), thms), defs));
wenzelm@7606
   640
wenzelm@7606
   641
wenzelm@6091
   642
(* have_thmss *)
wenzelm@5819
   643
wenzelm@6875
   644
fun have_thmss more_ths name more_attrs ths_attrs ctxt =
wenzelm@5819
   645
  let
wenzelm@5819
   646
    fun app ((ct, ths), (th, attrs)) =
wenzelm@6091
   647
      let val (ct', th') = Thm.applys_attributes ((ct, th), attrs @ more_attrs)
wenzelm@5819
   648
      in (ct', th' :: ths) end
wenzelm@5819
   649
    val (ctxt', rev_thms) = foldl app ((ctxt, []), ths_attrs);
wenzelm@6875
   650
    val thms = flat (rev rev_thms) @ more_ths;
wenzelm@6091
   651
  in (ctxt' |> put_thms (name, thms), (name, thms)) end;
wenzelm@5819
   652
wenzelm@5819
   653
wenzelm@5819
   654
wenzelm@5819
   655
(** assumptions **)
wenzelm@5819
   656
wenzelm@5819
   657
(* get assumptions *)
wenzelm@5819
   658
wenzelm@6847
   659
fun assumptions (Context {asms = ((asms, _), _), ...}) = asms;
wenzelm@5819
   660
fun fixed_names (Context {asms = (_, (fixes, _)), ...}) = map #2 fixes;
wenzelm@5819
   661
wenzelm@5819
   662
wenzelm@5819
   663
(* assume *)
wenzelm@5819
   664
wenzelm@7270
   665
local
wenzelm@6797
   666
wenzelm@7270
   667
fun gen_assm prepp tac (ctxt, (name, attrs, raw_prop_pats)) =
wenzelm@5819
   668
  let
wenzelm@5935
   669
    val (ctxt', props) = foldl_map prepp (ctxt, raw_prop_pats);
wenzelm@6797
   670
    val Context {defs = (_, _, maxidx, _), ...} = ctxt';
wenzelm@5819
   671
wenzelm@7575
   672
    val cprops = map (Thm.cterm_of (sign_of ctxt')) props;
wenzelm@6847
   673
    val cprops_tac = map (rpair tac) cprops;
wenzelm@6996
   674
    val asms = map (Drule.forall_elim_vars (maxidx + 1) o Drule.assume_goal) cprops;
wenzelm@5919
   675
wenzelm@5919
   676
    val ths = map (fn th => ([th], [])) asms;
wenzelm@6091
   677
    val (ctxt'', (_, thms)) =
wenzelm@5819
   678
      ctxt'
wenzelm@6797
   679
      |> auto_bind_facts name props
wenzelm@6875
   680
      |> have_thmss [] name (attrs @ [Drule.tag_assumption]) ths;
wenzelm@5819
   681
wenzelm@5819
   682
    val ctxt''' =
wenzelm@5819
   683
      ctxt''
wenzelm@6797
   684
      |> map_context (fn (thy, data, ((asms_ct, asms_th), fixes), binds, thms, defs) =>
wenzelm@6847
   685
        (thy, data, ((asms_ct @ cprops_tac, asms_th @ [(name, asms)]), fixes), binds, thms, defs));
wenzelm@7270
   686
  in (ctxt''', (name, thms)) end;
wenzelm@7270
   687
wenzelm@7270
   688
fun gen_assms prepp tac args ctxt =
wenzelm@7270
   689
  let val (ctxt', thmss) = foldl_map (gen_assm prepp tac) (ctxt, args)
wenzelm@7270
   690
  in (ctxt', (thmss, prems_of ctxt')) end;
wenzelm@5819
   691
wenzelm@7270
   692
in
wenzelm@7270
   693
wenzelm@7270
   694
val assume = gen_assms bind_propp;
wenzelm@7270
   695
val assume_i = gen_assms bind_propp_i;
wenzelm@7270
   696
wenzelm@7270
   697
end;
wenzelm@5819
   698
wenzelm@5819
   699
wenzelm@5819
   700
(* fix *)
wenzelm@5819
   701
wenzelm@5819
   702
fun gen_fix prep check (ctxt, (x, raw_T)) =
wenzelm@7486
   703
  (check_skolem ctxt check x;
wenzelm@7486
   704
    ctxt
wenzelm@7663
   705
    |> (case (apsome o prep) ctxt raw_T of None => I | Some T => declare_term (Free (x, T)))
wenzelm@7486
   706
    |> map_context (fn (thy, data, (assumes, (fixes, names)), binds, thms, defs) =>
wenzelm@5819
   707
      let val x' = variant names x in
wenzelm@5819
   708
        (thy, data, (assumes, ((x, Syntax.skolem x') :: fixes, x' :: names)), binds, thms, defs)
wenzelm@7486
   709
      end));
wenzelm@5819
   710
wenzelm@7411
   711
fun gen_fixs prep check vars ctxt =
wenzelm@7411
   712
  foldl (gen_fix prep check) (ctxt, flat (map (fn (xs, T) => map (rpair T) xs) vars));
wenzelm@5819
   713
wenzelm@7663
   714
val fix = gen_fixs read_typ true;
wenzelm@7663
   715
val fix_i = gen_fixs cert_typ false;
wenzelm@5819
   716
wenzelm@6895
   717
wenzelm@5819
   718
wenzelm@5819
   719
(** theory setup **)
wenzelm@5819
   720
wenzelm@5819
   721
val setup = [ProofDataData.init];
wenzelm@5819
   722
wenzelm@5819
   723
wenzelm@5819
   724
end;