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