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