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