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