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