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