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