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