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