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