src/Pure/Isar/proof_context.ML
author wenzelm
Tue Aug 08 01:17:59 2000 +0200 (2000-08-08 ago)
changeset 9553 c2e3773475b6
parent 9540 02c51ca9c531
child 9566 0874bf3a909d
permissions -rw-r--r--
norm_hhf results;
wenzelm@5819
     1
(*  Title:      Pure/Isar/proof_context.ML
wenzelm@5819
     2
    ID:         $Id$
wenzelm@5819
     3
    Author:     Markus Wenzel, TU Muenchen
wenzelm@8807
     4
    License:    GPL (GNU GENERAL PUBLIC LICENSE)
wenzelm@5819
     5
wenzelm@5819
     6
Proof context information.
wenzelm@5819
     7
*)
wenzelm@5819
     8
wenzelm@5819
     9
signature PROOF_CONTEXT =
wenzelm@5819
    10
sig
wenzelm@5819
    11
  type context
wenzelm@9470
    12
  type exporter
wenzelm@5819
    13
  exception CONTEXT of string * context
wenzelm@5819
    14
  val theory_of: context -> theory
wenzelm@5819
    15
  val sign_of: context -> Sign.sg
wenzelm@7557
    16
  val prems_of: context -> thm list
wenzelm@6985
    17
  val show_hyps: bool ref
wenzelm@6985
    18
  val pretty_thm: thm -> Pretty.T
wenzelm@6528
    19
  val verbose: bool ref
wenzelm@9515
    20
  val setmp_verbose: ('a -> 'b) -> 'a -> 'b
wenzelm@5819
    21
  val print_binds: context -> unit
wenzelm@5819
    22
  val print_thms: context -> unit
wenzelm@8373
    23
  val print_cases: context -> unit
wenzelm@8462
    24
  val pretty_prems: context -> Pretty.T list
wenzelm@8462
    25
  val pretty_context: context -> Pretty.T list
wenzelm@5819
    26
  val print_proof_data: theory -> unit
wenzelm@5874
    27
  val init: theory -> context
wenzelm@9470
    28
  val assumptions: context -> (cterm list * exporter) list
wenzelm@8616
    29
  val fixed_names: context -> string list
wenzelm@5819
    30
  val read_typ: context -> string -> typ
wenzelm@9504
    31
  val read_typ_no_norm: context -> string -> typ
wenzelm@5819
    32
  val cert_typ: context -> typ -> typ
wenzelm@9504
    33
  val cert_typ_no_norm: context -> typ -> typ
wenzelm@9291
    34
  val intern_skolem: context -> term -> term
wenzelm@9133
    35
  val extern_skolem: context -> term -> term
wenzelm@5874
    36
  val read_termTs: context -> (string * typ) list -> term list * (indexname * typ) list
wenzelm@5819
    37
  val read_term: context -> string -> term
wenzelm@5819
    38
  val read_prop: context -> string -> term
wenzelm@8096
    39
  val read_termT_pats: context -> (string * typ) list -> term list
wenzelm@8096
    40
  val read_term_pats: typ -> context -> string list -> term list
wenzelm@8096
    41
  val read_prop_pats: context -> string list -> term list
wenzelm@5819
    42
  val cert_term: context -> term -> term
wenzelm@5819
    43
  val cert_prop: context -> term -> term
wenzelm@8096
    44
  val cert_term_pats: typ -> context -> term list -> term list
wenzelm@8096
    45
  val cert_prop_pats: context -> term list -> term list
wenzelm@5819
    46
  val declare_term: term -> context -> context
wenzelm@5819
    47
  val declare_terms: term list -> context -> context
wenzelm@7925
    48
  val warn_extra_tfrees: context -> context -> context
wenzelm@8616
    49
  val generalizeT: context -> context -> typ -> typ
wenzelm@8616
    50
  val generalize: context -> context -> term -> term
wenzelm@9470
    51
  val find_free: term -> string -> term option
wenzelm@9553
    52
  val norm_hhf: thm -> thm
wenzelm@9470
    53
  val export_wrt: bool -> context -> context option -> (thm -> thm Seq.seq) * (int -> tactic) list
wenzelm@7925
    54
  val auto_bind_goal: term -> context -> context
wenzelm@7925
    55
  val auto_bind_facts: string -> term list -> context -> context
wenzelm@8616
    56
  val match_bind: bool -> (string list * string) list -> context -> context
wenzelm@8616
    57
  val match_bind_i: bool -> (term list * term) list -> context -> context
wenzelm@8096
    58
  val read_propp: context * (string * (string list * string list))
wenzelm@8096
    59
    -> context * (term * (term list * term list))
wenzelm@8096
    60
  val cert_propp: context * (term * (term list * term list))
wenzelm@8096
    61
    -> context * (term * (term list * term list))
wenzelm@8616
    62
  val bind_propp: context * (string * (string list * string list))
wenzelm@8616
    63
    -> context * (term * (context -> context))
wenzelm@8616
    64
  val bind_propp_i: context * (term * (term list * term list))
wenzelm@8616
    65
    -> context * (term * (context -> context))
wenzelm@6091
    66
  val get_thm: context -> string -> thm
wenzelm@6091
    67
  val get_thms: context -> string -> thm list
wenzelm@6091
    68
  val get_thmss: context -> string list -> thm list
wenzelm@6091
    69
  val put_thm: string * thm -> context -> context
wenzelm@6091
    70
  val put_thms: string * thm list -> context -> context
wenzelm@6091
    71
  val put_thmss: (string * thm list) list -> context -> context
wenzelm@7606
    72
  val reset_thms: string -> context -> context
wenzelm@9196
    73
  val have_thmss:
wenzelm@9196
    74
    ((string * context attribute list) * (thm list * context attribute list) list) list ->
wenzelm@9196
    75
      context -> context * (string * thm list) list
wenzelm@9470
    76
  val assume: exporter
wenzelm@7270
    77
    -> (string * context attribute list * (string * (string list * string list)) list) list
wenzelm@7270
    78
    -> context -> context * ((string * thm list) list * thm list)
wenzelm@9470
    79
  val assume_i: exporter
wenzelm@7270
    80
    -> (string * context attribute list * (term * (term list * term list)) list) list
wenzelm@7270
    81
    -> context -> context * ((string * thm list) list * thm list)
wenzelm@8096
    82
  val read_vars: context * (string list * string option) -> context * (string list * typ option)
wenzelm@8096
    83
  val cert_vars: context * (string list * typ option) -> context * (string list * typ option)
wenzelm@7411
    84
  val fix: (string list * string option) list -> context -> context
wenzelm@7663
    85
  val fix_i: (string list * typ option) list -> context -> context
wenzelm@9291
    86
  val bind_skolem: context -> string list -> term -> term
wenzelm@8373
    87
  val get_case: context -> string -> RuleCases.T
wenzelm@8373
    88
  val add_cases: (string * RuleCases.T) list -> context -> context
wenzelm@5819
    89
  val setup: (theory -> theory) list
wenzelm@5819
    90
end;
wenzelm@5819
    91
wenzelm@8151
    92
signature PRIVATE_PROOF_CONTEXT =
wenzelm@5819
    93
sig
wenzelm@5819
    94
  include PROOF_CONTEXT
wenzelm@5819
    95
  val init_data: Object.kind -> (theory -> Object.T) * (context -> Object.T -> unit)
wenzelm@5819
    96
    -> theory -> theory
wenzelm@5819
    97
  val print_data: Object.kind -> context -> unit
wenzelm@5819
    98
  val get_data: Object.kind -> (Object.T -> 'a) -> context -> 'a
wenzelm@5819
    99
  val put_data: Object.kind -> ('a -> Object.T) -> 'a -> context -> context
wenzelm@5819
   100
end;
wenzelm@5819
   101
wenzelm@8151
   102
structure ProofContext: PRIVATE_PROOF_CONTEXT =
wenzelm@5819
   103
struct
wenzelm@5819
   104
wenzelm@5819
   105
wenzelm@5819
   106
(** datatype context **)
wenzelm@5819
   107
wenzelm@9470
   108
type exporter =
wenzelm@9470
   109
  (cterm list -> thm -> thm Seq.seq) * (bool -> int -> (int -> tactic) list);
wenzelm@9470
   110
wenzelm@5819
   111
datatype context =
wenzelm@5819
   112
  Context of
wenzelm@6847
   113
   {thy: theory,                                                        (*current theory*)
wenzelm@6847
   114
    data: Object.T Symtab.table,                                        (*user data*)
wenzelm@5819
   115
    asms:
wenzelm@9470
   116
      ((cterm list * exporter) list *                                   (*assumes: A ==> _*)
wenzelm@6931
   117
        (string * thm list) list) *
wenzelm@6847
   118
      ((string * string) list * string list),                           (*fixes: !!x. _*)
wenzelm@7606
   119
    binds: (term * typ) option Vartab.table,                            (*term bindings*)
wenzelm@7606
   120
    thms: thm list option Symtab.table,                                 (*local thms*)
wenzelm@8426
   121
    cases: (string * RuleCases.T) list,                                 (*local contexts*)
wenzelm@5819
   122
    defs:
wenzelm@6847
   123
      typ Vartab.table *                                                (*type constraints*)
wenzelm@6847
   124
      sort Vartab.table *                                               (*default sorts*)
wenzelm@8616
   125
      (string list * term list Symtab.table)};                          (*used type variables*)
wenzelm@5819
   126
wenzelm@5819
   127
exception CONTEXT of string * context;
wenzelm@5819
   128
wenzelm@5819
   129
wenzelm@8373
   130
fun make_context (thy, data, asms, binds, thms, cases, defs) =
wenzelm@8373
   131
  Context {thy = thy, data = data, asms = asms, binds = binds, thms = thms,
wenzelm@8373
   132
    cases = cases, defs = defs};
wenzelm@5819
   133
wenzelm@8373
   134
fun map_context f (Context {thy, data, asms, binds, thms, cases, defs}) =
wenzelm@8373
   135
  make_context (f (thy, data, asms, binds, thms, cases, defs));
wenzelm@5819
   136
wenzelm@5819
   137
fun theory_of (Context {thy, ...}) = thy;
wenzelm@5819
   138
val sign_of = Theory.sign_of o theory_of;
wenzelm@5819
   139
wenzelm@7270
   140
fun prems_of (Context {asms = ((_, asms), _), ...}) = flat (map #2 asms);
wenzelm@7270
   141
wenzelm@5819
   142
wenzelm@5819
   143
wenzelm@5819
   144
(** print context information **)
wenzelm@5819
   145
wenzelm@6985
   146
val show_hyps = ref false;
wenzelm@7575
   147
wenzelm@7575
   148
fun pretty_thm thm =
wenzelm@7575
   149
  if ! show_hyps then setmp Display.show_hyps true Display.pretty_thm_no_quote thm
wenzelm@7575
   150
  else Display.pretty_cterm (#prop (Thm.crep_thm thm));
wenzelm@6985
   151
wenzelm@6528
   152
val verbose = ref false;
wenzelm@8373
   153
fun verb f x = if ! verbose then f (x ()) else [];
wenzelm@8462
   154
fun verb_single x = verb Library.single x;
wenzelm@5819
   155
wenzelm@9515
   156
fun setmp_verbose f x = Library.setmp verbose true f x;
wenzelm@9515
   157
wenzelm@8462
   158
fun pretty_items prt name items =
wenzelm@5819
   159
  let
wenzelm@8462
   160
    fun prt_itms (name, [x]) = Pretty.block [Pretty.str (name ^ ":"), Pretty.brk 1, prt x]
wenzelm@8462
   161
      | prt_itms (name, xs) = Pretty.big_list (name ^ ":") (map prt xs);
wenzelm@6721
   162
  in
wenzelm@6847
   163
    if null items andalso not (! verbose) then []
wenzelm@8462
   164
    else [Pretty.big_list name (map prt_itms items)]
wenzelm@6721
   165
  end;
wenzelm@5819
   166
wenzelm@5819
   167
wenzelm@5819
   168
(* term bindings *)
wenzelm@5819
   169
wenzelm@7606
   170
val smash_option = fn (_, None) => None | (xi, Some b) => Some (xi, b);
wenzelm@7606
   171
wenzelm@8462
   172
fun pretty_binds (ctxt as Context {binds, ...}) =
wenzelm@5819
   173
  let
wenzelm@7575
   174
    val prt_term = Sign.pretty_term (sign_of ctxt);
wenzelm@8462
   175
    fun prt_bind (xi, (t, T)) = prt_term (Logic.mk_equals (Var (xi, T), t));
wenzelm@7606
   176
    val bs = mapfilter smash_option (Vartab.dest binds);
wenzelm@6721
   177
  in
wenzelm@7606
   178
    if null bs andalso not (! verbose) then []
wenzelm@8462
   179
    else [Pretty.big_list "term bindings:" (map prt_bind bs)]
wenzelm@6721
   180
  end;
wenzelm@5819
   181
wenzelm@8462
   182
val print_binds = Pretty.writeln o Pretty.chunks o pretty_binds;
wenzelm@6847
   183
wenzelm@5819
   184
wenzelm@5819
   185
(* local theorems *)
wenzelm@5819
   186
wenzelm@8462
   187
fun pretty_thms (Context {thms, ...}) =
wenzelm@9274
   188
  pretty_items pretty_thm "facts:" (mapfilter smash_option (Symtab.dest thms));
wenzelm@6847
   189
wenzelm@8462
   190
val print_thms = Pretty.writeln o Pretty.chunks o pretty_thms;
wenzelm@5819
   191
wenzelm@5819
   192
wenzelm@8373
   193
(* local contexts *)
wenzelm@8373
   194
wenzelm@8462
   195
fun pretty_cases (ctxt as Context {cases, ...}) =
wenzelm@8373
   196
  let
wenzelm@8373
   197
    val prt_term = Sign.pretty_term (sign_of ctxt);
wenzelm@8373
   198
wenzelm@8373
   199
    fun prt_sect _ _ [] = []
wenzelm@8373
   200
      | prt_sect s prt xs = [Pretty.block (Pretty.breaks (Pretty.str s :: map prt xs))];
wenzelm@8373
   201
wenzelm@8373
   202
    fun prt_case (name, (xs, ts)) = Pretty.block (Pretty.breaks
wenzelm@8373
   203
      (Pretty.str (name ^ ":") ::
wenzelm@8373
   204
        prt_sect "fix" (prt_term o Free) xs @
wenzelm@8373
   205
        prt_sect "assume" (Pretty.quote o prt_term) ts));
wenzelm@8426
   206
wenzelm@8426
   207
    val cases' = rev (Library.gen_distinct Library.eq_fst cases);
wenzelm@8373
   208
  in
wenzelm@8426
   209
    if null cases andalso not (! verbose) then []
wenzelm@8462
   210
    else [Pretty.big_list "cases:" (map prt_case cases')]
wenzelm@8373
   211
  end;
wenzelm@8373
   212
wenzelm@8462
   213
val print_cases = Pretty.writeln o Pretty.chunks o pretty_cases;
wenzelm@8373
   214
wenzelm@8373
   215
wenzelm@5819
   216
(* main context *)
wenzelm@5819
   217
wenzelm@8462
   218
fun pretty_prems ctxt =
wenzelm@7575
   219
  (case prems_of ctxt of
wenzelm@7575
   220
    [] => []
wenzelm@8462
   221
  | prems => [Pretty.big_list "prems:" (map pretty_thm prems)]);
wenzelm@7575
   222
wenzelm@8462
   223
fun pretty_context (ctxt as Context {asms = (_, (fixes, _)), cases,
wenzelm@8616
   224
    defs = (types, sorts, (used, _)), ...}) =
wenzelm@5819
   225
  let
wenzelm@7575
   226
    val sign = sign_of ctxt;
wenzelm@5819
   227
wenzelm@5819
   228
    val prt_term = Sign.pretty_term sign;
wenzelm@5819
   229
    val prt_typ = Sign.pretty_typ sign;
wenzelm@5819
   230
    val prt_sort = Sign.pretty_sort sign;
wenzelm@5819
   231
wenzelm@5819
   232
    (*theory*)
wenzelm@5819
   233
    val pretty_thy = Pretty.block [Pretty.str "Theory:", Pretty.brk 1, Sign.pretty_sg sign];
wenzelm@5819
   234
wenzelm@5819
   235
    (*fixes*)
wenzelm@7606
   236
    fun prt_fix (x, x') = Pretty.block
wenzelm@7606
   237
      [prt_term (Syntax.free x), Pretty.str " =", Pretty.brk 1, prt_term (Syntax.free x')];
wenzelm@7606
   238
wenzelm@9515
   239
    fun prt_fixes [] = []
wenzelm@9515
   240
      | prt_fixes xs = [Pretty.block (Pretty.str "fixed variables:" :: Pretty.brk 1 ::
wenzelm@9515
   241
          Pretty.commas (map prt_fix xs))];
wenzelm@7200
   242
wenzelm@8373
   243
    (*defaults*)
wenzelm@5819
   244
    fun prt_atom prt prtT (x, X) = Pretty.block
wenzelm@5819
   245
      [prt x, Pretty.str " ::", Pretty.brk 1, prtT X];
wenzelm@5819
   246
wenzelm@5819
   247
    fun prt_var (x, ~1) = prt_term (Syntax.free x)
wenzelm@5819
   248
      | prt_var xi = prt_term (Syntax.var xi);
wenzelm@5819
   249
wenzelm@5819
   250
    fun prt_varT (x, ~1) = prt_typ (TFree (x, []))
wenzelm@5819
   251
      | prt_varT xi = prt_typ (TVar (xi, []));
wenzelm@5819
   252
wenzelm@5819
   253
    val prt_defT = prt_atom prt_var prt_typ;
wenzelm@5819
   254
    val prt_defS = prt_atom prt_varT prt_sort;
wenzelm@5819
   255
  in
wenzelm@8462
   256
    verb_single (K pretty_thy) @
wenzelm@9515
   257
    prt_fixes (rev (filter_out (can Syntax.dest_internal o #1) fixes)) @
wenzelm@8462
   258
    pretty_prems ctxt @
wenzelm@8462
   259
    verb pretty_binds (K ctxt) @
wenzelm@8462
   260
    verb pretty_thms (K ctxt) @
wenzelm@8462
   261
    verb pretty_cases (K ctxt) @
wenzelm@8462
   262
    verb_single (fn () => Pretty.big_list "type constraints:" (map prt_defT (Vartab.dest types))) @
wenzelm@8462
   263
    verb_single (fn () => Pretty.big_list "default sorts:" (map prt_defS (Vartab.dest sorts))) @
wenzelm@8462
   264
    verb_single (fn () => Pretty.strs ("used type variable names:" :: used))
wenzelm@5819
   265
  end;
wenzelm@5819
   266
wenzelm@5819
   267
wenzelm@5819
   268
wenzelm@5819
   269
(** user data **)
wenzelm@5819
   270
wenzelm@5819
   271
(* errors *)
wenzelm@5819
   272
wenzelm@5819
   273
fun of_theory thy = "\nof theory " ^ Sign.str_of_sg (Theory.sign_of thy);
wenzelm@5819
   274
wenzelm@5819
   275
fun err_inconsistent kinds =
wenzelm@5819
   276
  error ("Attempt to merge different versions of " ^ commas_quote kinds ^ " proof data");
wenzelm@5819
   277
wenzelm@5819
   278
fun err_dup_init thy kind =
wenzelm@5819
   279
  error ("Duplicate initialization of " ^ quote kind ^ " proof data" ^ of_theory thy);
wenzelm@5819
   280
wenzelm@5819
   281
fun err_undef ctxt kind =
wenzelm@5819
   282
  raise CONTEXT ("Tried to access undefined " ^ quote kind ^ " proof data", ctxt);
wenzelm@5819
   283
wenzelm@5819
   284
fun err_uninit ctxt kind =
wenzelm@5819
   285
  raise CONTEXT ("Tried to access uninitialized " ^ quote kind ^ " proof data" ^
wenzelm@5819
   286
    of_theory (theory_of ctxt), ctxt);
wenzelm@5819
   287
wenzelm@5819
   288
fun err_access ctxt kind =
wenzelm@5819
   289
  raise CONTEXT ("Unauthorized access to " ^ quote kind ^ " proof data" ^
wenzelm@5819
   290
    of_theory (theory_of ctxt), ctxt);
wenzelm@5819
   291
wenzelm@5819
   292
wenzelm@5819
   293
(* data kind 'Isar/proof_data' *)
wenzelm@5819
   294
wenzelm@5819
   295
structure ProofDataDataArgs =
wenzelm@5819
   296
struct
wenzelm@5819
   297
  val name = "Isar/proof_data";
wenzelm@5819
   298
  type T = (Object.kind * ((theory -> Object.T) * (context -> Object.T -> unit))) Symtab.table;
wenzelm@5819
   299
wenzelm@5819
   300
  val empty = Symtab.empty;
wenzelm@6550
   301
  val copy = I;
wenzelm@5819
   302
  val prep_ext = I;
wenzelm@5819
   303
  fun merge tabs = Symtab.merge (Object.eq_kind o pairself fst) tabs
wenzelm@5819
   304
    handle Symtab.DUPS kinds => err_inconsistent kinds;
wenzelm@5819
   305
  fun print _ tab = Pretty.writeln (Pretty.strs (map #1 (Symtab.dest tab)));
wenzelm@5819
   306
end;
wenzelm@5819
   307
wenzelm@5819
   308
structure ProofDataData = TheoryDataFun(ProofDataDataArgs);
wenzelm@5819
   309
val print_proof_data = ProofDataData.print;
wenzelm@5819
   310
wenzelm@5819
   311
wenzelm@5819
   312
(* init proof data *)
wenzelm@5819
   313
wenzelm@5819
   314
fun init_data kind meths thy =
wenzelm@5819
   315
  let
wenzelm@5819
   316
    val name = Object.name_of_kind kind;
wenzelm@5819
   317
    val tab = Symtab.update_new ((name, (kind, meths)), ProofDataData.get thy)
wenzelm@5819
   318
      handle Symtab.DUP _ => err_dup_init thy name;
wenzelm@5819
   319
  in thy |> ProofDataData.put tab end;
wenzelm@5819
   320
wenzelm@5819
   321
wenzelm@5819
   322
(* access data *)
wenzelm@5819
   323
wenzelm@5819
   324
fun lookup_data (ctxt as Context {data, ...}) kind =
wenzelm@5819
   325
  let
wenzelm@5819
   326
    val thy = theory_of ctxt;
wenzelm@5819
   327
    val name = Object.name_of_kind kind;
wenzelm@5819
   328
  in
wenzelm@5819
   329
    (case Symtab.lookup (ProofDataData.get thy, name) of
wenzelm@5819
   330
      Some (k, meths) =>
wenzelm@5819
   331
        if Object.eq_kind (kind, k) then
wenzelm@5819
   332
          (case Symtab.lookup (data, name) of
wenzelm@5819
   333
            Some x => (x, meths)
wenzelm@5819
   334
          | None => err_undef ctxt name)
wenzelm@5819
   335
        else err_access ctxt name
wenzelm@5819
   336
    | None => err_uninit ctxt name)
wenzelm@5819
   337
  end;
wenzelm@5819
   338
wenzelm@5819
   339
fun get_data kind f ctxt =
wenzelm@5819
   340
  let val (x, _) = lookup_data ctxt kind
wenzelm@5819
   341
  in f x handle Match => Object.kind_error kind end;
wenzelm@5819
   342
wenzelm@5819
   343
fun print_data kind ctxt =
wenzelm@5819
   344
  let val (x, (_, prt)) = lookup_data ctxt kind
wenzelm@5819
   345
  in prt ctxt x end;
wenzelm@5819
   346
wenzelm@5819
   347
fun put_data kind f x ctxt =
wenzelm@8373
   348
 (lookup_data ctxt kind;
wenzelm@8373
   349
  ctxt |> map_context (fn (thy, data, asms, binds, thms, cases, defs) =>
wenzelm@8373
   350
    (thy, Symtab.update ((Object.name_of_kind kind, f x), data), asms, binds, thms, cases, defs)));
wenzelm@5819
   351
wenzelm@5819
   352
wenzelm@5819
   353
(* init context *)
wenzelm@5819
   354
wenzelm@5874
   355
fun init thy =
wenzelm@5874
   356
  let val data = Symtab.map (fn (_, (f, _)) => f thy) (ProofDataData.get thy) in
wenzelm@8426
   357
    make_context (thy, data, (([], []), ([], [])), Vartab.empty, Symtab.empty, [],
wenzelm@8616
   358
      (Vartab.empty, Vartab.empty, ([], Symtab.empty)))
wenzelm@5819
   359
  end;
wenzelm@5819
   360
wenzelm@5819
   361
wenzelm@8616
   362
(* get assumptions *)
wenzelm@8616
   363
wenzelm@8616
   364
fun assumptions (Context {asms = ((asms, _), _), ...}) = asms;
wenzelm@8616
   365
fun fixed_names (Context {asms = (_, (fixes, _)), ...}) = map #2 fixes;
wenzelm@8616
   366
fun used_table (Context {defs = (_, _, (_, tab)), ...}) = tab;
wenzelm@8616
   367
wenzelm@8616
   368
wenzelm@8096
   369
wenzelm@7663
   370
(** default sorts and types **)
wenzelm@7663
   371
wenzelm@7670
   372
fun def_sort (Context {defs = (_, sorts, _), ...}) xi = Vartab.lookup (sorts, xi);
wenzelm@7663
   373
wenzelm@7670
   374
fun def_type (Context {binds, defs = (types, _, _), ...}) is_pat xi =
wenzelm@7663
   375
  (case Vartab.lookup (types, xi) of
wenzelm@7663
   376
    None =>
wenzelm@8616
   377
      if is_pat then None else
wenzelm@8616
   378
        (case Vartab.lookup (binds, xi) of
wenzelm@8616
   379
          Some (Some (_, T)) => Some (TypeInfer.polymorphicT T)
wenzelm@8616
   380
        | _ => None)
wenzelm@7663
   381
  | some => some);
wenzelm@7663
   382
wenzelm@7663
   383
wenzelm@5819
   384
wenzelm@5819
   385
(** prepare types **)
wenzelm@5819
   386
wenzelm@9504
   387
local
wenzelm@9504
   388
wenzelm@9504
   389
fun read_typ_aux read ctxt s =
wenzelm@9504
   390
  transform_error (read (sign_of ctxt, def_sort ctxt)) s
wenzelm@7663
   391
    handle ERROR_MESSAGE msg => raise CONTEXT (msg, ctxt);
wenzelm@5819
   392
wenzelm@9504
   393
fun cert_typ_aux cert ctxt raw_T = cert (sign_of ctxt) raw_T
wenzelm@9504
   394
  handle TYPE (msg, _, _) => raise CONTEXT (msg, ctxt);
wenzelm@9504
   395
wenzelm@9504
   396
in
wenzelm@9504
   397
wenzelm@9504
   398
val read_typ         = read_typ_aux Sign.read_typ;
wenzelm@9504
   399
val read_typ_no_norm = read_typ_aux Sign.read_typ_no_norm;
wenzelm@9504
   400
val cert_typ         = cert_typ_aux Sign.certify_typ;
wenzelm@9504
   401
val cert_typ_no_norm = cert_typ_aux Sign.certify_typ_no_norm;
wenzelm@9504
   402
wenzelm@9504
   403
end;
wenzelm@9504
   404
wenzelm@5819
   405
wenzelm@5819
   406
wenzelm@7679
   407
(* internalize Skolem constants *)
wenzelm@7679
   408
wenzelm@9133
   409
fun fixes_of (Context {asms = (_, (fixes, _)), ...}) = fixes;
wenzelm@9133
   410
fun get_skolem ctxt x = assoc (fixes_of ctxt, x);
wenzelm@7679
   411
wenzelm@9325
   412
fun no_skolem no_internal ctxt x =
wenzelm@9291
   413
  if can Syntax.dest_skolem x then
wenzelm@7679
   414
    raise CONTEXT ("Illegal reference to internal Skolem constant: " ^ quote x, ctxt)
wenzelm@9325
   415
  else if no_internal andalso can Syntax.dest_internal x then
wenzelm@9291
   416
    raise CONTEXT ("Illegal reference to internal variable: " ^ quote x, ctxt)
wenzelm@7679
   417
  else x;
wenzelm@7679
   418
wenzelm@9291
   419
fun intern_skolem ctxt =
wenzelm@7679
   420
  let
wenzelm@7679
   421
    fun intern (t as Free (x, T)) =
wenzelm@9325
   422
          (case get_skolem ctxt (no_skolem true ctxt x) of
wenzelm@7679
   423
            Some x' => Free (x', T)
wenzelm@7679
   424
          | None => t)
wenzelm@7679
   425
      | intern (t $ u) = intern t $ intern u
wenzelm@7679
   426
      | intern (Abs (x, T, t)) = Abs (x, T, intern t)
wenzelm@7679
   427
      | intern a = a;
wenzelm@7679
   428
  in intern end;
wenzelm@7679
   429
wenzelm@7679
   430
wenzelm@9133
   431
(* externalize Skolem constants -- for printing purposes only *)
wenzelm@9133
   432
wenzelm@9133
   433
fun extern_skolem ctxt =
wenzelm@9133
   434
  let
wenzelm@9133
   435
    val rev_fixes = map Library.swap (fixes_of ctxt);
wenzelm@9133
   436
wenzelm@9133
   437
    fun extern (t as Free (x, T)) =
wenzelm@9133
   438
          (case assoc (rev_fixes, x) of
wenzelm@9133
   439
            Some x' => Free (if get_skolem ctxt x' = Some x then x' else NameSpace.hidden x', T)
wenzelm@9133
   440
          | None => t)
wenzelm@9133
   441
      | extern (t $ u) = extern t $ extern u
wenzelm@9133
   442
      | extern (Abs (x, T, t)) = Abs (x, T, extern t)
wenzelm@9133
   443
      | extern a = a;
wenzelm@9133
   444
  in extern end
wenzelm@9133
   445
wenzelm@8096
   446
wenzelm@5819
   447
(** prepare terms and propositions **)
wenzelm@5819
   448
wenzelm@5819
   449
(*
wenzelm@5819
   450
  (1) read / certify wrt. signature of context
wenzelm@5819
   451
  (2) intern Skolem constants
wenzelm@5819
   452
  (3) expand term bindings
wenzelm@5819
   453
*)
wenzelm@5819
   454
wenzelm@5819
   455
wenzelm@5819
   456
(* read / certify wrt. signature *)     (*exception ERROR*) (*exception TERM*)
wenzelm@5819
   457
wenzelm@5874
   458
fun read_def_termTs freeze sg (types, sorts, used) sTs =
wenzelm@8616
   459
  Sign.read_def_terms (sg, types, sorts) used freeze sTs;
wenzelm@5874
   460
wenzelm@5874
   461
fun read_def_termT freeze sg defs sT = apfst hd (read_def_termTs freeze sg defs [sT]);
wenzelm@5874
   462
wenzelm@8096
   463
fun read_term_sg freeze sg defs s = #1 (read_def_termT freeze sg defs (s, TypeInfer.logicT));
wenzelm@8096
   464
fun read_prop_sg freeze sg defs s = #1 (read_def_termT freeze sg defs (s, propT));
wenzelm@5819
   465
wenzelm@5819
   466
wenzelm@5819
   467
fun cert_term_sg sg t = Thm.term_of (Thm.cterm_of sg t);
wenzelm@5819
   468
wenzelm@5819
   469
fun cert_prop_sg sg tm =
wenzelm@5819
   470
  let
wenzelm@5819
   471
    val ctm = Thm.cterm_of sg tm;
wenzelm@5819
   472
    val {t, T, ...} = Thm.rep_cterm ctm;
wenzelm@5819
   473
  in
wenzelm@5819
   474
    if T = propT then t
wenzelm@5819
   475
    else raise TERM ("Term not of type prop", [t])
wenzelm@5819
   476
  end;
wenzelm@5819
   477
wenzelm@5819
   478
wenzelm@5819
   479
(* norm_term *)
wenzelm@5819
   480
wenzelm@5819
   481
(*beta normal form for terms (not eta normal form), chase variables in
wenzelm@5819
   482
  bindings environment (code taken from Pure/envir.ML)*)
wenzelm@5819
   483
wenzelm@8616
   484
fun unifyT ctxt (T, U) =
wenzelm@8616
   485
  let val maxidx = Int.max (Term.maxidx_of_typ T, Term.maxidx_of_typ U)
wenzelm@8616
   486
  in #1 (Type.unify (Sign.tsig_of (sign_of ctxt)) maxidx Vartab.empty (T, U)) end;
wenzelm@8616
   487
wenzelm@5819
   488
fun norm_term (ctxt as Context {binds, ...}) =
wenzelm@5819
   489
  let
wenzelm@5819
   490
    (*raised when norm has no effect on a term, to do sharing instead of copying*)
wenzelm@5819
   491
    exception SAME;
wenzelm@5819
   492
wenzelm@5819
   493
    fun norm (t as Var (xi, T)) =
wenzelm@5819
   494
          (case Vartab.lookup (binds, xi) of
wenzelm@7606
   495
            Some (Some (u, U)) =>
wenzelm@8616
   496
              let
wenzelm@8616
   497
                val env = unifyT ctxt (T, U) handle Type.TUNIFY =>
wenzelm@8616
   498
                  raise TYPE ("norm_term: ill-typed variable assigment", [T, U], [t, u]);
wenzelm@8616
   499
                val u' = Term.subst_TVars_Vartab env u;
wenzelm@8616
   500
              in norm u' handle SAME => u' end
wenzelm@7606
   501
          | _ => raise CONTEXT ("Unbound schematic variable: " ^ Syntax.string_of_vname xi, ctxt))
wenzelm@5819
   502
      | norm (Abs (a, T, body)) =  Abs (a, T, norm body)
wenzelm@5819
   503
      | norm (Abs (_, _, body) $ t) = normh (subst_bound (t, body))
wenzelm@5819
   504
      | norm (f $ t) =
wenzelm@5819
   505
          ((case norm f of
wenzelm@5819
   506
            Abs (_, _, body) => normh (subst_bound (t, body))
wenzelm@5819
   507
          | nf => nf $ (norm t handle SAME => t)) handle SAME => f $ norm t)
wenzelm@5819
   508
      | norm _ =  raise SAME
wenzelm@5819
   509
    and normh t = norm t handle SAME => t
wenzelm@5819
   510
  in normh end;
wenzelm@5819
   511
wenzelm@5819
   512
wenzelm@6550
   513
(* dummy patterns *)
wenzelm@6550
   514
wenzelm@9540
   515
fun prepare_dummies t = #2 (Term.replace_dummy_patterns (1, t));
wenzelm@6762
   516
wenzelm@9540
   517
fun reject_dummies ctxt t = Term.no_dummy_patterns t
wenzelm@9540
   518
  handle TERM _ => raise CONTEXT ("Illegal dummy pattern(s) in term", ctxt);
wenzelm@6550
   519
wenzelm@6550
   520
wenzelm@5819
   521
(* read terms *)
wenzelm@5819
   522
wenzelm@8616
   523
fun gen_read read app is_pat (ctxt as Context {defs = (_, _, (used, _)), ...}) s =
wenzelm@7663
   524
  (transform_error (read (sign_of ctxt) (def_type ctxt is_pat, def_sort ctxt, used)) s
wenzelm@7663
   525
    handle TERM (msg, _) => raise CONTEXT (msg, ctxt)
wenzelm@7663
   526
    | ERROR_MESSAGE msg => raise CONTEXT (msg, ctxt))
wenzelm@9291
   527
  |> app (intern_skolem ctxt)
wenzelm@7663
   528
  |> app (if is_pat then I else norm_term ctxt)
wenzelm@7663
   529
  |> app (if is_pat then prepare_dummies else (reject_dummies ctxt));
wenzelm@5819
   530
wenzelm@5874
   531
val read_termTs = gen_read (read_def_termTs false) (apfst o map) false;
wenzelm@8096
   532
val read_termT_pats = #1 oo gen_read (read_def_termTs false) (apfst o map) true;
wenzelm@8096
   533
wenzelm@8096
   534
fun read_term_pats T ctxt pats = read_termT_pats ctxt (map (rpair T) pats);
wenzelm@8096
   535
val read_prop_pats = read_term_pats propT;
wenzelm@8096
   536
wenzelm@6762
   537
val read_term = gen_read (read_term_sg true) I false;
wenzelm@6762
   538
val read_prop = gen_read (read_prop_sg true) I false;
wenzelm@5819
   539
wenzelm@5819
   540
wenzelm@5819
   541
(* certify terms *)
wenzelm@5819
   542
wenzelm@8616
   543
fun gen_cert cert is_pat ctxt t = t
wenzelm@8616
   544
  |> (if is_pat then I else norm_term ctxt)
wenzelm@8616
   545
  |> (fn t' => cert (sign_of ctxt) t' handle TERM (msg, _) => raise CONTEXT (msg, ctxt));
wenzelm@5819
   546
wenzelm@5819
   547
val cert_term = gen_cert cert_term_sg false;
wenzelm@5819
   548
val cert_prop = gen_cert cert_prop_sg false;
wenzelm@8096
   549
wenzelm@8096
   550
fun cert_term_pats _ = map o gen_cert cert_term_sg true;
wenzelm@8096
   551
val cert_prop_pats = map o gen_cert cert_prop_sg true;
wenzelm@5819
   552
wenzelm@5819
   553
wenzelm@5819
   554
(* declare terms *)
wenzelm@5819
   555
wenzelm@5819
   556
val ins_types = foldl_aterms
wenzelm@5819
   557
  (fn (types, Free (x, T)) => Vartab.update (((x, ~1), T), types)
wenzelm@5819
   558
    | (types, Var v) => Vartab.update (v, types)
wenzelm@5819
   559
    | (types, _) => types);
wenzelm@5819
   560
wenzelm@5819
   561
val ins_sorts = foldl_types (foldl_atyps
wenzelm@5819
   562
  (fn (sorts, TFree (x, S)) => Vartab.update (((x, ~1), S), sorts)
wenzelm@5819
   563
    | (sorts, TVar v) => Vartab.update (v, sorts)
wenzelm@5819
   564
    | (sorts, _) => sorts));
wenzelm@5819
   565
wenzelm@8616
   566
val ins_used = foldl_term_types (fn t => foldl_atyps
wenzelm@8616
   567
  (fn ((used, tab), TFree (x, _)) => (x ins used, Symtab.update_multi ((x, t), tab))
wenzelm@5819
   568
    | (used, _) => used));
wenzelm@5819
   569
wenzelm@7663
   570
fun ins_skolem def_ty = foldr
wenzelm@5994
   571
  (fn ((x, x'), types) =>
wenzelm@7663
   572
    (case def_ty x' of
wenzelm@5994
   573
      Some T => Vartab.update (((x, ~1), T), types)
wenzelm@5994
   574
    | None => types));
wenzelm@5994
   575
wenzelm@8373
   576
fun map_defaults f = map_context (fn (thy, data, asms, binds, thms, cases, defs) =>
wenzelm@8373
   577
  (thy, data, asms, binds, thms, cases, f defs));
wenzelm@5819
   578
wenzelm@5994
   579
fun declare (ctxt as Context {asms = (_, (fixes, _)), ...}, t) =
wenzelm@5819
   580
  ctxt
wenzelm@7670
   581
  |> map_defaults (fn (types, sorts, used) => (ins_types (types, t), sorts, used))
wenzelm@7670
   582
  |> map_defaults (fn (types, sorts, used) => (types, ins_sorts (sorts, t), used))
wenzelm@7670
   583
  |> map_defaults (fn (types, sorts, used) => (types, sorts, ins_used (used, t)))
wenzelm@7670
   584
  |> map_defaults (fn (types, sorts, used) =>
wenzelm@7670
   585
      (ins_skolem (fn x => Vartab.lookup (types, (x, ~1))) (fixes, types), sorts, used));
wenzelm@5819
   586
wenzelm@5819
   587
wenzelm@5819
   588
fun declare_term t ctxt = declare (ctxt, t);
wenzelm@5819
   589
fun declare_terms ts ctxt = foldl declare (ctxt, ts);
wenzelm@5819
   590
wenzelm@5819
   591
wenzelm@8616
   592
wenzelm@8616
   593
(** Hindley-Milner polymorphism **)
wenzelm@8616
   594
wenzelm@7925
   595
(* warn_extra_tfrees *)
wenzelm@7925
   596
wenzelm@8616
   597
local
wenzelm@8616
   598
wenzelm@8616
   599
fun used_free (a, ts) =
wenzelm@8616
   600
  (case mapfilter (fn Free (x, _) => Some x | _ => None) ts of
wenzelm@8616
   601
    [] => None
wenzelm@8616
   602
  | xs => Some (a, xs));
wenzelm@8616
   603
wenzelm@8616
   604
fun warn_extra (names1: string list, tab1) (names2, tab2) =
wenzelm@8616
   605
  if names1 = names2 then ()
wenzelm@7925
   606
  else
wenzelm@8616
   607
    let
wenzelm@8616
   608
      val extra =
wenzelm@8616
   609
        Library.gen_rems Library.eq_fst (Symtab.dest tab2, Symtab.dest tab1)
wenzelm@8616
   610
        |> mapfilter used_free;
wenzelm@8616
   611
      val tfrees = map #1 extra;
wenzelm@8616
   612
      val frees = Library.sort_strings (Library.distinct (flat (map #2 extra)));
wenzelm@8616
   613
    in
wenzelm@8616
   614
      if null extra then ()
wenzelm@8616
   615
      else warning ("Danger! Just introduced free type variable(s): " ^ commas tfrees ^ " in " ^
wenzelm@8616
   616
          space_implode " or " frees)
wenzelm@8616
   617
    end;
wenzelm@8616
   618
wenzelm@8616
   619
in
wenzelm@7925
   620
wenzelm@7925
   621
fun warn_extra_tfrees (ctxt1 as Context {defs = (_, _, used1), ...})
wenzelm@7925
   622
    (ctxt2 as Context {defs = (_, _, used2), ...}) = (warn_extra used1 used2; ctxt2);
wenzelm@7925
   623
wenzelm@8616
   624
end;
wenzelm@8616
   625
wenzelm@8616
   626
wenzelm@8616
   627
(* generalize type variables *)
wenzelm@8616
   628
wenzelm@8616
   629
fun gen_tfrees inner opt_outer =
wenzelm@8616
   630
  let
wenzelm@8616
   631
    val inner_used = used_table inner;
wenzelm@8616
   632
    val inner_fixes = fixed_names inner;
wenzelm@8616
   633
    val (outer_used, outer_fixes) =
wenzelm@8616
   634
      (case opt_outer of
wenzelm@8616
   635
        None => (Symtab.empty, [])
wenzelm@8616
   636
      | Some ctxt => (used_table ctxt, fixed_names ctxt));
wenzelm@8616
   637
wenzelm@8616
   638
    val extra_fixes = inner_fixes \\ outer_fixes;
wenzelm@8616
   639
    fun still_fixed (Free (x, _)) = not (x mem_string extra_fixes)
wenzelm@8616
   640
      | still_fixed _ = false;
wenzelm@8616
   641
wenzelm@8616
   642
    fun add (gen, (a, xs)) =
wenzelm@8616
   643
      if is_some (Symtab.lookup (outer_used, a)) orelse exists still_fixed xs
wenzelm@8616
   644
      then gen else a :: gen;
wenzelm@8616
   645
  in Symtab.foldl add ([], inner_used) end;
wenzelm@8616
   646
wenzelm@8616
   647
fun generalizeT inner outer =
wenzelm@8616
   648
  let
wenzelm@8616
   649
    val tfrees = gen_tfrees inner (Some outer);
wenzelm@8616
   650
    fun gen (x, S) = if x mem_string tfrees then TVar ((x, 0), S) else TFree (x, S);
wenzelm@8616
   651
  in Term.map_type_tfree gen end;
wenzelm@8616
   652
wenzelm@8616
   653
val generalize = Term.map_term_types oo generalizeT;
wenzelm@8616
   654
wenzelm@8616
   655
wenzelm@9553
   656
wenzelm@9553
   657
(** export theorems **)
wenzelm@8616
   658
wenzelm@8616
   659
fun get_free x (None, t as Free (y, _)) = if x = y then Some t else None
wenzelm@8616
   660
  | get_free _ (opt, _) = opt;
wenzelm@8616
   661
wenzelm@8616
   662
fun find_free t x = foldl_aterms (get_free x) (None, t);
wenzelm@8616
   663
wenzelm@9553
   664
val norm_hhf =
wenzelm@9553
   665
  Drule.forall_elim_vars_safe o Tactic.rewrite_rule [Drule.norm_hhf_eq];
wenzelm@9553
   666
wenzelm@8616
   667
wenzelm@8616
   668
local
wenzelm@8616
   669
wenzelm@9470
   670
fun export tfrees fixes goal_asms thm =
wenzelm@9470
   671
  thm
wenzelm@9553
   672
  |> norm_hhf
wenzelm@9470
   673
  |> Seq.EVERY (rev (map op |> goal_asms))
wenzelm@9470
   674
  |> Seq.map (fn rule =>
wenzelm@9470
   675
    let
wenzelm@9470
   676
      val {sign, prop, maxidx, ...} = Thm.rep_thm rule;
wenzelm@9470
   677
      val frees = map (Thm.cterm_of sign) (mapfilter (find_free prop) fixes);
wenzelm@9470
   678
    in
wenzelm@9470
   679
      rule
wenzelm@9470
   680
      |> Drule.forall_intr_list frees
wenzelm@9553
   681
      |> norm_hhf
wenzelm@9470
   682
      |> Drule.tvars_intr_list tfrees
wenzelm@9470
   683
    end);
wenzelm@8616
   684
wenzelm@8616
   685
fun diff_context inner None = (gen_tfrees inner None, fixed_names inner, assumptions inner)
wenzelm@8616
   686
  | diff_context inner (Some outer) =
wenzelm@8616
   687
      (gen_tfrees inner (Some outer),
wenzelm@8616
   688
        fixed_names inner \\ fixed_names outer,
wenzelm@8616
   689
        Library.drop (length (assumptions outer), assumptions inner));
wenzelm@8616
   690
wenzelm@8616
   691
in
wenzelm@8616
   692
wenzelm@9470
   693
fun export_wrt is_goal inner opt_outer =
wenzelm@8616
   694
  let
wenzelm@8616
   695
    val (tfrees, fixes, asms) = diff_context inner opt_outer;
wenzelm@9470
   696
    val goal_asms = map (fn (cprops, (exp, _)) => (map Drule.mk_cgoal cprops, exp)) asms;
wenzelm@9470
   697
    val tacs = flat (map (fn (cprops, (_, f)) => f is_goal (length cprops)) asms);
wenzelm@9470
   698
  in (export tfrees fixes goal_asms, tacs) end;
wenzelm@8616
   699
wenzelm@8616
   700
end;
wenzelm@8616
   701
wenzelm@7925
   702
wenzelm@5819
   703
wenzelm@5819
   704
(** bindings **)
wenzelm@5819
   705
wenzelm@5819
   706
(* update_binds *)
wenzelm@5819
   707
wenzelm@7606
   708
fun del_bind (ctxt, xi) =
wenzelm@7606
   709
  ctxt
wenzelm@8373
   710
  |> map_context (fn (thy, data, asms, binds, thms, cases, defs) =>
wenzelm@8373
   711
      (thy, data, asms, Vartab.update ((xi, None), binds), thms, cases, defs));
wenzelm@7606
   712
wenzelm@8616
   713
fun upd_bind (ctxt, ((x, i), t)) =
wenzelm@8616
   714
  let
wenzelm@8616
   715
    val T = Term.fastype_of t;
wenzelm@8616
   716
    val t' =
wenzelm@8616
   717
      if null (Term.term_tvars t \\ Term.typ_tvars T) then t
wenzelm@8637
   718
      else Var ((x ^ "_has_extra_type_vars_on_rhs", i), T);
wenzelm@8616
   719
  in
wenzelm@5819
   720
    ctxt
wenzelm@8616
   721
    |> declare_term t'
wenzelm@8373
   722
    |> map_context (fn (thy, data, asms, binds, thms, cases, defs) =>
wenzelm@8616
   723
        (thy, data, asms, Vartab.update (((x, i), Some (t', T)), binds), thms, cases, defs))
wenzelm@5819
   724
  end;
wenzelm@5819
   725
wenzelm@7606
   726
fun del_upd_bind (ctxt, (xi, None)) = del_bind (ctxt, xi)
wenzelm@7606
   727
  | del_upd_bind (ctxt, (xi, Some t)) = upd_bind (ctxt, (xi, t));
wenzelm@7606
   728
wenzelm@5819
   729
fun update_binds bs ctxt = foldl upd_bind (ctxt, bs);
wenzelm@7606
   730
fun delete_update_binds bs ctxt = foldl del_upd_bind (ctxt, bs);
wenzelm@7606
   731
wenzelm@5819
   732
wenzelm@8096
   733
(* simult_matches *)
wenzelm@8096
   734
wenzelm@8616
   735
fun simult_matches ctxt [] = []
wenzelm@8616
   736
  | simult_matches ctxt pairs =
wenzelm@8096
   737
      let
wenzelm@8096
   738
        val maxidx = foldl (fn (i, (t1, t2)) =>
wenzelm@8096
   739
          Int.max (i, Int.max (Term.maxidx_of_term t1, Term.maxidx_of_term t2))) (~1, pairs);
wenzelm@8096
   740
        val envs = Unify.smash_unifiers (sign_of ctxt, Envir.empty maxidx, pairs);
wenzelm@8096
   741
        val env =
wenzelm@8096
   742
          (case Seq.pull envs of
wenzelm@8096
   743
            None => raise CONTEXT ("Pattern match failed!", ctxt)      (* FIXME improve msg (!?) *)
wenzelm@8096
   744
          | Some (env, _) => env);
wenzelm@8616
   745
        val binds =
wenzelm@8616
   746
          (*Note: Envir.norm_term ensures proper type instantiation*)
wenzelm@8616
   747
          map (apsnd (Envir.norm_term env)) (Envir.alist_of env);
wenzelm@8616
   748
      in binds end;
wenzelm@8096
   749
wenzelm@8096
   750
wenzelm@8096
   751
(* add_binds(_i) *)
wenzelm@5819
   752
wenzelm@7925
   753
local
wenzelm@7925
   754
wenzelm@5819
   755
fun gen_bind prep (ctxt, (xi as (x, _), raw_t)) =
wenzelm@7606
   756
  ctxt |> delete_update_binds [(xi, apsome (prep ctxt) raw_t)];
wenzelm@5819
   757
wenzelm@8616
   758
fun gen_binds prep binds ctxt = foldl (gen_bind prep) (ctxt, binds);
wenzelm@7925
   759
wenzelm@7925
   760
in
wenzelm@5819
   761
wenzelm@5819
   762
val add_binds = gen_binds read_term;
wenzelm@5819
   763
val add_binds_i = gen_binds cert_term;
wenzelm@8616
   764
wenzelm@7925
   765
val auto_bind_goal = add_binds_i o AutoBind.goal;
wenzelm@7925
   766
val auto_bind_facts = add_binds_i oo AutoBind.facts;
wenzelm@7925
   767
wenzelm@7925
   768
end;
wenzelm@5819
   769
wenzelm@5819
   770
wenzelm@8096
   771
(* match_bind(_i) *)
wenzelm@5819
   772
wenzelm@8096
   773
local
wenzelm@8096
   774
wenzelm@8616
   775
fun prep_bind (prep, prep_pats) (ctxt, (raw_pats, raw_t)) =
wenzelm@5819
   776
  let
wenzelm@5935
   777
    val t = prep ctxt raw_t;
wenzelm@8096
   778
    val ctxt' = declare_term t ctxt;
wenzelm@8096
   779
    val pats = prep_pats (fastype_of t) ctxt' raw_pats;
wenzelm@8616
   780
    val binds = simult_matches ctxt' (map (rpair t) pats);
wenzelm@8616
   781
  in (ctxt', binds) end;
wenzelm@7670
   782
wenzelm@8616
   783
fun gen_binds prepp gen raw_binds ctxt =
wenzelm@8616
   784
  let
wenzelm@8616
   785
    val (ctxt', binds) = apsnd flat (foldl_map (prep_bind prepp) (ctxt, raw_binds));
wenzelm@8616
   786
    val binds' =
wenzelm@8616
   787
      if gen then map (apsnd (generalize ctxt' ctxt)) binds
wenzelm@8616
   788
      else binds;
wenzelm@8616
   789
    val binds'' = map (apsnd Some) binds';
wenzelm@8616
   790
  in
wenzelm@8616
   791
    warn_extra_tfrees ctxt
wenzelm@8616
   792
     (if gen then ctxt (*sic!*) |> declare_terms (map #2 binds') |> add_binds_i binds''
wenzelm@8616
   793
      else ctxt' |> add_binds_i binds'')
wenzelm@8616
   794
  end;
wenzelm@8096
   795
wenzelm@8096
   796
in
wenzelm@5935
   797
wenzelm@8096
   798
val match_bind = gen_binds (read_term, read_term_pats);
wenzelm@8096
   799
val match_bind_i = gen_binds (cert_term, cert_term_pats);
wenzelm@8096
   800
wenzelm@8096
   801
end;
wenzelm@5935
   802
wenzelm@5935
   803
wenzelm@8096
   804
(* proposition patterns *)
wenzelm@5935
   805
wenzelm@8096
   806
fun prep_propp prep_prop prep_pats (ctxt, (raw_prop, (raw_pats1, raw_pats2))) =
wenzelm@6931
   807
  let
wenzelm@8096
   808
    val prop = prep_prop ctxt raw_prop;
wenzelm@8096
   809
    val ctxt' = declare_term prop ctxt;
wenzelm@8096
   810
wenzelm@8096
   811
    val pats = prep_pats ctxt' (raw_pats1 @ raw_pats2);    (*simultaneous type inference!*)
wenzelm@8096
   812
    val len1 = length raw_pats1;
wenzelm@8096
   813
  in (ctxt', (prop, (take (len1, pats), drop (len1, pats)))) end;
wenzelm@8096
   814
wenzelm@8096
   815
val read_propp = prep_propp read_prop read_prop_pats;
wenzelm@8096
   816
val cert_propp = prep_propp cert_prop cert_prop_pats;
wenzelm@5935
   817
wenzelm@8096
   818
wenzelm@8096
   819
fun gen_bind_propp prepp (ctxt, propp) =
wenzelm@8096
   820
  let
wenzelm@8096
   821
    val (ctxt', (prop, (pats1, pats2))) = prepp (ctxt, propp);
wenzelm@8616
   822
    val pairs =
wenzelm@8616
   823
      map (rpair prop) pats1 @
wenzelm@8616
   824
      map (rpair (Logic.strip_imp_concl prop)) pats2;   (* FIXME handle params!? *)
wenzelm@8616
   825
    val binds = simult_matches ctxt' pairs;
wenzelm@8616
   826
wenzelm@8616
   827
    (*note: context evaluated now, binds added later (lazy)*)
wenzelm@8616
   828
    val gen = generalize ctxt' ctxt;
wenzelm@8616
   829
    fun gen_binds ct = ct |> add_binds_i (map (apsnd (Some o gen)) binds);
wenzelm@8616
   830
  in (ctxt' |> add_binds_i (map (apsnd Some) binds), (prop, gen_binds)) end;
wenzelm@8096
   831
wenzelm@8096
   832
val bind_propp = gen_bind_propp read_propp;
wenzelm@8096
   833
val bind_propp_i = gen_bind_propp cert_propp;
wenzelm@6789
   834
wenzelm@6789
   835
wenzelm@5819
   836
wenzelm@5819
   837
(** theorems **)
wenzelm@5819
   838
wenzelm@6091
   839
(* get_thm(s) *)
wenzelm@5819
   840
wenzelm@6091
   841
fun get_thm (ctxt as Context {thy, thms, ...}) name =
wenzelm@5819
   842
  (case Symtab.lookup (thms, name) of
wenzelm@9007
   843
    Some (Some [th]) => Thm.transfer thy th
wenzelm@7606
   844
  | Some (Some _) => raise CONTEXT ("Single theorem expected: " ^ quote name, ctxt)
wenzelm@7606
   845
  | _ => (PureThy.get_thm thy name handle THEORY (msg, _) => raise CONTEXT (msg, ctxt)));
wenzelm@5819
   846
wenzelm@6091
   847
fun get_thms (ctxt as Context {thy, thms, ...}) name =
wenzelm@5819
   848
  (case Symtab.lookup (thms, name) of
wenzelm@9007
   849
    Some (Some ths) => map (Thm.transfer thy) ths
wenzelm@7606
   850
  | _ => (PureThy.get_thms thy name handle THEORY (msg, _) => raise CONTEXT (msg, ctxt)));
wenzelm@5819
   851
wenzelm@6091
   852
fun get_thmss ctxt names = flat (map (get_thms ctxt) names);
wenzelm@5819
   853
wenzelm@5819
   854
wenzelm@6091
   855
(* put_thm(s) *)
wenzelm@5819
   856
wenzelm@7479
   857
fun put_thms ("", _) = I
wenzelm@7479
   858
  | put_thms (name, ths) = map_context
wenzelm@8373
   859
      (fn (thy, data, asms, binds, thms, cases, defs) =>
wenzelm@8373
   860
        (thy, data, asms, binds, Symtab.update ((name, Some ths), thms), cases, defs));
wenzelm@5819
   861
wenzelm@6091
   862
fun put_thm (name, th) = put_thms (name, [th]);
wenzelm@5819
   863
wenzelm@6091
   864
fun put_thmss [] ctxt = ctxt
wenzelm@6091
   865
  | put_thmss (th :: ths) ctxt = ctxt |> put_thms th |> put_thmss ths;
wenzelm@5819
   866
wenzelm@5819
   867
wenzelm@7606
   868
(* reset_thms *)
wenzelm@7606
   869
wenzelm@8373
   870
fun reset_thms name = map_context (fn (thy, data, asms, binds, thms, cases, defs) =>
wenzelm@8373
   871
  (thy, data, asms, binds, Symtab.update ((name, None), thms), cases, defs));
wenzelm@7606
   872
wenzelm@7606
   873
wenzelm@6091
   874
(* have_thmss *)
wenzelm@5819
   875
wenzelm@9196
   876
fun have_thss (ctxt, ((name, more_attrs), ths_attrs)) =
wenzelm@5819
   877
  let
wenzelm@5819
   878
    fun app ((ct, ths), (th, attrs)) =
wenzelm@6091
   879
      let val (ct', th') = Thm.applys_attributes ((ct, th), attrs @ more_attrs)
wenzelm@5819
   880
      in (ct', th' :: ths) end
wenzelm@5819
   881
    val (ctxt', rev_thms) = foldl app ((ctxt, []), ths_attrs);
wenzelm@9196
   882
    val thms = flat (rev rev_thms);
wenzelm@6091
   883
  in (ctxt' |> put_thms (name, thms), (name, thms)) end;
wenzelm@5819
   884
wenzelm@9196
   885
fun have_thmss args ctxt = foldl_map have_thss (ctxt, args);
wenzelm@9196
   886
wenzelm@5819
   887
wenzelm@5819
   888
wenzelm@5819
   889
(** assumptions **)
wenzelm@5819
   890
wenzelm@5819
   891
(* assume *)
wenzelm@5819
   892
wenzelm@7270
   893
local
wenzelm@6797
   894
wenzelm@9470
   895
fun gen_assm prepp (ctxt, (name, attrs, raw_prop_pats)) =
wenzelm@5819
   896
  let
wenzelm@8096
   897
    val (ctxt', props) = foldl_map prepp (ctxt, raw_prop_pats);
wenzelm@5819
   898
wenzelm@7575
   899
    val cprops = map (Thm.cterm_of (sign_of ctxt')) props;
wenzelm@9553
   900
    val asms = map (norm_hhf o Drule.assume_goal) cprops;
wenzelm@5919
   901
wenzelm@5919
   902
    val ths = map (fn th => ([th], [])) asms;
wenzelm@9196
   903
    val (ctxt'', [(_, thms)]) =
wenzelm@5819
   904
      ctxt'
wenzelm@6797
   905
      |> auto_bind_facts name props
wenzelm@9196
   906
      |> have_thmss [((name, attrs @ [Drule.tag_assumption]), ths)];
wenzelm@9470
   907
  in (ctxt'', (cprops, (name, asms), (name, thms))) end;
wenzelm@5819
   908
wenzelm@9470
   909
fun gen_assms prepp exp args ctxt =
wenzelm@9470
   910
  let
wenzelm@9470
   911
    val (ctxt', results) = foldl_map (gen_assm prepp) (ctxt, args);
wenzelm@9470
   912
    val cprops = flat (map #1 results);
wenzelm@9470
   913
    val asmss = map #2 results;
wenzelm@9470
   914
    val thmss = map #3 results;
wenzelm@9470
   915
    val ctxt'' =
wenzelm@9470
   916
      ctxt'
wenzelm@8373
   917
      |> map_context (fn (thy, data, ((asms_ct, asms_th), fixes), binds, thms, cases, defs) =>
wenzelm@9470
   918
        (thy, data, ((asms_ct @ [(cprops, exp)], asms_th @ asmss), fixes), binds, thms,
wenzelm@9470
   919
          cases, defs));
wenzelm@9470
   920
  in (warn_extra_tfrees ctxt ctxt'', (thmss, prems_of ctxt'')) end;
wenzelm@5819
   921
wenzelm@7270
   922
in
wenzelm@7270
   923
wenzelm@8616
   924
val assume = gen_assms (apsnd #1 o bind_propp);
wenzelm@8616
   925
val assume_i = gen_assms (apsnd #1 o bind_propp_i);
wenzelm@7270
   926
wenzelm@7270
   927
end;
wenzelm@5819
   928
wenzelm@5819
   929
wenzelm@8096
   930
(* variables *)
wenzelm@8096
   931
wenzelm@9291
   932
fun prep_vars prep_typ (ctxt, (xs, raw_T)) =
wenzelm@8096
   933
  let
wenzelm@9325
   934
    val _ = (case filter (not o Syntax.is_identifier) (map (no_skolem false ctxt) xs) of
wenzelm@8096
   935
      [] => () | bads => raise CONTEXT ("Bad variable name(s): " ^ commas_quote bads, ctxt));
wenzelm@8096
   936
wenzelm@8096
   937
    val opt_T = apsome (prep_typ ctxt) raw_T;
wenzelm@8096
   938
    val T = if_none opt_T TypeInfer.logicT;
wenzelm@8096
   939
    val ctxt' = ctxt |> declare_terms (map (fn x => Free (x, T)) xs);
wenzelm@8096
   940
  in (ctxt', (xs, opt_T)) end;
wenzelm@8096
   941
wenzelm@9291
   942
val read_vars = prep_vars read_typ;
wenzelm@9291
   943
val cert_vars = prep_vars cert_typ;
wenzelm@8096
   944
wenzelm@8096
   945
wenzelm@5819
   946
(* fix *)
wenzelm@5819
   947
wenzelm@8096
   948
local
wenzelm@8096
   949
wenzelm@8096
   950
fun add_vars xs (fixes, names) =
wenzelm@8096
   951
  let
wenzelm@8096
   952
    val xs' = variantlist (xs, names);
wenzelm@8096
   953
    val fixes' = (xs ~~ map Syntax.skolem xs') @ fixes;
wenzelm@8096
   954
    val names' = xs' @ names;
wenzelm@8096
   955
  in (fixes', names') end;
wenzelm@8096
   956
wenzelm@8373
   957
fun map_vars f = map_context (fn (thy, data, (assumes, vars), binds, thms, cases, defs) =>
wenzelm@8373
   958
  (thy, data, (assumes, f vars), binds, thms, cases, defs));
wenzelm@5819
   959
wenzelm@8096
   960
fun gen_fix prep raw_vars ctxt =
wenzelm@8096
   961
  let
wenzelm@8096
   962
    val (ctxt', varss) = foldl_map prep (ctxt, raw_vars);
wenzelm@8096
   963
    val xs = flat (map fst varss);
wenzelm@8096
   964
  in
wenzelm@8096
   965
    (case Library.duplicates xs of
wenzelm@8096
   966
      [] => ()
wenzelm@8096
   967
    | dups => raise CONTEXT ("Duplicate variable name(s): " ^ commas_quote dups, ctxt));
wenzelm@8096
   968
    ctxt' |> map_vars (add_vars xs)
wenzelm@8096
   969
  end;
wenzelm@5819
   970
wenzelm@8096
   971
in
wenzelm@7679
   972
wenzelm@8096
   973
val fix = gen_fix read_vars;
wenzelm@8096
   974
val fix_i = gen_fix cert_vars;
wenzelm@8096
   975
wenzelm@8096
   976
end;
wenzelm@5819
   977
wenzelm@6895
   978
wenzelm@9291
   979
(*Note: improper use may result in variable capture / dynamic scoping!*)
wenzelm@9291
   980
fun bind_skolem ctxt xs =
wenzelm@9291
   981
  let
wenzelm@9291
   982
    val ctxt' = ctxt |> fix_i [(xs, None)];
wenzelm@9291
   983
    fun bind (t as Free (x, T)) =
wenzelm@9291
   984
          if x mem_string xs then
wenzelm@9291
   985
            (case get_skolem ctxt' x of Some x' => Free (x', T) | None => t)
wenzelm@9291
   986
          else t
wenzelm@9291
   987
      | bind (t $ u) = bind t $ bind u
wenzelm@9291
   988
      | bind (Abs (x, T, t)) = Abs (x, T, bind t)
wenzelm@9291
   989
      | bind a = a;
wenzelm@9291
   990
  in bind end;
wenzelm@9291
   991
wenzelm@9291
   992
wenzelm@5819
   993
wenzelm@8373
   994
(** cases **)
wenzelm@8373
   995
wenzelm@8403
   996
fun check_case ctxt name (xs, ts) =
wenzelm@8403
   997
  if null (foldr Term.add_typ_tvars (map snd xs, [])) andalso
wenzelm@8403
   998
    null (foldr Term.add_term_vars (ts, [])) then ()
wenzelm@8403
   999
  else raise CONTEXT ("Illegal schematic variable(s) in case " ^ quote name, ctxt);
wenzelm@8403
  1000
wenzelm@8373
  1001
fun get_case (ctxt as Context {cases, ...}) name =
wenzelm@8426
  1002
  (case assoc (cases, name) of
wenzelm@8373
  1003
    None => raise CONTEXT ("Unknown case: " ^ quote name, ctxt)
wenzelm@8403
  1004
  | Some c => (check_case ctxt name c; c));
wenzelm@8373
  1005
wenzelm@8384
  1006
wenzelm@8373
  1007
fun add_cases xs = map_context (fn (thy, data, asms, binds, thms, cases, defs) =>
wenzelm@8426
  1008
  (thy, data, asms, binds, thms, rev (filter_out (equal "" o #1) xs) @ cases, defs));
wenzelm@8373
  1009
wenzelm@8373
  1010
wenzelm@8373
  1011
wenzelm@5819
  1012
(** theory setup **)
wenzelm@5819
  1013
wenzelm@5819
  1014
val setup = [ProofDataData.init];
wenzelm@5819
  1015
wenzelm@5819
  1016
wenzelm@5819
  1017
end;