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