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