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