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