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