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