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