src/Pure/Isar/proof_context.ML
author haftmann
Mon Nov 29 11:38:59 2010 +0100 (2010-11-29 ago)
changeset 40803 3f66ea311d44
parent 39557 fe5722fce758
child 40879 ca132ef44944
permissions -rw-r--r--
tuned
wenzelm@5819
     1
(*  Title:      Pure/Isar/proof_context.ML
wenzelm@5819
     2
    Author:     Markus Wenzel, TU Muenchen
wenzelm@5819
     3
wenzelm@19001
     4
The key concept of Isar proof contexts: elevates primitive local
wenzelm@19001
     5
reasoning Gamma |- phi to a structured concept, with generic context
wenzelm@20234
     6
elements.  See also structure Variable and Assumption.
wenzelm@5819
     7
*)
wenzelm@5819
     8
wenzelm@5819
     9
signature PROOF_CONTEXT =
wenzelm@5819
    10
sig
wenzelm@20310
    11
  val theory_of: Proof.context -> theory
wenzelm@36610
    12
  val init_global: theory -> Proof.context
wenzelm@24388
    13
  type mode
wenzelm@24501
    14
  val mode_default: mode
wenzelm@24501
    15
  val mode_stmt: mode
wenzelm@24501
    16
  val mode_pattern: mode
wenzelm@24501
    17
  val mode_schematic: mode
wenzelm@24501
    18
  val mode_abbrev: mode
wenzelm@24388
    19
  val set_mode: mode -> Proof.context -> Proof.context
wenzelm@24388
    20
  val get_mode: Proof.context -> mode
wenzelm@24388
    21
  val restore_mode: Proof.context -> Proof.context -> Proof.context
wenzelm@27286
    22
  val abbrev_mode: Proof.context -> bool
wenzelm@21667
    23
  val set_stmt: bool -> Proof.context -> Proof.context
wenzelm@33165
    24
  val local_naming: Name_Space.naming
wenzelm@33165
    25
  val map_naming: (Name_Space.naming -> Name_Space.naming) -> Proof.context -> Proof.context
wenzelm@33095
    26
  val naming_of: Proof.context -> Name_Space.naming
wenzelm@33165
    27
  val restore_naming: Proof.context -> Proof.context -> Proof.context
haftmann@29581
    28
  val full_name: Proof.context -> binding -> string
wenzelm@35111
    29
  val syn_of: Proof.context -> Syntax.syntax
wenzelm@35669
    30
  val tsig_of: Proof.context -> Type.tsig
wenzelm@36451
    31
  val set_defsort: sort -> Proof.context -> Proof.context
wenzelm@35680
    32
  val default_sort: Proof.context -> indexname -> sort
wenzelm@20310
    33
  val consts_of: Proof.context -> Consts.T
haftmann@24752
    34
  val the_const_constraint: Proof.context -> string -> typ
wenzelm@20784
    35
  val set_syntax_mode: Syntax.mode -> Proof.context -> Proof.context
wenzelm@20310
    36
  val restore_syntax_mode: Proof.context -> Proof.context -> Proof.context
wenzelm@26284
    37
  val facts_of: Proof.context -> Facts.T
blanchet@34982
    38
  val cases_of: Proof.context -> (string * (Rule_Cases.T * bool)) list
wenzelm@27259
    39
  val transfer_syntax: theory -> Proof.context -> Proof.context
wenzelm@20310
    40
  val transfer: theory -> Proof.context -> Proof.context
wenzelm@38756
    41
  val background_theory: (theory -> theory) -> Proof.context -> Proof.context
wenzelm@38756
    42
  val background_theory_result: (theory -> 'a * theory) -> Proof.context -> 'a * Proof.context
wenzelm@28212
    43
  val extern_fact: Proof.context -> string -> xstring
wenzelm@21728
    44
  val pretty_term_abbrev: Proof.context -> term -> Pretty.T
wenzelm@30723
    45
  val pretty_fact_aux: Proof.context -> bool -> string * thm list -> Pretty.T
wenzelm@20310
    46
  val pretty_fact: Proof.context -> string * thm list -> Pretty.T
wenzelm@35669
    47
  val read_class: Proof.context -> xstring -> class
wenzelm@35669
    48
  val read_arity: Proof.context -> xstring * string list * string -> arity
wenzelm@35669
    49
  val cert_arity: Proof.context -> arity -> arity
wenzelm@20310
    50
  val read_typ: Proof.context -> string -> typ
wenzelm@20310
    51
  val read_typ_syntax: Proof.context -> string -> typ
wenzelm@20310
    52
  val read_typ_abbrev: Proof.context -> string -> typ
wenzelm@20310
    53
  val cert_typ: Proof.context -> typ -> typ
wenzelm@20310
    54
  val cert_typ_syntax: Proof.context -> typ -> typ
wenzelm@20310
    55
  val cert_typ_abbrev: Proof.context -> typ -> typ
wenzelm@20310
    56
  val get_skolem: Proof.context -> string -> string
wenzelm@20310
    57
  val revert_skolem: Proof.context -> string -> string
wenzelm@36505
    58
  val infer_type: Proof.context -> string * typ -> typ
wenzelm@28082
    59
  val inferred_param: string -> Proof.context -> typ * Proof.context
wenzelm@25328
    60
  val inferred_fixes: Proof.context -> (string * typ) list * Proof.context
wenzelm@35360
    61
  val read_type_name: Proof.context -> bool -> string -> typ
wenzelm@35669
    62
  val read_type_name_proper: Proof.context -> bool -> string -> typ
wenzelm@35399
    63
  val read_const_proper: Proof.context -> bool -> string -> term
wenzelm@36505
    64
  val read_const: Proof.context -> bool -> typ -> string -> term
wenzelm@27259
    65
  val allow_dummies: Proof.context -> Proof.context
wenzelm@36152
    66
  val check_tvar: Proof.context -> indexname * sort -> indexname * sort
wenzelm@36152
    67
  val check_tfree: Proof.context -> string * sort -> string * sort
wenzelm@22763
    68
  val decode_term: Proof.context -> term -> term
wenzelm@25406
    69
  val standard_infer_types: Proof.context -> term list -> term list
wenzelm@24684
    70
  val read_term_pattern: Proof.context -> string -> term
wenzelm@24684
    71
  val read_term_schematic: Proof.context -> string -> term
wenzelm@24684
    72
  val read_term_abbrev: Proof.context -> string -> term
wenzelm@25345
    73
  val expand_abbrevs: Proof.context -> term -> term
wenzelm@20310
    74
  val cert_term: Proof.context -> term -> term
wenzelm@20310
    75
  val cert_prop: Proof.context -> term -> term
wenzelm@35616
    76
  val def_type: Proof.context -> indexname -> typ option
wenzelm@20310
    77
  val goal_export: Proof.context -> Proof.context -> thm list -> thm list
wenzelm@20310
    78
  val export: Proof.context -> Proof.context -> thm list -> thm list
wenzelm@21531
    79
  val export_morphism: Proof.context -> Proof.context -> morphism
wenzelm@28396
    80
  val norm_export_morphism: Proof.context -> Proof.context -> morphism
wenzelm@30757
    81
  val bind_terms: (indexname * term option) list -> Proof.context -> Proof.context
wenzelm@20310
    82
  val auto_bind_goal: term list -> Proof.context -> Proof.context
wenzelm@20310
    83
  val auto_bind_facts: term list -> Proof.context -> Proof.context
wenzelm@20310
    84
  val match_bind: bool -> (string list * string) list -> Proof.context -> term list * Proof.context
wenzelm@20310
    85
  val match_bind_i: bool -> (term list * term) list -> Proof.context -> term list * Proof.context
wenzelm@20310
    86
  val read_propp: Proof.context * (string * string list) list list
wenzelm@20310
    87
    -> Proof.context * (term * term list) list list
wenzelm@20310
    88
  val cert_propp: Proof.context * (term * term list) list list
wenzelm@20310
    89
    -> Proof.context * (term * term list) list list
wenzelm@20310
    90
  val read_propp_schematic: Proof.context * (string * string list) list list
wenzelm@20310
    91
    -> Proof.context * (term * term list) list list
wenzelm@20310
    92
  val cert_propp_schematic: Proof.context * (term * term list) list list
wenzelm@20310
    93
    -> Proof.context * (term * term list) list list
wenzelm@20310
    94
  val bind_propp: Proof.context * (string * string list) list list
wenzelm@20310
    95
    -> Proof.context * (term list list * (Proof.context -> Proof.context))
wenzelm@20310
    96
  val bind_propp_i: Proof.context * (term * term list) list list
wenzelm@20310
    97
    -> Proof.context * (term list list * (Proof.context -> Proof.context))
wenzelm@20310
    98
  val bind_propp_schematic: Proof.context * (string * string list) list list
wenzelm@20310
    99
    -> Proof.context * (term list list * (Proof.context -> Proof.context))
wenzelm@20310
   100
  val bind_propp_schematic_i: Proof.context * (term * term list) list list
wenzelm@20310
   101
    -> Proof.context * (term list list * (Proof.context -> Proof.context))
wenzelm@18042
   102
  val fact_tac: thm list -> int -> tactic
wenzelm@20310
   103
  val some_fact_tac: Proof.context -> int -> tactic
wenzelm@26346
   104
  val get_fact: Proof.context -> Facts.ref -> thm list
wenzelm@26346
   105
  val get_fact_single: Proof.context -> Facts.ref -> thm
wenzelm@26346
   106
  val get_thms: Proof.context -> xstring -> thm list
wenzelm@26346
   107
  val get_thm: Proof.context -> xstring -> thm
wenzelm@30761
   108
  val note_thmss: string -> (Thm.binding * (thm list * attribute list) list) list ->
wenzelm@30211
   109
    Proof.context -> (string * thm list) list * Proof.context
wenzelm@28082
   110
  val put_thms: bool -> string * thm list option -> Proof.context -> Proof.context
haftmann@29581
   111
  val read_vars: (binding * string option * mixfix) list -> Proof.context ->
haftmann@29581
   112
    (binding * typ option * mixfix) list * Proof.context
haftmann@29581
   113
  val cert_vars: (binding * typ option * mixfix) list -> Proof.context ->
haftmann@29581
   114
    (binding * typ option * mixfix) list * Proof.context
wenzelm@30763
   115
  val add_fixes: (binding * typ option * mixfix) list -> Proof.context ->
wenzelm@30763
   116
    string list * Proof.context
wenzelm@20310
   117
  val auto_fixes: Proof.context * (term list list * 'a) -> Proof.context * (term list list * 'a)
wenzelm@20310
   118
  val bind_fixes: string list -> Proof.context -> (term -> term) * Proof.context
wenzelm@20234
   119
  val add_assms: Assumption.export ->
wenzelm@30211
   120
    (Thm.binding * (string * string list) list) list ->
wenzelm@28082
   121
    Proof.context -> (string * thm list) list * Proof.context
wenzelm@20234
   122
  val add_assms_i: Assumption.export ->
wenzelm@30211
   123
    (Thm.binding * (term * term list) list) list ->
wenzelm@28082
   124
    Proof.context -> (string * thm list) list * Proof.context
wenzelm@33368
   125
  val add_cases: bool -> (string * Rule_Cases.T option) list -> Proof.context -> Proof.context
wenzelm@33368
   126
  val apply_case: Rule_Cases.T -> Proof.context -> (string * term list) list * Proof.context
wenzelm@33368
   127
  val get_case: Proof.context -> string -> string option list -> Rule_Cases.T
wenzelm@35412
   128
  val type_notation: bool -> Syntax.mode -> (typ * mixfix) list -> Proof.context -> Proof.context
wenzelm@24949
   129
  val notation: bool -> Syntax.mode -> (term * mixfix) list -> Proof.context -> Proof.context
wenzelm@35412
   130
  val target_type_notation: bool -> Syntax.mode -> (typ * mixfix) list -> morphism ->
wenzelm@35412
   131
    Context.generic -> Context.generic
wenzelm@24949
   132
  val target_notation: bool -> Syntax.mode -> (term * mixfix) list -> morphism ->
wenzelm@21744
   133
    Context.generic -> Context.generic
wenzelm@35680
   134
  val class_alias: binding -> class -> Proof.context -> Proof.context
wenzelm@35680
   135
  val type_alias: binding -> string -> Proof.context -> Proof.context
wenzelm@35680
   136
  val const_alias: binding -> string -> Proof.context -> Proof.context
wenzelm@24767
   137
  val add_const_constraint: string * typ option -> Proof.context -> Proof.context
wenzelm@33173
   138
  val add_abbrev: string -> binding * term -> Proof.context -> (term * term) * Proof.context
wenzelm@25052
   139
  val revert_abbrev: string -> string -> Proof.context -> Proof.context
wenzelm@20310
   140
  val print_syntax: Proof.context -> unit
wenzelm@21728
   141
  val print_abbrevs: Proof.context -> unit
wenzelm@20310
   142
  val print_binds: Proof.context -> unit
wenzelm@20310
   143
  val print_lthms: Proof.context -> unit
wenzelm@20310
   144
  val print_cases: Proof.context -> unit
wenzelm@32738
   145
  val debug: bool Unsynchronized.ref
wenzelm@35141
   146
  val verbose: bool Unsynchronized.ref
wenzelm@20310
   147
  val pretty_ctxt: Proof.context -> Pretty.T list
wenzelm@20310
   148
  val pretty_context: Proof.context -> Pretty.T list
wenzelm@5819
   149
end;
wenzelm@5819
   150
wenzelm@16540
   151
structure ProofContext: PROOF_CONTEXT =
wenzelm@5819
   152
struct
wenzelm@5819
   153
wenzelm@33031
   154
open ProofContext;
wenzelm@12057
   155
wenzelm@7270
   156
wenzelm@24388
   157
(** inner syntax mode **)
wenzelm@24388
   158
wenzelm@24388
   159
datatype mode =
wenzelm@24388
   160
  Mode of
wenzelm@24486
   161
   {stmt: bool,                (*inner statement mode*)
wenzelm@24388
   162
    pattern: bool,             (*pattern binding schematic variables*)
wenzelm@24388
   163
    schematic: bool,           (*term referencing loose schematic variables*)
wenzelm@24388
   164
    abbrev: bool};             (*abbrev mode -- no normalization*)
wenzelm@24388
   165
wenzelm@24486
   166
fun make_mode (stmt, pattern, schematic, abbrev) =
wenzelm@24486
   167
  Mode {stmt = stmt, pattern = pattern, schematic = schematic, abbrev = abbrev};
wenzelm@24388
   168
wenzelm@24486
   169
val mode_default   = make_mode (false, false, false, false);
wenzelm@24486
   170
val mode_stmt      = make_mode (true, false, false, false);
wenzelm@24486
   171
val mode_pattern   = make_mode (false, true, false, false);
wenzelm@24486
   172
val mode_schematic = make_mode (false, false, true, false);
wenzelm@24486
   173
val mode_abbrev    = make_mode (false, false, false, true);
wenzelm@24388
   174
wenzelm@24388
   175
wenzelm@5819
   176
wenzelm@16540
   177
(** Isar proof context information **)
wenzelm@5819
   178
wenzelm@16540
   179
datatype ctxt =
wenzelm@16540
   180
  Ctxt of
wenzelm@36451
   181
   {mode: mode,                  (*inner syntax mode*)
wenzelm@36451
   182
    naming: Name_Space.naming,   (*local naming conventions*)
wenzelm@36451
   183
    syntax: Local_Syntax.T,      (*local syntax*)
wenzelm@36451
   184
    tsig: Type.tsig * Type.tsig, (*local/global type signature -- local name space / defsort only*)
wenzelm@36451
   185
    consts: Consts.T * Consts.T, (*local/global consts -- local name space / abbrevs only*)
wenzelm@36451
   186
    facts: Facts.T,              (*local facts*)
wenzelm@33368
   187
    cases: (string * (Rule_Cases.T * bool)) list};    (*named case contexts*)
wenzelm@5819
   188
wenzelm@36450
   189
fun make_ctxt (mode, naming, syntax, tsig, consts, facts, cases) =
haftmann@26240
   190
  Ctxt {mode = mode, naming = naming, syntax = syntax,
wenzelm@36450
   191
    tsig = tsig, consts = consts, facts = facts, cases = cases};
wenzelm@5819
   192
wenzelm@33095
   193
val local_naming = Name_Space.default_naming |> Name_Space.add_path "local";
wenzelm@19079
   194
wenzelm@37216
   195
structure Data = Proof_Data
wenzelm@18672
   196
(
wenzelm@16540
   197
  type T = ctxt;
wenzelm@16540
   198
  fun init thy =
wenzelm@33387
   199
    make_ctxt (mode_default, local_naming, Local_Syntax.init thy,
wenzelm@35669
   200
      (Sign.tsig_of thy, Sign.tsig_of thy),
wenzelm@26284
   201
      (Sign.consts_of thy, Sign.consts_of thy), Facts.empty, []);
wenzelm@18672
   202
);
wenzelm@5819
   203
wenzelm@37216
   204
fun rep_context ctxt = Data.get ctxt |> (fn Ctxt args => args);
wenzelm@5819
   205
wenzelm@18672
   206
fun map_context f =
wenzelm@37216
   207
  Data.map (fn Ctxt {mode, naming, syntax, tsig, consts, facts, cases} =>
wenzelm@36450
   208
    make_ctxt (f (mode, naming, syntax, tsig, consts, facts, cases)));
wenzelm@24388
   209
wenzelm@36450
   210
fun set_mode mode = map_context (fn (_, naming, syntax, tsig, consts, facts, cases) =>
wenzelm@36450
   211
  (mode, naming, syntax, tsig, consts, facts, cases));
wenzelm@21443
   212
wenzelm@24388
   213
fun map_mode f =
wenzelm@36450
   214
  map_context (fn (Mode {stmt, pattern, schematic, abbrev}, naming, syntax, tsig, consts, facts, cases) =>
wenzelm@36450
   215
    (make_mode (f (stmt, pattern, schematic, abbrev)), naming, syntax, tsig, consts, facts, cases));
wenzelm@18672
   216
wenzelm@19001
   217
fun map_naming f =
wenzelm@36450
   218
  map_context (fn (mode, naming, syntax, tsig, consts, facts, cases) =>
wenzelm@36450
   219
    (mode, f naming, syntax, tsig, consts, facts, cases));
wenzelm@18672
   220
wenzelm@19001
   221
fun map_syntax f =
wenzelm@36450
   222
  map_context (fn (mode, naming, syntax, tsig, consts, facts, cases) =>
wenzelm@36450
   223
    (mode, naming, f syntax, tsig, consts, facts, cases));
wenzelm@35669
   224
wenzelm@36450
   225
fun map_tsig f =
wenzelm@36450
   226
  map_context (fn (mode, naming, syntax, tsig, consts, facts, cases) =>
wenzelm@36450
   227
    (mode, naming, syntax, f tsig, consts, facts, cases));
wenzelm@18672
   228
wenzelm@19001
   229
fun map_consts f =
wenzelm@36450
   230
  map_context (fn (mode, naming, syntax, tsig, consts, facts, cases) =>
wenzelm@36450
   231
    (mode, naming, syntax, tsig, f consts, facts, cases));
wenzelm@18672
   232
wenzelm@26284
   233
fun map_facts f =
wenzelm@36450
   234
  map_context (fn (mode, naming, syntax, tsig, consts, facts, cases) =>
wenzelm@36450
   235
    (mode, naming, syntax, tsig, consts, f facts, cases));
wenzelm@18672
   236
wenzelm@19001
   237
fun map_cases f =
wenzelm@36450
   238
  map_context (fn (mode, naming, syntax, tsig, consts, facts, cases) =>
wenzelm@36450
   239
    (mode, naming, syntax, tsig, consts, facts, f cases));
wenzelm@24388
   240
wenzelm@24388
   241
val get_mode = #mode o rep_context;
wenzelm@28407
   242
val restore_mode = set_mode o get_mode;
wenzelm@27286
   243
val abbrev_mode = get_mode #> (fn Mode {abbrev, ...} => abbrev);
wenzelm@21443
   244
wenzelm@24486
   245
fun set_stmt stmt =
wenzelm@24486
   246
  map_mode (fn (_, pattern, schematic, abbrev) => (stmt, pattern, schematic, abbrev));
wenzelm@19001
   247
wenzelm@19001
   248
val naming_of = #naming o rep_context;
wenzelm@33165
   249
val restore_naming = map_naming o K o naming_of
wenzelm@33095
   250
val full_name = Name_Space.full_name o naming_of;
wenzelm@5819
   251
wenzelm@16540
   252
val syntax_of = #syntax o rep_context;
wenzelm@33387
   253
val syn_of = Local_Syntax.syn_of o syntax_of;
wenzelm@33387
   254
val set_syntax_mode = map_syntax o Local_Syntax.set_mode;
wenzelm@33387
   255
val restore_syntax_mode = map_syntax o Local_Syntax.restore_mode o syntax_of;
wenzelm@19001
   256
wenzelm@36450
   257
val tsig_of = #1 o #tsig o rep_context;
wenzelm@36451
   258
val set_defsort = map_tsig o apfst o Type.set_defsort;
wenzelm@35680
   259
fun default_sort ctxt = the_default (Type.defaultS (tsig_of ctxt)) o Variable.def_sort ctxt;
wenzelm@35669
   260
wenzelm@25052
   261
val consts_of = #1 o #consts o rep_context;
haftmann@24752
   262
val the_const_constraint = Consts.the_constraint o consts_of;
wenzelm@5819
   263
wenzelm@26284
   264
val facts_of = #facts o rep_context;
wenzelm@16540
   265
val cases_of = #cases o rep_context;
wenzelm@5819
   266
wenzelm@5819
   267
wenzelm@20367
   268
(* theory transfer *)
wenzelm@12093
   269
wenzelm@35669
   270
fun transfer_syntax thy ctxt = ctxt |>
wenzelm@35669
   271
  map_syntax (Local_Syntax.rebuild thy) |>
wenzelm@36450
   272
  map_tsig (fn tsig as (local_tsig, global_tsig) =>
wenzelm@35669
   273
    let val thy_tsig = Sign.tsig_of thy in
wenzelm@36450
   274
      if Type.eq_tsig (thy_tsig, global_tsig) then tsig
wenzelm@36450
   275
      else (Type.merge_tsig (Syntax.pp ctxt) (local_tsig, thy_tsig), thy_tsig)
wenzelm@35669
   276
    end) |>
wenzelm@30424
   277
  map_consts (fn consts as (local_consts, global_consts) =>
wenzelm@30424
   278
    let val thy_consts = Sign.consts_of thy in
wenzelm@30424
   279
      if Consts.eq_consts (thy_consts, global_consts) then consts
wenzelm@30424
   280
      else (Consts.merge (local_consts, thy_consts), thy_consts)
wenzelm@30424
   281
    end);
wenzelm@17072
   282
wenzelm@33031
   283
fun transfer thy = Context.raw_transfer thy #> transfer_syntax thy;
wenzelm@17072
   284
wenzelm@38756
   285
fun background_theory f ctxt = transfer (f (theory_of ctxt)) ctxt;
wenzelm@20367
   286
wenzelm@38756
   287
fun background_theory_result f ctxt =
wenzelm@20367
   288
  let val (res, thy') = f (theory_of ctxt)
wenzelm@20367
   289
  in (res, ctxt |> transfer thy') end;
wenzelm@19019
   290
wenzelm@12093
   291
wenzelm@12093
   292
wenzelm@14828
   293
(** pretty printing **)
wenzelm@14828
   294
wenzelm@28212
   295
(* extern *)
wenzelm@28212
   296
wenzelm@28212
   297
fun extern_fact ctxt name =
wenzelm@28212
   298
  let
wenzelm@28212
   299
    val local_facts = facts_of ctxt;
wenzelm@39557
   300
    val global_facts = Global_Theory.facts_of (theory_of ctxt);
wenzelm@28212
   301
  in
wenzelm@28212
   302
    if is_some (Facts.lookup (Context.Proof ctxt) local_facts name)
wenzelm@28212
   303
    then Facts.extern local_facts name
wenzelm@28212
   304
    else Facts.extern global_facts name
wenzelm@28212
   305
  end;
wenzelm@28212
   306
wenzelm@28212
   307
wenzelm@28212
   308
(* pretty *)
wenzelm@28212
   309
wenzelm@24922
   310
fun pretty_term_abbrev ctxt = Syntax.pretty_term (set_mode mode_abbrev ctxt);
wenzelm@14828
   311
wenzelm@28212
   312
fun pretty_fact_name ctxt a = Pretty.block
wenzelm@28212
   313
  [Pretty.markup (Markup.fact a) [Pretty.str (extern_fact ctxt a)], Pretty.str ":"];
wenzelm@28209
   314
wenzelm@32090
   315
fun pretty_fact_aux ctxt flag ("", ths) =
wenzelm@32090
   316
      Display.pretty_thms_aux ctxt flag ths
wenzelm@30723
   317
  | pretty_fact_aux ctxt flag (a, [th]) = Pretty.block
wenzelm@32090
   318
      [pretty_fact_name ctxt a, Pretty.brk 1, Display.pretty_thm_aux ctxt flag th]
wenzelm@30723
   319
  | pretty_fact_aux ctxt flag (a, ths) = Pretty.block
wenzelm@32090
   320
      (Pretty.fbreaks (pretty_fact_name ctxt a :: map (Display.pretty_thm_aux ctxt flag) ths));
wenzelm@30723
   321
wenzelm@30723
   322
fun pretty_fact ctxt = pretty_fact_aux ctxt true;
wenzelm@14828
   323
wenzelm@14828
   324
wenzelm@14828
   325
wenzelm@5819
   326
(** prepare types **)
wenzelm@5819
   327
wenzelm@35669
   328
(* classes *)
wenzelm@35669
   329
wenzelm@35669
   330
fun read_class ctxt text =
wenzelm@35669
   331
  let
wenzelm@35669
   332
    val tsig = tsig_of ctxt;
wenzelm@35669
   333
    val (syms, pos) = Syntax.read_token text;
wenzelm@35669
   334
    val c = Type.cert_class tsig (Type.intern_class tsig (Symbol_Pos.content syms))
wenzelm@35669
   335
      handle TYPE (msg, _, _) => error (msg ^ Position.str_of pos);
wenzelm@39507
   336
    val _ = Context_Position.report ctxt pos (Markup.tclass c);
wenzelm@35669
   337
  in c end;
wenzelm@35669
   338
wenzelm@35669
   339
wenzelm@35669
   340
(* type arities *)
wenzelm@35669
   341
wenzelm@35669
   342
local
wenzelm@35669
   343
wenzelm@35669
   344
fun prep_arity prep_tycon prep_sort ctxt (t, Ss, S) =
wenzelm@35669
   345
  let val arity = (prep_tycon ctxt t, map (prep_sort ctxt) Ss, prep_sort ctxt S)
wenzelm@35669
   346
  in Type.add_arity (Syntax.pp ctxt) arity (tsig_of ctxt); arity end;
wenzelm@35669
   347
wenzelm@35669
   348
in
wenzelm@35669
   349
wenzelm@35669
   350
val read_arity = prep_arity (Type.intern_type o tsig_of) Syntax.read_sort;
wenzelm@35669
   351
val cert_arity = prep_arity (K I) (Type.cert_sort o tsig_of);
wenzelm@35669
   352
wenzelm@35669
   353
end;
wenzelm@35669
   354
wenzelm@35669
   355
wenzelm@35669
   356
(* types *)
wenzelm@24277
   357
wenzelm@24277
   358
fun read_typ_mode mode ctxt s =
wenzelm@24486
   359
  Syntax.read_typ (Type.set_mode mode ctxt) s;
wenzelm@24277
   360
wenzelm@35669
   361
val read_typ = read_typ_mode Type.mode_default;
wenzelm@24277
   362
val read_typ_syntax = read_typ_mode Type.mode_syntax;
wenzelm@24277
   363
val read_typ_abbrev = read_typ_mode Type.mode_abbrev;
wenzelm@24277
   364
wenzelm@24277
   365
wenzelm@24277
   366
fun cert_typ_mode mode ctxt T =
wenzelm@35669
   367
  Type.cert_typ_mode mode (tsig_of ctxt) T
wenzelm@24277
   368
    handle TYPE (msg, _, _) => error msg;
wenzelm@24277
   369
wenzelm@35669
   370
val cert_typ = cert_typ_mode Type.mode_default;
wenzelm@24277
   371
val cert_typ_syntax = cert_typ_mode Type.mode_syntax;
wenzelm@24277
   372
val cert_typ_abbrev = cert_typ_mode Type.mode_abbrev;
wenzelm@24277
   373
wenzelm@24277
   374
wenzelm@24388
   375
wenzelm@24388
   376
(** prepare variables **)
wenzelm@24388
   377
wenzelm@7679
   378
(* internalize Skolem constants *)
wenzelm@7679
   379
wenzelm@19897
   380
val lookup_skolem = AList.lookup (op =) o Variable.fixes_of;
wenzelm@18187
   381
fun get_skolem ctxt x = the_default x (lookup_skolem ctxt x);
wenzelm@7679
   382
wenzelm@18678
   383
fun no_skolem internal x =
wenzelm@20086
   384
  if can Name.dest_skolem x then
wenzelm@18678
   385
    error ("Illegal reference to internal Skolem constant: " ^ quote x)
wenzelm@20086
   386
  else if not internal andalso can Name.dest_internal x then
wenzelm@18678
   387
    error ("Illegal reference to internal variable: " ^ quote x)
wenzelm@7679
   388
  else x;
wenzelm@7679
   389
wenzelm@7679
   390
wenzelm@26717
   391
(* revert Skolem constants -- if possible *)
wenzelm@18255
   392
wenzelm@26717
   393
fun revert_skolem ctxt x =
wenzelm@26717
   394
  (case find_first (fn (_, y) => y = x) (Variable.fixes_of ctxt) of
wenzelm@26717
   395
    SOME (x', _) => if lookup_skolem ctxt x' = SOME x then x' else x
wenzelm@26717
   396
  | NONE => x);
wenzelm@9133
   397
wenzelm@8096
   398
wenzelm@26705
   399
(* default token translations *)
wenzelm@26705
   400
wenzelm@26705
   401
local
wenzelm@26705
   402
wenzelm@26717
   403
fun free_or_skolem ctxt x =
wenzelm@26717
   404
  (if can Name.dest_skolem x then Pretty.mark Markup.skolem (Pretty.str (revert_skolem ctxt x))
wenzelm@26717
   405
   else Pretty.mark Markup.free (Pretty.str x))
wenzelm@26930
   406
  |> Pretty.mark
wenzelm@26939
   407
    (if Variable.is_fixed ctxt x orelse Syntax.is_pretty_global ctxt then Markup.fixed x
wenzelm@26930
   408
     else Markup.hilite);
wenzelm@26705
   409
wenzelm@26705
   410
fun var_or_skolem _ s =
wenzelm@26705
   411
  (case Lexicon.read_variable s of
wenzelm@26705
   412
    SOME (x, i) =>
wenzelm@26705
   413
      (case try Name.dest_skolem x of
wenzelm@26705
   414
        NONE => Pretty.mark Markup.var (Pretty.str s)
wenzelm@38980
   415
      | SOME x' => Pretty.mark Markup.skolem (Pretty.str (Term.string_of_vname (x', i))))
wenzelm@26705
   416
  | NONE => Pretty.mark Markup.var (Pretty.str s));
wenzelm@26705
   417
wenzelm@26705
   418
fun plain_markup m _ s = Pretty.mark m (Pretty.str s);
wenzelm@26705
   419
wenzelm@26705
   420
val token_trans =
wenzelm@26705
   421
 Syntax.tokentrans_mode ""
wenzelm@35429
   422
  [("tfree", plain_markup Markup.tfree),
wenzelm@26705
   423
   ("tvar", plain_markup Markup.tvar),
wenzelm@26705
   424
   ("free", free_or_skolem),
wenzelm@26705
   425
   ("bound", plain_markup Markup.bound),
wenzelm@26705
   426
   ("var", var_or_skolem),
wenzelm@29318
   427
   ("numeral", plain_markup Markup.numeral),
wenzelm@29318
   428
   ("inner_string", plain_markup Markup.inner_string)];
wenzelm@26705
   429
wenzelm@26705
   430
in val _ = Context.>> (Context.map_theory (Sign.add_tokentrfuns token_trans)) end;
wenzelm@26705
   431
wenzelm@26705
   432
wenzelm@18187
   433
wenzelm@5819
   434
(** prepare terms and propositions **)
wenzelm@5819
   435
wenzelm@25328
   436
(* inferred types of parameters *)
wenzelm@25328
   437
wenzelm@25328
   438
fun infer_type ctxt x =
wenzelm@36505
   439
  Term.fastype_of (singleton (Syntax.check_terms (set_mode mode_schematic ctxt)) (Free x));
wenzelm@25328
   440
wenzelm@25328
   441
fun inferred_param x ctxt =
wenzelm@36505
   442
  let val T = infer_type ctxt (x, dummyT)
wenzelm@28082
   443
  in (T, ctxt |> Variable.declare_term (Free (x, T))) end;
wenzelm@25328
   444
wenzelm@25328
   445
fun inferred_fixes ctxt =
wenzelm@28082
   446
  let
wenzelm@28082
   447
    val xs = rev (map #2 (Variable.fixes_of ctxt));
wenzelm@28082
   448
    val (Ts, ctxt') = fold_map inferred_param xs ctxt;
wenzelm@28082
   449
  in (xs ~~ Ts, ctxt') end;
wenzelm@25328
   450
wenzelm@25328
   451
wenzelm@25328
   452
(* type and constant names *)
wenzelm@25328
   453
wenzelm@27821
   454
local
wenzelm@27821
   455
wenzelm@30573
   456
val token_content = Syntax.read_token #>> Symbol_Pos.content;
wenzelm@27821
   457
wenzelm@35399
   458
fun prep_const_proper ctxt strict (c, pos) =
wenzelm@35399
   459
  let
wenzelm@35399
   460
    fun err msg = error (msg ^ Position.str_of pos);
wenzelm@35399
   461
    val consts = consts_of ctxt;
wenzelm@35399
   462
    val t as Const (d, _) =
wenzelm@35399
   463
      (case Variable.lookup_const ctxt c of
wenzelm@35399
   464
        SOME d =>
wenzelm@35399
   465
          Const (d, Consts.type_scheme (consts_of ctxt) d handle TYPE (msg, _, _) => err msg)
wenzelm@35399
   466
      | NONE => Consts.read_const consts c);
wenzelm@35399
   467
    val _ =
wenzelm@35399
   468
      if strict then ignore (Consts.the_type consts d) handle TYPE (msg, _, _) => err msg
wenzelm@35399
   469
      else ();
wenzelm@39507
   470
    val _ = Context_Position.report ctxt pos (Markup.const d);
wenzelm@35399
   471
  in t end;
wenzelm@27821
   472
wenzelm@27821
   473
in
wenzelm@25328
   474
wenzelm@35399
   475
fun read_type_name ctxt strict text =
wenzelm@27821
   476
  let
wenzelm@35669
   477
    val tsig = tsig_of ctxt;
wenzelm@35399
   478
    val (c, pos) = token_content text;
wenzelm@27821
   479
  in
wenzelm@27821
   480
    if Syntax.is_tid c then
wenzelm@39507
   481
     (Context_Position.report ctxt pos Markup.tfree;
wenzelm@35680
   482
      TFree (c, default_sort ctxt (c, ~1)))
wenzelm@27821
   483
    else
wenzelm@27821
   484
      let
wenzelm@35669
   485
        val d = Type.intern_type tsig c;
wenzelm@35669
   486
        val decl = Type.the_decl tsig d;
wenzelm@39507
   487
        val _ = Context_Position.report ctxt pos (Markup.tycon d);
wenzelm@35360
   488
        fun err () = error ("Bad type name: " ^ quote d);
wenzelm@35360
   489
        val args =
wenzelm@35360
   490
          (case decl of
wenzelm@35360
   491
            Type.LogicalType n => n
wenzelm@35360
   492
          | Type.Abbreviation (vs, _, _) => if strict then err () else length vs
wenzelm@35360
   493
          | Type.Nonterminal => if strict then err () else 0);
wenzelm@35360
   494
      in Type (d, replicate args dummyT) end
wenzelm@27821
   495
  end;
wenzelm@25328
   496
wenzelm@35669
   497
fun read_type_name_proper ctxt strict text =
wenzelm@35669
   498
  (case read_type_name ctxt strict text of
wenzelm@35669
   499
    T as Type _ => T
wenzelm@35669
   500
  | T => error ("Not a type constructor: " ^ Syntax.string_of_typ ctxt T));
wenzelm@35669
   501
wenzelm@35669
   502
wenzelm@35399
   503
fun read_const_proper ctxt strict = prep_const_proper ctxt strict o token_content;
wenzelm@27821
   504
wenzelm@36505
   505
fun read_const ctxt strict ty text =
wenzelm@36542
   506
  let
wenzelm@36542
   507
    val (c, pos) = token_content text;
wenzelm@36542
   508
    val _ = no_skolem false c;
wenzelm@36542
   509
  in
wenzelm@27821
   510
    (case (lookup_skolem ctxt c, Variable.is_const ctxt c) of
wenzelm@27821
   511
      (SOME x, false) =>
wenzelm@39507
   512
        (Context_Position.report ctxt pos
wenzelm@39507
   513
            (Markup.name x (if can Name.dest_skolem x then Markup.skolem else Markup.free));
wenzelm@36505
   514
          Free (x, infer_type ctxt (x, ty)))
wenzelm@35399
   515
    | _ => prep_const_proper ctxt strict (c, pos))
wenzelm@27821
   516
  end;
wenzelm@27821
   517
wenzelm@27821
   518
end;
wenzelm@25328
   519
wenzelm@25328
   520
wenzelm@24684
   521
(* read_term *)
wenzelm@24684
   522
wenzelm@24684
   523
fun read_term_mode mode ctxt = Syntax.read_term (set_mode mode ctxt);
wenzelm@24684
   524
wenzelm@24684
   525
val read_term_pattern   = read_term_mode mode_pattern;
wenzelm@24684
   526
val read_term_schematic = read_term_mode mode_schematic;
wenzelm@24684
   527
val read_term_abbrev    = read_term_mode mode_abbrev;
wenzelm@24684
   528
wenzelm@24684
   529
wenzelm@19001
   530
(* local abbreviations *)
wenzelm@5819
   531
wenzelm@24501
   532
local
wenzelm@24501
   533
haftmann@26731
   534
fun certify_consts ctxt = Consts.certify (Syntax.pp ctxt) (tsig_of ctxt)
wenzelm@27286
   535
  (not (abbrev_mode ctxt)) (consts_of ctxt);
wenzelm@19001
   536
wenzelm@38979
   537
fun expand_binds ctxt =
wenzelm@38979
   538
  let
wenzelm@38979
   539
    val Mode {pattern, schematic, ...} = get_mode ctxt;
wenzelm@5819
   540
wenzelm@38979
   541
    fun reject_schematic (t as Var _) =
wenzelm@38979
   542
          error ("Unbound schematic variable: " ^ Syntax.string_of_term ctxt t)
wenzelm@38979
   543
      | reject_schematic (Abs (_, _, t)) = reject_schematic t
wenzelm@38979
   544
      | reject_schematic (t $ u) = (reject_schematic t; reject_schematic u)
wenzelm@38979
   545
      | reject_schematic _ = ();
wenzelm@38979
   546
  in
wenzelm@24495
   547
    if pattern then I
wenzelm@24495
   548
    else Variable.expand_binds ctxt #> (if schematic then I else tap reject_schematic)
wenzelm@24495
   549
  end;
wenzelm@5819
   550
wenzelm@24501
   551
in
wenzelm@24501
   552
wenzelm@24501
   553
fun expand_abbrevs ctxt = certify_consts ctxt #> expand_binds ctxt;
wenzelm@24501
   554
wenzelm@24501
   555
end;
wenzelm@24501
   556
wenzelm@5819
   557
wenzelm@24922
   558
fun contract_abbrevs ctxt t =
wenzelm@24922
   559
  let
wenzelm@24922
   560
    val thy = theory_of ctxt;
wenzelm@24922
   561
    val consts = consts_of ctxt;
wenzelm@24922
   562
    val Mode {abbrev, ...} = get_mode ctxt;
wenzelm@30566
   563
    val retrieve = Consts.retrieve_abbrevs consts (print_mode_value () @ [""]);
wenzelm@30566
   564
    fun match_abbrev u = Option.map #1 (get_first (Pattern.match_rew thy u) (retrieve u));
wenzelm@24922
   565
  in
wenzelm@25052
   566
    if abbrev orelse print_mode_active "no_abbrevs" orelse not (can Term.type_of t) then t
berghofe@35211
   567
    else Pattern.rewrite_term_top thy [] [match_abbrev] t
wenzelm@24922
   568
  end;
wenzelm@24922
   569
wenzelm@24922
   570
wenzelm@24518
   571
(* patterns *)
wenzelm@24518
   572
wenzelm@32003
   573
fun prepare_patternT ctxt T =
wenzelm@32003
   574
  let
wenzelm@32003
   575
    val Mode {pattern, schematic, ...} = get_mode ctxt;
wenzelm@32003
   576
    val _ =
wenzelm@32003
   577
      pattern orelse schematic orelse
wenzelm@32003
   578
        T |> Term.exists_subtype
wenzelm@38979
   579
          (fn T as TVar (xi, _) =>
wenzelm@37145
   580
            not (Type_Infer.is_param xi) andalso
wenzelm@38979
   581
              error ("Illegal schematic type variable: " ^ Syntax.string_of_typ ctxt T)
wenzelm@32003
   582
          | _ => false)
wenzelm@32003
   583
  in T end;
wenzelm@24518
   584
wenzelm@22712
   585
wenzelm@24505
   586
local
wenzelm@6550
   587
wenzelm@39508
   588
val dummies = Config.bool (Config.declare "ProofContext.dummies" (K (Config.Bool false)));
wenzelm@27259
   589
wenzelm@27259
   590
fun check_dummies ctxt t =
wenzelm@39508
   591
  if Config.get ctxt dummies then t
wenzelm@27259
   592
  else Term.no_dummy_patterns t handle TERM _ => error "Illegal dummy pattern(s) in term";
wenzelm@27259
   593
wenzelm@24767
   594
fun prepare_dummies ts = #1 (fold_map Term.replace_dummy_patterns ts 1);
wenzelm@6762
   595
wenzelm@27259
   596
in
wenzelm@6550
   597
wenzelm@39508
   598
val allow_dummies = Config.put dummies true;
wenzelm@24505
   599
wenzelm@24684
   600
fun prepare_patterns ctxt =
wenzelm@24518
   601
  let val Mode {pattern, ...} = get_mode ctxt in
wenzelm@39296
   602
    Type_Infer.fixate ctxt #>
wenzelm@24767
   603
    pattern ? Variable.polymorphic ctxt #>
wenzelm@24684
   604
    (map o Term.map_types) (prepare_patternT ctxt) #>
wenzelm@27259
   605
    (if pattern then prepare_dummies else map (check_dummies ctxt))
wenzelm@24505
   606
  end;
wenzelm@24505
   607
wenzelm@24505
   608
end;
wenzelm@24505
   609
wenzelm@6550
   610
wenzelm@22763
   611
(* decoding raw terms (syntax trees) *)
wenzelm@22763
   612
wenzelm@27286
   613
(* types *)
wenzelm@27286
   614
wenzelm@36448
   615
fun get_sort ctxt raw_text =
wenzelm@27286
   616
  let
wenzelm@35669
   617
    val tsig = tsig_of ctxt;
wenzelm@27286
   618
wenzelm@36448
   619
    val text = distinct (op =) (map (apsnd (Type.minimize_sort tsig)) raw_text);
wenzelm@36152
   620
    val _ =
wenzelm@36448
   621
      (case duplicates (eq_fst (op =)) text of
wenzelm@36152
   622
        [] => ()
wenzelm@27286
   623
      | dups => error ("Inconsistent sort constraints for type variable(s) "
wenzelm@27286
   624
          ^ commas_quote (map (Term.string_of_vname' o fst) dups)));
wenzelm@27286
   625
wenzelm@36152
   626
    fun lookup xi =
wenzelm@36448
   627
      (case AList.lookup (op =) text xi of
wenzelm@36152
   628
        NONE => NONE
wenzelm@36152
   629
      | SOME S => if S = dummyS then NONE else SOME S);
wenzelm@36152
   630
wenzelm@27286
   631
    fun get xi =
wenzelm@36152
   632
      (case (lookup xi, Variable.def_sort ctxt xi) of
wenzelm@27286
   633
        (NONE, NONE) => Type.defaultS tsig
wenzelm@27286
   634
      | (NONE, SOME S) => S
wenzelm@27286
   635
      | (SOME S, NONE) => S
wenzelm@27286
   636
      | (SOME S, SOME S') =>
wenzelm@27286
   637
          if Type.eq_sort tsig (S, S') then S'
wenzelm@35669
   638
          else error ("Sort constraint " ^ Syntax.string_of_sort ctxt S ^
wenzelm@35669
   639
            " inconsistent with default " ^ Syntax.string_of_sort ctxt S' ^
wenzelm@30815
   640
            " for type variable " ^ quote (Term.string_of_vname' xi)));
wenzelm@36448
   641
  in get end;
wenzelm@27286
   642
wenzelm@36152
   643
fun check_tvar ctxt (xi, S) = (xi, get_sort ctxt [(xi, S)] xi);
wenzelm@36152
   644
fun check_tfree ctxt (x, S) = apfst fst (check_tvar ctxt ((x, ~1), S));
wenzelm@36152
   645
wenzelm@25353
   646
local
wenzelm@25353
   647
wenzelm@25353
   648
fun intern_skolem ctxt def_type x =
wenzelm@22763
   649
  let
wenzelm@25353
   650
    val _ = no_skolem false x;
wenzelm@22763
   651
    val sko = lookup_skolem ctxt x;
wenzelm@35399
   652
    val is_const = can (read_const_proper ctxt false) x orelse Long_Name.is_qualified x;
wenzelm@22763
   653
    val is_declared = is_some (def_type (x, ~1));
wenzelm@25319
   654
  in
wenzelm@25353
   655
    if Variable.is_const ctxt x then NONE
wenzelm@25353
   656
    else if is_some sko then sko
wenzelm@25353
   657
    else if not is_const orelse is_declared then SOME x
wenzelm@25353
   658
    else NONE
wenzelm@25319
   659
  end;
wenzelm@22763
   660
wenzelm@25353
   661
in
wenzelm@25353
   662
wenzelm@24371
   663
fun term_context ctxt =
wenzelm@36152
   664
  {get_sort = get_sort ctxt,
wenzelm@35669
   665
   map_const = fn a => ((true, #1 (Term.dest_Const (read_const_proper ctxt false a)))
wenzelm@35669
   666
     handle ERROR _ => (false, Consts.intern (consts_of ctxt) a)),
wenzelm@35669
   667
   map_free = intern_skolem ctxt (Variable.def_type ctxt false)};
wenzelm@24371
   668
wenzelm@22763
   669
fun decode_term ctxt =
wenzelm@35429
   670
  let val {get_sort, map_const, map_free} = term_context ctxt
wenzelm@35429
   671
  in Syntax.decode_term get_sort map_const map_free end;
wenzelm@22763
   672
wenzelm@10554
   673
end;
wenzelm@10554
   674
wenzelm@5819
   675
wenzelm@5819
   676
(* certify terms *)
wenzelm@5819
   677
wenzelm@10554
   678
local
wenzelm@10554
   679
wenzelm@24684
   680
fun gen_cert prop ctxt t =
wenzelm@24684
   681
  t
wenzelm@24684
   682
  |> expand_abbrevs ctxt
wenzelm@24961
   683
  |> (fn t' => #1 (Sign.certify' prop (Syntax.pp ctxt) false (consts_of ctxt) (theory_of ctxt) t')
wenzelm@24684
   684
    handle TYPE (msg, _, _) => error msg
wenzelm@24684
   685
      | TERM (msg, _) => error msg);
wenzelm@16501
   686
wenzelm@10554
   687
in
wenzelm@8096
   688
wenzelm@24684
   689
val cert_term = gen_cert false;
wenzelm@24684
   690
val cert_prop = gen_cert true;
wenzelm@10554
   691
wenzelm@10554
   692
end;
wenzelm@5819
   693
wenzelm@5819
   694
wenzelm@24495
   695
(* type checking/inference *)
wenzelm@22701
   696
wenzelm@35616
   697
fun def_type ctxt =
wenzelm@35616
   698
  let val Mode {pattern, ...} = get_mode ctxt
wenzelm@35616
   699
  in Variable.def_type ctxt pattern end;
wenzelm@35616
   700
wenzelm@39291
   701
fun standard_infer_types ctxt =
wenzelm@39291
   702
  Type_Infer.infer_types ctxt (try (Consts.the_constraint (consts_of ctxt))) (def_type ctxt);
wenzelm@24486
   703
wenzelm@25406
   704
local
wenzelm@25406
   705
wenzelm@24518
   706
fun standard_typ_check ctxt =
wenzelm@24518
   707
  map (cert_typ_mode (Type.get_mode ctxt) ctxt) #>
wenzelm@24518
   708
  map (prepare_patternT ctxt);
wenzelm@24518
   709
wenzelm@24769
   710
fun standard_term_check ctxt =
wenzelm@24769
   711
  standard_infer_types ctxt #>
wenzelm@24769
   712
  map (expand_abbrevs ctxt);
wenzelm@24922
   713
wenzelm@24922
   714
fun standard_term_uncheck ctxt =
wenzelm@24922
   715
  map (contract_abbrevs ctxt);
wenzelm@24922
   716
wenzelm@26463
   717
fun add eq what f = Context.>> (what (fn xs => fn ctxt =>
wenzelm@26463
   718
  let val xs' = f ctxt xs in if eq_list eq (xs, xs') then NONE else SOME (xs', ctxt) end));
wenzelm@24767
   719
wenzelm@24518
   720
in
wenzelm@24518
   721
wenzelm@25060
   722
val _ = add (op =) (Syntax.add_typ_check 0 "standard") standard_typ_check;
wenzelm@25060
   723
val _ = add (op aconv) (Syntax.add_term_check 0 "standard") standard_term_check;
wenzelm@25060
   724
val _ = add (op aconv) (Syntax.add_term_check 100 "fixate") prepare_patterns;
wenzelm@24922
   725
wenzelm@25060
   726
val _ = add (op aconv) (Syntax.add_term_uncheck 0 "standard") standard_term_uncheck;
wenzelm@22701
   727
wenzelm@24518
   728
end;
wenzelm@22701
   729
wenzelm@22701
   730
wenzelm@9553
   731
wenzelm@24767
   732
(** inner syntax operations **)
wenzelm@24371
   733
wenzelm@24371
   734
local
wenzelm@24371
   735
wenzelm@39171
   736
fun parse_failed ctxt pos msg kind =
wenzelm@39441
   737
  cat_error msg ("Failed to parse " ^ kind ^
wenzelm@39507
   738
    Markup.markup Markup.report (Context_Position.reported_text ctxt pos Markup.bad ""));
wenzelm@39171
   739
wenzelm@27754
   740
fun parse_sort ctxt text =
wenzelm@27754
   741
  let
wenzelm@38238
   742
    val (syms, pos) = Syntax.parse_token ctxt Markup.sort text;
wenzelm@35429
   743
    val S = Syntax.standard_parse_sort ctxt (syn_of ctxt) (syms, pos)
wenzelm@39171
   744
      handle ERROR msg => parse_failed ctxt pos msg "sort";
wenzelm@36448
   745
  in Type.minimize_sort (tsig_of ctxt) S end;
wenzelm@27754
   746
wenzelm@27754
   747
fun parse_typ ctxt text =
wenzelm@24371
   748
  let
wenzelm@38238
   749
    val (syms, pos) = Syntax.parse_token ctxt Markup.typ text;
wenzelm@36152
   750
    val T = Syntax.standard_parse_typ ctxt (syn_of ctxt) (get_sort ctxt) (syms, pos)
wenzelm@39171
   751
      handle ERROR msg => parse_failed ctxt pos msg "type";
wenzelm@27754
   752
  in T end;
wenzelm@24371
   753
wenzelm@27754
   754
fun parse_term T ctxt text =
wenzelm@24371
   755
  let
wenzelm@35429
   756
    val {get_sort, map_const, map_free} = term_context ctxt;
wenzelm@27754
   757
wenzelm@37145
   758
    val (T', _) = Type_Infer.paramify_dummies T 0;
wenzelm@39045
   759
    val (markup, kind) =
wenzelm@39045
   760
      if T' = propT then (Markup.prop, "proposition") else (Markup.term, "term");
wenzelm@38238
   761
    val (syms, pos) = Syntax.parse_token ctxt markup text;
wenzelm@27754
   762
wenzelm@39288
   763
    fun check t = (Syntax.check_term ctxt (Type.constraint T' t); NONE)
wenzelm@25476
   764
      handle ERROR msg => SOME msg;
wenzelm@35429
   765
    val t =
wenzelm@39136
   766
      Syntax.standard_parse_term check get_sort map_const map_free
wenzelm@35669
   767
        ctxt (Type.is_logtype (tsig_of ctxt)) (syn_of ctxt) T' (syms, pos)
wenzelm@39171
   768
      handle ERROR msg => parse_failed ctxt pos msg kind;
wenzelm@27754
   769
  in t end;
wenzelm@24371
   770
wenzelm@24922
   771
wenzelm@35429
   772
fun unparse_sort ctxt =
wenzelm@35669
   773
  Syntax.standard_unparse_sort {extern_class = Type.extern_class (tsig_of ctxt)}
wenzelm@35429
   774
    ctxt (syn_of ctxt);
wenzelm@24922
   775
wenzelm@35429
   776
fun unparse_typ ctxt =
wenzelm@35429
   777
  let
wenzelm@35669
   778
    val tsig = tsig_of ctxt;
wenzelm@35669
   779
    val extern = {extern_class = Type.extern_class tsig, extern_type = Type.extern_type tsig};
wenzelm@35429
   780
  in Syntax.standard_unparse_typ extern ctxt (syn_of ctxt) end;
wenzelm@24922
   781
wenzelm@35429
   782
fun unparse_term ctxt =
wenzelm@24922
   783
  let
wenzelm@35669
   784
    val tsig = tsig_of ctxt;
wenzelm@24922
   785
    val syntax = syntax_of ctxt;
wenzelm@24922
   786
    val consts = consts_of ctxt;
wenzelm@35429
   787
    val extern =
wenzelm@35669
   788
     {extern_class = Type.extern_class tsig,
wenzelm@35669
   789
      extern_type = Type.extern_type tsig,
wenzelm@35429
   790
      extern_const = Consts.extern consts};
wenzelm@24922
   791
  in
wenzelm@35429
   792
    Syntax.standard_unparse_term (Local_Syntax.idents_of syntax) extern ctxt
wenzelm@39557
   793
      (Local_Syntax.syn_of syntax) (not (Pure_Thy.old_appl_syntax (theory_of ctxt)))
wenzelm@24922
   794
  end;
wenzelm@24922
   795
wenzelm@24371
   796
in
wenzelm@24371
   797
wenzelm@24767
   798
val _ = Syntax.install_operations
wenzelm@24767
   799
  {parse_sort = parse_sort,
wenzelm@24767
   800
   parse_typ = parse_typ,
wenzelm@24767
   801
   parse_term = parse_term dummyT,
wenzelm@24767
   802
   parse_prop = parse_term propT,
wenzelm@24922
   803
   unparse_sort = unparse_sort,
wenzelm@24922
   804
   unparse_typ = unparse_typ,
wenzelm@24922
   805
   unparse_term = unparse_term};
wenzelm@24371
   806
wenzelm@24371
   807
end;
wenzelm@24371
   808
wenzelm@24371
   809
wenzelm@24371
   810
wenzelm@21610
   811
(** export results **)
wenzelm@21531
   812
wenzelm@20310
   813
fun common_export is_goal inner outer =
wenzelm@20310
   814
  map (Assumption.export is_goal inner outer) #>
wenzelm@20310
   815
  Variable.export inner outer;
wenzelm@8616
   816
wenzelm@20310
   817
val goal_export = common_export true;
wenzelm@20310
   818
val export = common_export false;
wenzelm@12704
   819
wenzelm@21531
   820
fun export_morphism inner outer =
wenzelm@21531
   821
  Assumption.export_morphism inner outer $>
wenzelm@21531
   822
  Variable.export_morphism inner outer;
wenzelm@21531
   823
wenzelm@28396
   824
fun norm_export_morphism inner outer =
wenzelm@28396
   825
  export_morphism inner outer $>
wenzelm@28396
   826
  Morphism.thm_morphism Goal.norm_result;
wenzelm@28396
   827
wenzelm@21531
   828
wenzelm@15758
   829
wenzelm@30757
   830
(** term bindings **)
wenzelm@5819
   831
wenzelm@8096
   832
(* simult_matches *)
wenzelm@8096
   833
wenzelm@19867
   834
fun simult_matches ctxt (t, pats) =
wenzelm@19867
   835
  (case Seq.pull (Unify.matchers (theory_of ctxt) (map (rpair t) pats)) of
wenzelm@19867
   836
    NONE => error "Pattern match failed!"
wenzelm@32032
   837
  | SOME (env, _) => Vartab.fold (fn (v, (_, t)) => cons (v, t)) (Envir.term_env env) []);
wenzelm@8096
   838
wenzelm@8096
   839
wenzelm@30757
   840
(* bind_terms *)
wenzelm@7925
   841
wenzelm@30757
   842
val bind_terms = fold (fn (xi, t) => fn ctxt =>
wenzelm@24511
   843
  ctxt
wenzelm@30757
   844
  |> Variable.bind_term (xi, Option.map (cert_term (set_mode mode_default ctxt)) t));
wenzelm@5819
   845
wenzelm@30757
   846
wenzelm@30757
   847
(* auto_bind *)
wenzelm@10810
   848
wenzelm@20330
   849
fun drop_schematic (b as (xi, SOME t)) = if Term.exists_subterm is_Var t then (xi, NONE) else b
wenzelm@10554
   850
  | drop_schematic b = b;
wenzelm@10554
   851
wenzelm@30757
   852
fun auto_bind f ts ctxt = ctxt |> bind_terms (map drop_schematic (f (theory_of ctxt) ts));
wenzelm@8616
   853
wenzelm@33386
   854
val auto_bind_goal = auto_bind Auto_Bind.goal;
wenzelm@33386
   855
val auto_bind_facts = auto_bind Auto_Bind.facts;
wenzelm@7925
   856
wenzelm@5819
   857
wenzelm@8096
   858
(* match_bind(_i) *)
wenzelm@5819
   859
wenzelm@8096
   860
local
wenzelm@8096
   861
wenzelm@24684
   862
fun gen_bind prep_terms gen raw_binds ctxt =
wenzelm@5819
   863
  let
wenzelm@24684
   864
    fun prep_bind (raw_pats, t) ctxt1 =
wenzelm@24684
   865
      let
wenzelm@24684
   866
        val T = Term.fastype_of t;
wenzelm@24684
   867
        val ctxt2 = Variable.declare_term t ctxt1;
wenzelm@24684
   868
        val pats = prep_terms (set_mode mode_pattern ctxt2) T raw_pats;
wenzelm@24684
   869
        val binds = simult_matches ctxt2 (t, pats);
wenzelm@24684
   870
      in (binds, ctxt2) end;
wenzelm@7670
   871
wenzelm@24686
   872
    val ts = prep_terms ctxt dummyT (map snd raw_binds);
wenzelm@24686
   873
    val (binds, ctxt') = apfst flat (fold_map prep_bind (map fst raw_binds ~~ ts) ctxt);
wenzelm@8616
   874
    val binds' =
wenzelm@19916
   875
      if gen then map #1 binds ~~ Variable.exportT_terms ctxt' ctxt (map #2 binds)
wenzelm@8616
   876
      else binds;
skalberg@15531
   877
    val binds'' = map (apsnd SOME) binds';
wenzelm@18310
   878
    val ctxt'' =
wenzelm@19897
   879
      tap (Variable.warn_extra_tfrees ctxt)
wenzelm@18310
   880
       (if gen then
wenzelm@30757
   881
          ctxt (*sic!*) |> fold Variable.declare_term (map #2 binds') |> bind_terms binds''
wenzelm@30757
   882
        else ctxt' |> bind_terms binds'');
wenzelm@18310
   883
  in (ts, ctxt'') end;
wenzelm@8096
   884
wenzelm@8096
   885
in
wenzelm@5935
   886
wenzelm@24684
   887
fun read_terms ctxt T =
wenzelm@39288
   888
  map (Syntax.parse_term ctxt #> Type.constraint T) #> Syntax.check_terms ctxt;
wenzelm@24684
   889
wenzelm@24684
   890
val match_bind = gen_bind read_terms;
wenzelm@24684
   891
val match_bind_i = gen_bind (fn ctxt => fn _ => map (cert_term ctxt));
wenzelm@8096
   892
wenzelm@8096
   893
end;
wenzelm@5935
   894
wenzelm@5935
   895
wenzelm@10465
   896
(* propositions with patterns *)
wenzelm@5935
   897
wenzelm@10465
   898
local
wenzelm@8096
   899
wenzelm@24684
   900
fun prep_propp mode prep_props (context, args) =
wenzelm@10465
   901
  let
wenzelm@19585
   902
    fun prep (_, raw_pats) (ctxt, prop :: props) =
wenzelm@24684
   903
      let val ctxt' = Variable.declare_term prop ctxt
wenzelm@24684
   904
      in ((prop, prep_props (set_mode mode_pattern ctxt') raw_pats), (ctxt', props)) end;
wenzelm@24684
   905
wenzelm@17860
   906
    val (propp, (context', _)) = (fold_map o fold_map) prep args
wenzelm@24684
   907
      (context, prep_props (set_mode mode context) (maps (map fst) args));
wenzelm@10465
   908
  in (context', propp) end;
wenzelm@5935
   909
wenzelm@24684
   910
fun gen_bind_propp mode parse_prop (ctxt, raw_args) =
wenzelm@8096
   911
  let
wenzelm@24684
   912
    val (ctxt', args) = prep_propp mode parse_prop (ctxt, raw_args);
wenzelm@19585
   913
    val binds = flat (flat (map (map (simult_matches ctxt')) args));
wenzelm@10465
   914
    val propss = map (map #1) args;
wenzelm@8616
   915
wenzelm@10554
   916
    (*generalize result: context evaluated now, binds added later*)
wenzelm@19916
   917
    val gen = Variable.exportT_terms ctxt' ctxt;
wenzelm@30757
   918
    fun gen_binds c = c |> bind_terms (map #1 binds ~~ map SOME (gen (map #2 binds)));
wenzelm@30757
   919
  in (ctxt' |> bind_terms (map (apsnd SOME) binds), (propss, gen_binds)) end;
wenzelm@8096
   920
wenzelm@10465
   921
in
wenzelm@10465
   922
wenzelm@24684
   923
val read_propp           = prep_propp mode_default Syntax.read_props;
wenzelm@24684
   924
val cert_propp           = prep_propp mode_default (map o cert_prop);
wenzelm@24684
   925
val read_propp_schematic = prep_propp mode_schematic Syntax.read_props;
wenzelm@24684
   926
val cert_propp_schematic = prep_propp mode_schematic (map o cert_prop);
wenzelm@10554
   927
wenzelm@24684
   928
val bind_propp             = gen_bind_propp mode_default Syntax.read_props;
wenzelm@24684
   929
val bind_propp_i           = gen_bind_propp mode_default (map o cert_prop);
wenzelm@24684
   930
val bind_propp_schematic   = gen_bind_propp mode_schematic Syntax.read_props;
wenzelm@24684
   931
val bind_propp_schematic_i = gen_bind_propp mode_schematic (map o cert_prop);
wenzelm@6789
   932
wenzelm@10465
   933
end;
wenzelm@10465
   934
wenzelm@6789
   935
wenzelm@5819
   936
wenzelm@5819
   937
(** theorems **)
wenzelm@5819
   938
wenzelm@18042
   939
(* fact_tac *)
wenzelm@18042
   940
wenzelm@27867
   941
fun comp_incr_tac [] _ = no_tac
wenzelm@27867
   942
  | comp_incr_tac (th :: ths) i =
wenzelm@27867
   943
      (fn st => Goal.compose_hhf_tac (Drule.incr_indexes st th) i st) APPEND comp_incr_tac ths i;
wenzelm@18042
   944
wenzelm@21687
   945
fun fact_tac facts = Goal.norm_hhf_tac THEN' comp_incr_tac facts;
wenzelm@18122
   946
wenzelm@27867
   947
fun potential_facts ctxt prop =
wenzelm@27867
   948
  Facts.could_unify (facts_of ctxt) (Term.strip_all_body prop);
wenzelm@27867
   949
wenzelm@27867
   950
fun some_fact_tac ctxt = SUBGOAL (fn (goal, i) => fact_tac (potential_facts ctxt goal) i);
wenzelm@18042
   951
wenzelm@18042
   952
wenzelm@6091
   953
(* get_thm(s) *)
wenzelm@5819
   954
wenzelm@26361
   955
local
wenzelm@26361
   956
wenzelm@26687
   957
fun retrieve_thms pick ctxt (Facts.Fact s) =
wenzelm@16501
   958
      let
wenzelm@27867
   959
        val (_, pos) = Syntax.read_token s;
wenzelm@24511
   960
        val prop = Syntax.read_prop (set_mode mode_default ctxt) s
wenzelm@24511
   961
          |> singleton (Variable.polymorphic ctxt);
wenzelm@27867
   962
wenzelm@27867
   963
        fun prove_fact th =
wenzelm@33700
   964
          Goal.prove ctxt [] [] prop (K (ALLGOALS (fact_tac [th])));
wenzelm@27867
   965
        val res =
wenzelm@27867
   966
          (case get_first (try prove_fact) (potential_facts ctxt prop) of
wenzelm@27867
   967
            SOME res => res
wenzelm@27867
   968
          | NONE => error ("Failed to retrieve literal fact" ^ Position.str_of pos ^ ":\n" ^
wenzelm@27867
   969
              Syntax.string_of_term ctxt prop))
wenzelm@27867
   970
      in pick "" [res] end
wenzelm@26687
   971
  | retrieve_thms pick ctxt xthmref =
wenzelm@18042
   972
      let
wenzelm@18042
   973
        val thy = theory_of ctxt;
wenzelm@26284
   974
        val local_facts = facts_of ctxt;
wenzelm@26673
   975
        val thmref = Facts.map_name_of_ref (Facts.intern local_facts) xthmref;
wenzelm@26336
   976
        val name = Facts.name_of_ref thmref;
wenzelm@27821
   977
        val pos = Facts.pos_of_ref xthmref;
wenzelm@24012
   978
        val thms =
wenzelm@24012
   979
          if name = "" then [Thm.transfer thy Drule.dummy_thm]
wenzelm@24012
   980
          else
wenzelm@26393
   981
            (case Facts.lookup (Context.Proof ctxt) local_facts name of
wenzelm@39507
   982
              SOME (_, ths) =>
wenzelm@39507
   983
               (Context_Position.report ctxt pos (Markup.local_fact name);
wenzelm@27821
   984
                map (Thm.transfer thy) (Facts.select thmref ths))
wenzelm@39557
   985
            | NONE => Global_Theory.get_fact (Context.Proof ctxt) thy xthmref);
wenzelm@24012
   986
      in pick name thms end;
wenzelm@5819
   987
wenzelm@26361
   988
in
wenzelm@26346
   989
wenzelm@26687
   990
val get_fact = retrieve_thms (K I);
wenzelm@26687
   991
val get_fact_single = retrieve_thms Facts.the_single;
wenzelm@26346
   992
wenzelm@26361
   993
fun get_thms ctxt = get_fact ctxt o Facts.named;
wenzelm@26361
   994
fun get_thm ctxt = get_fact_single ctxt o Facts.named;
wenzelm@26361
   995
wenzelm@26361
   996
end;
wenzelm@5819
   997
wenzelm@5819
   998
wenzelm@26284
   999
(* facts *)
wenzelm@5819
  1000
wenzelm@28082
  1001
local
wenzelm@28082
  1002
haftmann@28965
  1003
fun update_thms _ (b, NONE) ctxt = ctxt |> map_facts (Facts.del (full_name ctxt b))
haftmann@28861
  1004
  | update_thms do_props (b, SOME ths) ctxt = ctxt |> map_facts
haftmann@28864
  1005
      (Facts.add_local do_props (naming_of ctxt) (b, ths) #> snd);
wenzelm@5819
  1006
wenzelm@30761
  1007
in
wenzelm@30761
  1008
wenzelm@30761
  1009
fun note_thmss kind = fold_map (fn ((b, more_attrs), raw_facts) => fn ctxt =>
wenzelm@5819
  1010
  let
haftmann@28941
  1011
    val pos = Binding.pos_of b;
haftmann@28965
  1012
    val name = full_name ctxt b;
wenzelm@39507
  1013
    val _ = Context_Position.report ctxt pos (Markup.local_fact_decl name);
wenzelm@28082
  1014
wenzelm@39557
  1015
    val facts = Global_Theory.name_thmss false name raw_facts;
wenzelm@21443
  1016
    fun app (th, attrs) x =
wenzelm@30761
  1017
      swap (Library.foldl_map
wenzelm@30761
  1018
        (Thm.proof_attributes (surround (Thm.kind kind) (attrs @ more_attrs))) (x, th));
wenzelm@21443
  1019
    val (res, ctxt') = fold_map app facts ctxt;
wenzelm@39557
  1020
    val thms = Global_Theory.name_thms false false name (flat res);
wenzelm@24388
  1021
    val Mode {stmt, ...} = get_mode ctxt;
haftmann@28861
  1022
  in ((name, thms), ctxt' |> update_thms stmt (b, SOME thms)) end);
wenzelm@12711
  1023
wenzelm@28417
  1024
fun put_thms do_props thms ctxt = ctxt
wenzelm@28417
  1025
  |> map_naming (K local_naming)
wenzelm@33383
  1026
  |> Context_Position.set_visible false
haftmann@28965
  1027
  |> update_thms do_props (apfst Binding.name thms)
wenzelm@33383
  1028
  |> Context_Position.restore_visible ctxt
wenzelm@28417
  1029
  |> restore_naming ctxt;
wenzelm@28082
  1030
wenzelm@12711
  1031
end;
wenzelm@9196
  1032
wenzelm@5819
  1033
wenzelm@5819
  1034
wenzelm@35680
  1035
(** basic logical entities **)
wenzelm@17360
  1036
wenzelm@8096
  1037
(* variables *)
wenzelm@8096
  1038
wenzelm@19897
  1039
fun declare_var (x, opt_T, mx) ctxt =
wenzelm@22701
  1040
  let val T = (case opt_T of SOME T => T | NONE => Syntax.mixfixT mx)
wenzelm@20163
  1041
  in ((x, T, mx), ctxt |> Variable.declare_constraints (Free (x, T))) end;
wenzelm@19897
  1042
wenzelm@10381
  1043
local
wenzelm@10381
  1044
wenzelm@25353
  1045
fun prep_vars prep_typ internal =
wenzelm@35129
  1046
  fold_map (fn (b, raw_T, mx) => fn ctxt =>
wenzelm@18672
  1047
    let
wenzelm@35129
  1048
      val x = Name.of_binding b;
wenzelm@25353
  1049
      val _ = Syntax.is_identifier (no_skolem internal x) orelse
wenzelm@35129
  1050
        error ("Illegal variable name: " ^ quote (Binding.str_of b));
wenzelm@12504
  1051
wenzelm@18672
  1052
      fun cond_tvars T =
wenzelm@18672
  1053
        if internal then T
wenzelm@18678
  1054
        else Type.no_tvars T handle TYPE (msg, _, _) => error msg;
wenzelm@24277
  1055
      val opt_T = Option.map (cond_tvars o cert_typ ctxt o prep_typ ctxt) raw_T;
wenzelm@35129
  1056
      val (_, ctxt') = ctxt |> declare_var (x, opt_T, mx);
wenzelm@35129
  1057
    in ((b, opt_T, mx), ctxt') end);
wenzelm@8096
  1058
wenzelm@10381
  1059
in
wenzelm@10381
  1060
wenzelm@25353
  1061
val read_vars = prep_vars Syntax.parse_typ false;
wenzelm@25353
  1062
val cert_vars = prep_vars (K I) true;
wenzelm@8096
  1063
wenzelm@10381
  1064
end;
wenzelm@10381
  1065
wenzelm@8096
  1066
wenzelm@35680
  1067
(* authentic syntax *)
wenzelm@35669
  1068
wenzelm@35669
  1069
val _ = Context.>>
wenzelm@35669
  1070
  (Context.map_theory
wenzelm@35669
  1071
    (Sign.add_advanced_trfuns
wenzelm@35669
  1072
      (Syntax.type_ast_trs
wenzelm@35669
  1073
        {read_class = read_class,
wenzelm@35669
  1074
          read_type = fn ctxt => #1 o dest_Type o read_type_name_proper ctxt false}, [], [], [])));
wenzelm@19663
  1075
wenzelm@25159
  1076
local
wenzelm@25159
  1077
wenzelm@25159
  1078
fun const_ast_tr intern ctxt [Syntax.Variable c] =
wenzelm@19681
  1079
      let
wenzelm@35399
  1080
        val Const (c', _) = read_const_proper ctxt false c;
wenzelm@35262
  1081
        val d = if intern then Syntax.mark_const c' else c;
wenzelm@25159
  1082
      in Syntax.Constant d end
wenzelm@25159
  1083
  | const_ast_tr _ _ asts = raise Syntax.AST ("const_ast_tr", asts);
wenzelm@25159
  1084
wenzelm@35429
  1085
val typ = Simple_Syntax.read_typ;
wenzelm@35429
  1086
wenzelm@25159
  1087
in
wenzelm@19681
  1088
wenzelm@26463
  1089
val _ = Context.>> (Context.map_theory
wenzelm@35429
  1090
 (Sign.add_syntax_i
wenzelm@35429
  1091
   [("_context_const", typ "id => logic", Delimfix "CONST _"),
wenzelm@35429
  1092
    ("_context_const", typ "id => aprop", Delimfix "CONST _"),
wenzelm@35429
  1093
    ("_context_const", typ "longid => logic", Delimfix "CONST _"),
wenzelm@35429
  1094
    ("_context_const", typ "longid => aprop", Delimfix "CONST _"),
wenzelm@35429
  1095
    ("_context_xconst", typ "id => logic", Delimfix "XCONST _"),
wenzelm@35429
  1096
    ("_context_xconst", typ "id => aprop", Delimfix "XCONST _"),
wenzelm@35429
  1097
    ("_context_xconst", typ "longid => logic", Delimfix "XCONST _"),
wenzelm@35429
  1098
    ("_context_xconst", typ "longid => aprop", Delimfix "XCONST _")] #>
wenzelm@25159
  1099
  Sign.add_advanced_trfuns
wenzelm@26463
  1100
    ([("_context_const", const_ast_tr true), ("_context_xconst", const_ast_tr false)], [], [], [])));
wenzelm@25159
  1101
wenzelm@25159
  1102
end;
wenzelm@19681
  1103
wenzelm@19663
  1104
wenzelm@21744
  1105
(* notation *)
wenzelm@21744
  1106
wenzelm@24949
  1107
local
wenzelm@24949
  1108
wenzelm@35429
  1109
fun type_syntax (Type (c, args), mx) =
wenzelm@35429
  1110
      SOME (Local_Syntax.Type, (Syntax.mark_type c, Syntax.make_type (length args), mx))
wenzelm@35412
  1111
  | type_syntax _ = NONE;
wenzelm@35412
  1112
wenzelm@35412
  1113
fun const_syntax _ (Free (x, T), mx) = SOME (Local_Syntax.Fixed, (x, T, mx))
wenzelm@24949
  1114
  | const_syntax ctxt (Const (c, _), mx) =
wenzelm@35255
  1115
      (case try (Consts.type_scheme (consts_of ctxt)) c of
wenzelm@35412
  1116
        SOME T => SOME (Local_Syntax.Const, (Syntax.mark_const c, T, mx))
wenzelm@35255
  1117
      | NONE => NONE)
wenzelm@24949
  1118
  | const_syntax _ _ = NONE;
wenzelm@24949
  1119
wenzelm@35412
  1120
fun gen_notation syntax add mode args ctxt =
wenzelm@35412
  1121
  ctxt |> map_syntax
wenzelm@35412
  1122
    (Local_Syntax.update_modesyntax (theory_of ctxt) add mode (map_filter (syntax ctxt) args));
wenzelm@35412
  1123
wenzelm@24949
  1124
in
wenzelm@21744
  1125
wenzelm@35412
  1126
val type_notation = gen_notation (K type_syntax);
wenzelm@35412
  1127
val notation = gen_notation const_syntax;
wenzelm@35412
  1128
wenzelm@38328
  1129
fun target_type_notation add mode args phi =
wenzelm@35412
  1130
  let
wenzelm@35412
  1131
    val args' = args |> map_filter (fn (T, mx) =>
wenzelm@35412
  1132
      let
wenzelm@35412
  1133
        val T' = Morphism.typ phi T;
wenzelm@35412
  1134
        val similar = (case (T, T') of (Type (c, _), Type (c', _)) => c = c' | _ => false);
wenzelm@35412
  1135
      in if similar then SOME (T', mx) else NONE end);
wenzelm@35412
  1136
  in Context.mapping (Sign.type_notation add mode args') (type_notation add mode args') end;
wenzelm@24949
  1137
wenzelm@24949
  1138
fun target_notation add mode args phi =
wenzelm@33537
  1139
  let
wenzelm@33537
  1140
    val args' = args |> map_filter (fn (t, mx) =>
wenzelm@33537
  1141
      let val t' = Morphism.term phi t
wenzelm@33537
  1142
      in if Term.aconv_untyped (t, t') then SOME (t', mx) else NONE end);
wenzelm@24949
  1143
  in Context.mapping (Sign.notation add mode args') (notation add mode args') end;
wenzelm@24949
  1144
wenzelm@35680
  1145
end;
wenzelm@35412
  1146
wenzelm@35680
  1147
wenzelm@35680
  1148
(* aliases *)
wenzelm@35680
  1149
wenzelm@36450
  1150
fun class_alias b c ctxt = (map_tsig o apfst) (Type.class_alias (naming_of ctxt) b c) ctxt;
wenzelm@36450
  1151
fun type_alias b c ctxt = (map_tsig o apfst) (Type.type_alias (naming_of ctxt) b c) ctxt;
wenzelm@35680
  1152
fun const_alias b c ctxt = (map_consts o apfst) (Consts.alias (naming_of ctxt) b c) ctxt;
wenzelm@21744
  1153
wenzelm@21744
  1154
wenzelm@24767
  1155
(* local constants *)
wenzelm@24767
  1156
wenzelm@24767
  1157
fun add_const_constraint (c, opt_T) ctxt =
wenzelm@24767
  1158
  let
wenzelm@24767
  1159
    fun prepT raw_T =
wenzelm@24767
  1160
      let val T = cert_typ ctxt raw_T
wenzelm@24767
  1161
      in cert_term ctxt (Const (c, T)); T end;
haftmann@25039
  1162
  in ctxt |> (map_consts o apfst) (Consts.constrain (c, Option.map prepT opt_T)) end;
wenzelm@19001
  1163
wenzelm@33173
  1164
fun add_abbrev mode (b, raw_t) ctxt =
wenzelm@19001
  1165
  let
wenzelm@24675
  1166
    val t0 = cert_term (ctxt |> set_mode mode_abbrev) raw_t
wenzelm@30218
  1167
      handle ERROR msg => cat_error msg ("in constant abbreviation " ^ quote (Binding.str_of b));
wenzelm@20008
  1168
    val [t] = Variable.exportT_terms (Variable.declare_term t0 ctxt) ctxt [t0];
wenzelm@21807
  1169
    val ((lhs, rhs), consts') = consts_of ctxt
wenzelm@33173
  1170
      |> Consts.abbreviate (Syntax.pp ctxt) (tsig_of ctxt) (naming_of ctxt) mode (b, t);
wenzelm@19001
  1171
  in
wenzelm@19001
  1172
    ctxt
haftmann@25039
  1173
    |> (map_consts o apfst) (K consts')
wenzelm@21803
  1174
    |> Variable.declare_term rhs
wenzelm@21803
  1175
    |> pair (lhs, rhs)
wenzelm@21704
  1176
  end;
wenzelm@19001
  1177
wenzelm@25052
  1178
fun revert_abbrev mode c = (map_consts o apfst) (Consts.revert_abbrev mode c);
wenzelm@25052
  1179
wenzelm@19001
  1180
wenzelm@18672
  1181
(* fixes *)
wenzelm@5819
  1182
wenzelm@30763
  1183
fun add_fixes raw_vars ctxt =
wenzelm@8096
  1184
  let
wenzelm@30763
  1185
    val (vars, _) = cert_vars raw_vars ctxt;
wenzelm@30585
  1186
    val (xs', ctxt') = Variable.add_fixes (map (Name.of_binding o #1) vars) ctxt;
wenzelm@28082
  1187
    val ctxt'' =
wenzelm@28082
  1188
      ctxt'
wenzelm@28082
  1189
      |> fold_map declare_var (map2 (fn x' => fn (_, T, mx) => (x', T, mx)) xs' vars)
wenzelm@36503
  1190
      |-> (map_syntax o Local_Syntax.add_syntax (theory_of ctxt) o map (pair Local_Syntax.Fixed));
haftmann@28861
  1191
    val _ = (vars ~~ xs') |> List.app (fn ((b, _, _), x') =>
wenzelm@39507
  1192
      Context_Position.report ctxt (Binding.pos_of b) (Markup.fixed_decl x'));
wenzelm@28082
  1193
  in (xs', ctxt'') end;
wenzelm@5819
  1194
wenzelm@18672
  1195
wenzelm@18672
  1196
(* fixes vs. frees *)
wenzelm@12016
  1197
wenzelm@32784
  1198
fun auto_fixes (ctxt, (propss, x)) =
wenzelm@21370
  1199
  ((fold o fold) Variable.auto_fixes propss ctxt, (propss, x));
wenzelm@18672
  1200
wenzelm@18672
  1201
fun bind_fixes xs ctxt =
wenzelm@9291
  1202
  let
wenzelm@30763
  1203
    val (_, ctxt') = ctxt |> add_fixes (map (fn x => (Binding.name x, NONE, NoSyn)) xs);
wenzelm@9291
  1204
    fun bind (t as Free (x, T)) =
wenzelm@18340
  1205
          if member (op =) xs x then
skalberg@15531
  1206
            (case lookup_skolem ctxt' x of SOME x' => Free (x', T) | NONE => t)
wenzelm@9291
  1207
          else t
wenzelm@9291
  1208
      | bind (t $ u) = bind t $ bind u
wenzelm@9291
  1209
      | bind (Abs (x, T, t)) = Abs (x, T, bind t)
wenzelm@9291
  1210
      | bind a = a;
wenzelm@18672
  1211
  in (bind, ctxt') end;
wenzelm@18672
  1212
wenzelm@9291
  1213
wenzelm@9291
  1214
wenzelm@18672
  1215
(** assumptions **)
wenzelm@18187
  1216
wenzelm@20209
  1217
local
wenzelm@20209
  1218
wenzelm@20209
  1219
fun gen_assms prepp exp args ctxt =
wenzelm@20209
  1220
  let
wenzelm@20234
  1221
    val cert = Thm.cterm_of (theory_of ctxt);
wenzelm@20209
  1222
    val (propss, ctxt1) = swap (prepp (ctxt, map snd args));
wenzelm@20234
  1223
    val _ = Variable.warn_extra_tfrees ctxt ctxt1;
wenzelm@20234
  1224
    val (premss, ctxt2) = fold_burrow (Assumption.add_assms exp o map cert) propss ctxt1;
wenzelm@20234
  1225
  in
wenzelm@20234
  1226
    ctxt2
wenzelm@20234
  1227
    |> auto_bind_facts (flat propss)
wenzelm@33644
  1228
    |> note_thmss "" (map fst args ~~ map (map (fn th => ([th], []))) premss)
wenzelm@20234
  1229
  end;
wenzelm@20209
  1230
wenzelm@20209
  1231
in
wenzelm@20209
  1232
wenzelm@20209
  1233
val add_assms = gen_assms (apsnd #1 o bind_propp);
wenzelm@20209
  1234
val add_assms_i = gen_assms (apsnd #1 o bind_propp_i);
wenzelm@20209
  1235
wenzelm@20209
  1236
end;
wenzelm@20209
  1237
wenzelm@20209
  1238
wenzelm@5819
  1239
wenzelm@8373
  1240
(** cases **)
wenzelm@8373
  1241
wenzelm@16147
  1242
local
wenzelm@16147
  1243
wenzelm@16668
  1244
fun rem_case name = remove (fn (x: string, (y, _)) => x = y) name;
wenzelm@16147
  1245
wenzelm@18476
  1246
fun add_case _ ("", _) cases = cases
wenzelm@18476
  1247
  | add_case _ (name, NONE) cases = rem_case name cases
wenzelm@18476
  1248
  | add_case is_proper (name, SOME c) cases = (name, (c, is_proper)) :: rem_case name cases;
wenzelm@16147
  1249
wenzelm@18678
  1250
fun prep_case name fxs c =
wenzelm@18609
  1251
  let
wenzelm@18609
  1252
    fun replace (opt_x :: xs) ((y, T) :: ys) = (the_default y opt_x, T) :: replace xs ys
wenzelm@18609
  1253
      | replace [] ys = ys
wenzelm@18678
  1254
      | replace (_ :: _) [] = error ("Too many parameters for case " ^ quote name);
wenzelm@33368
  1255
    val Rule_Cases.Case {fixes, assumes, binds, cases} = c;
wenzelm@18609
  1256
    val fixes' = replace fxs fixes;
wenzelm@18609
  1257
    val binds' = map drop_schematic binds;
wenzelm@18609
  1258
  in
wenzelm@18609
  1259
    if null (fold (Term.add_tvarsT o snd) fixes []) andalso
wenzelm@18609
  1260
      null (fold (fold Term.add_vars o snd) assumes []) then
wenzelm@33368
  1261
        Rule_Cases.Case {fixes = fixes', assumes = assumes, binds = binds', cases = cases}
wenzelm@18678
  1262
    else error ("Illegal schematic variable(s) in case " ^ quote name)
wenzelm@18609
  1263
  end;
wenzelm@18609
  1264
wenzelm@18672
  1265
fun fix (x, T) ctxt =
wenzelm@18672
  1266
  let
wenzelm@18672
  1267
    val (bind, ctxt') = bind_fixes [x] ctxt;
wenzelm@18672
  1268
    val t = bind (Free (x, T));
wenzelm@20163
  1269
  in (t, ctxt' |> Variable.declare_constraints t) end;
wenzelm@18672
  1270
wenzelm@16147
  1271
in
wenzelm@16147
  1272
wenzelm@18672
  1273
fun add_cases is_proper = map_cases o fold (add_case is_proper);
wenzelm@18609
  1274
wenzelm@18609
  1275
fun case_result c ctxt =
wenzelm@18609
  1276
  let
wenzelm@33368
  1277
    val Rule_Cases.Case {fixes, ...} = c;
wenzelm@18672
  1278
    val (ts, ctxt') = ctxt |> fold_map fix fixes;
wenzelm@33368
  1279
    val Rule_Cases.Case {assumes, binds, cases, ...} = Rule_Cases.apply ts c;
wenzelm@18609
  1280
  in
wenzelm@18609
  1281
    ctxt'
wenzelm@30757
  1282
    |> bind_terms (map drop_schematic binds)
wenzelm@18609
  1283
    |> add_cases true (map (apsnd SOME) cases)
wenzelm@18609
  1284
    |> pair (assumes, (binds, cases))
wenzelm@18609
  1285
  end;
wenzelm@18609
  1286
wenzelm@18609
  1287
val apply_case = apfst fst oo case_result;
wenzelm@18609
  1288
wenzelm@16540
  1289
fun get_case ctxt name xs =
wenzelm@17184
  1290
  (case AList.lookup (op =) (cases_of ctxt) name of
wenzelm@18678
  1291
    NONE => error ("Unknown case: " ^ quote name)
wenzelm@18678
  1292
  | SOME (c, _) => prep_case name xs c);
wenzelm@8373
  1293
wenzelm@16147
  1294
end;
wenzelm@8373
  1295
wenzelm@8373
  1296
wenzelm@8373
  1297
wenzelm@10810
  1298
(** print context information **)
wenzelm@10810
  1299
wenzelm@12072
  1300
(* local syntax *)
wenzelm@12072
  1301
wenzelm@12093
  1302
val print_syntax = Syntax.print_syntax o syn_of;
wenzelm@12072
  1303
wenzelm@12072
  1304
wenzelm@21728
  1305
(* abbreviations *)
wenzelm@18971
  1306
wenzelm@21728
  1307
fun pretty_abbrevs show_globals ctxt =
wenzelm@18971
  1308
  let
wenzelm@25052
  1309
    val ((space, consts), (_, globals)) =
wenzelm@19033
  1310
      pairself (#constants o Consts.dest) (#consts (rep_context ctxt));
wenzelm@21803
  1311
    fun add_abbr (_, (_, NONE)) = I
wenzelm@25406
  1312
      | add_abbr (c, (T, SOME t)) =
wenzelm@21728
  1313
          if not show_globals andalso Symtab.defined globals c then I
wenzelm@21728
  1314
          else cons (c, Logic.mk_equals (Const (c, T), t));
wenzelm@33095
  1315
    val abbrevs = Name_Space.extern_table (space, Symtab.make (Symtab.fold add_abbr consts []));
wenzelm@18971
  1316
  in
wenzelm@35141
  1317
    if null abbrevs then []
wenzelm@21728
  1318
    else [Pretty.big_list "abbreviations:" (map (pretty_term_abbrev ctxt o #2) abbrevs)]
wenzelm@18971
  1319
  end;
wenzelm@18971
  1320
wenzelm@21728
  1321
val print_abbrevs = Pretty.writeln o Pretty.chunks o pretty_abbrevs true;
wenzelm@21728
  1322
wenzelm@18971
  1323
wenzelm@10810
  1324
(* term bindings *)
wenzelm@10810
  1325
wenzelm@16540
  1326
fun pretty_binds ctxt =
wenzelm@10810
  1327
  let
wenzelm@19897
  1328
    val binds = Variable.binds_of ctxt;
wenzelm@21728
  1329
    fun prt_bind (xi, (T, t)) = pretty_term_abbrev ctxt (Logic.mk_equals (Var (xi, T), t));
wenzelm@10810
  1330
  in
wenzelm@35141
  1331
    if Vartab.is_empty binds then []
wenzelm@15758
  1332
    else [Pretty.big_list "term bindings:" (map prt_bind (Vartab.dest binds))]
wenzelm@10810
  1333
  end;
wenzelm@10810
  1334
wenzelm@10810
  1335
val print_binds = Pretty.writeln o Pretty.chunks o pretty_binds;
wenzelm@10810
  1336
wenzelm@10810
  1337
wenzelm@10810
  1338
(* local theorems *)
wenzelm@10810
  1339
wenzelm@16540
  1340
fun pretty_lthms ctxt =
wenzelm@20012
  1341
  let
wenzelm@26284
  1342
    val local_facts = facts_of ctxt;
wenzelm@26284
  1343
    val props = Facts.props local_facts;
wenzelm@26673
  1344
    val facts =
wenzelm@35141
  1345
      (if null props then [] else [("<unnamed>", props)]) @
wenzelm@28212
  1346
      Facts.dest_static [] local_facts;
wenzelm@20012
  1347
  in
wenzelm@35141
  1348
    if null facts then []
wenzelm@28212
  1349
    else [Pretty.big_list "facts:" (map #1 (sort_wrt (#1 o #2) (map (`(pretty_fact ctxt)) facts)))]
wenzelm@20012
  1350
  end;
wenzelm@10810
  1351
wenzelm@12057
  1352
val print_lthms = Pretty.writeln o Pretty.chunks o pretty_lthms;
wenzelm@10810
  1353
wenzelm@10810
  1354
wenzelm@10810
  1355
(* local contexts *)
wenzelm@10810
  1356
wenzelm@26722
  1357
local
wenzelm@26722
  1358
wenzelm@26722
  1359
fun pretty_case (name, (fixes, ((asms, (lets, cs)), ctxt))) =
wenzelm@10810
  1360
  let
wenzelm@24922
  1361
    val prt_term = Syntax.pretty_term ctxt;
wenzelm@12057
  1362
wenzelm@10810
  1363
    fun prt_let (xi, t) = Pretty.block
wenzelm@10818
  1364
      [Pretty.quote (prt_term (Var (xi, Term.fastype_of t))), Pretty.str " =", Pretty.brk 1,
wenzelm@10810
  1365
        Pretty.quote (prt_term t)];
wenzelm@10810
  1366
wenzelm@13425
  1367
    fun prt_asm (a, ts) = Pretty.block (Pretty.breaks
wenzelm@13425
  1368
      ((if a = "" then [] else [Pretty.str (a ^ ":")]) @ map (Pretty.quote o prt_term) ts));
wenzelm@13425
  1369
wenzelm@10810
  1370
    fun prt_sect _ _ _ [] = []
wenzelm@35141
  1371
      | prt_sect s sep prt xs =
wenzelm@35141
  1372
          [Pretty.block (Pretty.breaks (Pretty.str s ::
wenzelm@35141
  1373
            flat (separate sep (map (single o prt) xs))))];
wenzelm@26722
  1374
  in
wenzelm@26722
  1375
    Pretty.block (Pretty.fbreaks
wenzelm@10810
  1376
      (Pretty.str (name ^ ":") ::
wenzelm@11915
  1377
        prt_sect "fix" [] (Pretty.str o fst) fixes @
wenzelm@10810
  1378
        prt_sect "let" [Pretty.str "and"] prt_let
wenzelm@19482
  1379
          (map_filter (fn (xi, SOME t) => SOME (xi, t) | _ => NONE) lets) @
wenzelm@13425
  1380
        (if forall (null o #2) asms then []
wenzelm@18609
  1381
          else prt_sect "assume" [Pretty.str "and"] prt_asm asms) @
wenzelm@26722
  1382
        prt_sect "subcases:" [] (Pretty.str o fst) cs))
wenzelm@26722
  1383
  end;
wenzelm@16540
  1384
wenzelm@26722
  1385
in
wenzelm@26722
  1386
wenzelm@26722
  1387
fun pretty_cases ctxt =
wenzelm@26722
  1388
  let
wenzelm@18476
  1389
    fun add_case (_, (_, false)) = I
wenzelm@33368
  1390
      | add_case (name, (c as Rule_Cases.Case {fixes, ...}, true)) =
wenzelm@26722
  1391
          cons (name, (fixes, case_result c ctxt));
wenzelm@18476
  1392
    val cases = fold add_case (cases_of ctxt) [];
wenzelm@10810
  1393
  in
wenzelm@35141
  1394
    if null cases then []
wenzelm@26722
  1395
    else [Pretty.big_list "cases:" (map pretty_case cases)]
wenzelm@10810
  1396
  end;
wenzelm@10810
  1397
wenzelm@10810
  1398
val print_cases = Pretty.writeln o Pretty.chunks o pretty_cases;
wenzelm@10810
  1399
wenzelm@26722
  1400
end;
wenzelm@26722
  1401
wenzelm@10810
  1402
wenzelm@12057
  1403
(* core context *)
wenzelm@10810
  1404
wenzelm@35141
  1405
val debug = Unsynchronized.ref false;
wenzelm@35141
  1406
val verbose = Unsynchronized.ref false;
wenzelm@10810
  1407
wenzelm@18672
  1408
fun pretty_ctxt ctxt =
wenzelm@39165
  1409
  if not (! debug) then []
wenzelm@20310
  1410
  else
wenzelm@20310
  1411
    let
wenzelm@24922
  1412
      val prt_term = Syntax.pretty_term ctxt;
wenzelm@12057
  1413
wenzelm@20310
  1414
      (*structures*)
wenzelm@35429
  1415
      val {structs, ...} = Local_Syntax.idents_of (syntax_of ctxt);
wenzelm@35139
  1416
      val prt_structs =
wenzelm@35139
  1417
        if null structs then []
wenzelm@20310
  1418
        else [Pretty.block (Pretty.str "structures:" :: Pretty.brk 1 ::
wenzelm@20310
  1419
          Pretty.commas (map Pretty.str structs))];
wenzelm@12093
  1420
wenzelm@20310
  1421
      (*fixes*)
wenzelm@20310
  1422
      fun prt_fix (x, x') =
wenzelm@20310
  1423
        if x = x' then Pretty.str x
wenzelm@20310
  1424
        else Pretty.block [Pretty.str x, Pretty.str " =", Pretty.brk 1, prt_term (Syntax.free x')];
wenzelm@20310
  1425
      val fixes =
wenzelm@20310
  1426
        rev (filter_out ((can Name.dest_internal orf member (op =) structs) o #1)
wenzelm@20310
  1427
          (Variable.fixes_of ctxt));
wenzelm@35139
  1428
      val prt_fixes =
wenzelm@35139
  1429
        if null fixes then []
wenzelm@20310
  1430
        else [Pretty.block (Pretty.str "fixed variables:" :: Pretty.brk 1 ::
wenzelm@20310
  1431
          Pretty.commas (map prt_fix fixes))];
wenzelm@12057
  1432
wenzelm@20310
  1433
      (*prems*)
wenzelm@30473
  1434
      val prems = Assumption.all_prems_of ctxt;
wenzelm@35139
  1435
      val prt_prems =
wenzelm@35139
  1436
        if null prems then []
wenzelm@39165
  1437
        else [Pretty.big_list "prems:" (map (Display.pretty_thm ctxt) prems)];
wenzelm@20310
  1438
    in prt_structs @ prt_fixes @ prt_prems end;
wenzelm@10810
  1439
wenzelm@10810
  1440
wenzelm@10810
  1441
(* main context *)
wenzelm@10810
  1442
wenzelm@16540
  1443
fun pretty_context ctxt =
wenzelm@10810
  1444
  let
wenzelm@35141
  1445
    val is_verbose = ! verbose;
wenzelm@35141
  1446
    fun verb f x = if is_verbose then f (x ()) else [];
wenzelm@35141
  1447
wenzelm@24922
  1448
    val prt_term = Syntax.pretty_term ctxt;
wenzelm@24922
  1449
    val prt_typ = Syntax.pretty_typ ctxt;
wenzelm@24922
  1450
    val prt_sort = Syntax.pretty_sort ctxt;
wenzelm@10810
  1451
wenzelm@10810
  1452
    (*theory*)
wenzelm@12057
  1453
    val pretty_thy = Pretty.block
wenzelm@17384
  1454
      [Pretty.str "theory:", Pretty.brk 1, Context.pretty_thy (theory_of ctxt)];
wenzelm@10810
  1455
wenzelm@10810
  1456
    (*defaults*)
wenzelm@10810
  1457
    fun prt_atom prt prtT (x, X) = Pretty.block
wenzelm@10810
  1458
      [prt x, Pretty.str " ::", Pretty.brk 1, prtT X];
wenzelm@10810
  1459
wenzelm@10810
  1460
    fun prt_var (x, ~1) = prt_term (Syntax.free x)
wenzelm@10810
  1461
      | prt_var xi = prt_term (Syntax.var xi);
wenzelm@10810
  1462
wenzelm@10810
  1463
    fun prt_varT (x, ~1) = prt_typ (TFree (x, []))
wenzelm@10810
  1464
      | prt_varT xi = prt_typ (TVar (xi, []));
wenzelm@10810
  1465
wenzelm@10810
  1466
    val prt_defT = prt_atom prt_var prt_typ;
wenzelm@10810
  1467
    val prt_defS = prt_atom prt_varT prt_sort;
wenzelm@16540
  1468
wenzelm@20163
  1469
    val (types, sorts) = Variable.constraints_of ctxt;
wenzelm@10810
  1470
  in
wenzelm@18609
  1471
    verb single (K pretty_thy) @
wenzelm@18672
  1472
    pretty_ctxt ctxt @
wenzelm@21728
  1473
    verb (pretty_abbrevs false) (K ctxt) @
wenzelm@10810
  1474
    verb pretty_binds (K ctxt) @
wenzelm@12057
  1475
    verb pretty_lthms (K ctxt) @
wenzelm@10810
  1476
    verb pretty_cases (K ctxt) @
wenzelm@18609
  1477
    verb single (fn () => Pretty.big_list "type constraints:" (map prt_defT (Vartab.dest types))) @
wenzelm@20163
  1478
    verb single (fn () => Pretty.big_list "default sorts:" (map prt_defS (Vartab.dest sorts)))
wenzelm@10810
  1479
  end;
wenzelm@10810
  1480
wenzelm@5819
  1481
end;
wenzelm@35429
  1482