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