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