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