src/Pure/Isar/proof_context.ML
author wenzelm
Thu Dec 07 00:42:04 2006 +0100 (2006-12-07 ago)
changeset 21687 f689f729afab
parent 21681 8b8edcdb4da8
child 21696 f3c78a133fbb
permissions -rw-r--r--
reorganized structure Goal vs. Tactic;
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@21667
    14
  val is_stmt: Proof.context -> bool
wenzelm@21667
    15
  val set_stmt: bool -> Proof.context -> Proof.context
wenzelm@21667
    16
  val restore_stmt: Proof.context -> Proof.context -> Proof.context
wenzelm@21667
    17
  val naming_of: Proof.context -> NameSpace.naming
wenzelm@20310
    18
  val full_name: Proof.context -> bstring -> string
wenzelm@20310
    19
  val consts_of: Proof.context -> Consts.T
wenzelm@21183
    20
  val const_syntax_name: Proof.context -> string -> string
wenzelm@20784
    21
  val set_syntax_mode: Syntax.mode -> Proof.context -> Proof.context
wenzelm@20310
    22
  val restore_syntax_mode: Proof.context -> Proof.context -> Proof.context
wenzelm@20310
    23
  val fact_index_of: Proof.context -> FactIndex.T
wenzelm@20310
    24
  val transfer: theory -> Proof.context -> Proof.context
wenzelm@20367
    25
  val theory: (theory -> theory) -> Proof.context -> Proof.context
wenzelm@20367
    26
  val theory_result: (theory -> 'a * theory) -> Proof.context -> 'a * Proof.context
wenzelm@20310
    27
  val pretty_term: Proof.context -> term -> Pretty.T
wenzelm@20310
    28
  val pretty_typ: Proof.context -> typ -> Pretty.T
wenzelm@20310
    29
  val pretty_sort: Proof.context -> sort -> Pretty.T
wenzelm@20310
    30
  val pretty_classrel: Proof.context -> class list -> Pretty.T
wenzelm@20310
    31
  val pretty_arity: Proof.context -> arity -> Pretty.T
wenzelm@20310
    32
  val pp: Proof.context -> Pretty.pp
wenzelm@20253
    33
  val pretty_thm_legacy: bool -> thm -> Pretty.T
wenzelm@20310
    34
  val pretty_thm: Proof.context -> thm -> Pretty.T
wenzelm@20310
    35
  val pretty_thms: Proof.context -> thm list -> Pretty.T
wenzelm@20310
    36
  val pretty_fact: Proof.context -> string * thm list -> Pretty.T
wenzelm@20310
    37
  val pretty_proof: Proof.context -> Proofterm.proof -> Pretty.T
wenzelm@20310
    38
  val pretty_proof_of: Proof.context -> bool -> thm -> Pretty.T
wenzelm@20310
    39
  val string_of_typ: Proof.context -> typ -> string
wenzelm@20310
    40
  val string_of_term: Proof.context -> term -> string
wenzelm@20310
    41
  val string_of_thm: Proof.context -> thm -> string
wenzelm@20310
    42
  val read_typ: Proof.context -> string -> typ
wenzelm@20310
    43
  val read_typ_syntax: Proof.context -> string -> typ
wenzelm@20310
    44
  val read_typ_abbrev: Proof.context -> string -> typ
wenzelm@20310
    45
  val cert_typ: Proof.context -> typ -> typ
wenzelm@20310
    46
  val cert_typ_syntax: Proof.context -> typ -> typ
wenzelm@20310
    47
  val cert_typ_abbrev: Proof.context -> typ -> typ
wenzelm@20310
    48
  val get_skolem: Proof.context -> string -> string
wenzelm@20310
    49
  val revert_skolem: Proof.context -> string -> string
wenzelm@20310
    50
  val revert_skolems: Proof.context -> term -> term
wenzelm@20310
    51
  val read_termTs: Proof.context -> (string -> bool) -> (indexname -> typ option)
wenzelm@14720
    52
    -> (indexname -> sort option) -> string list -> (string * typ) list
wenzelm@14720
    53
    -> term list * (indexname * typ) list
wenzelm@20310
    54
  val read_termTs_schematic: Proof.context -> (string -> bool) -> (indexname -> typ option)
wenzelm@14720
    55
    -> (indexname -> sort option) -> string list -> (string * typ) list
wenzelm@14720
    56
    -> term list * (indexname * typ) list
wenzelm@20310
    57
  val read_term_legacy: Proof.context -> string -> term
wenzelm@20310
    58
  val read_term: Proof.context -> string -> term
wenzelm@20310
    59
  val read_prop: Proof.context -> string -> term
wenzelm@20310
    60
  val read_prop_schematic: Proof.context -> string -> term
wenzelm@20310
    61
  val read_term_pats: typ -> Proof.context -> string list -> term list
wenzelm@20310
    62
  val read_prop_pats: Proof.context -> string list -> term list
wenzelm@20310
    63
  val cert_term: Proof.context -> term -> term
wenzelm@20310
    64
  val cert_prop: Proof.context -> term -> term
wenzelm@20310
    65
  val cert_term_pats: typ -> Proof.context -> term list -> term list
wenzelm@20310
    66
  val cert_prop_pats: Proof.context -> term list -> term list
wenzelm@20310
    67
  val infer_type: Proof.context -> string -> typ
wenzelm@20310
    68
  val inferred_param: string -> Proof.context -> (string * typ) * Proof.context
wenzelm@20310
    69
  val inferred_fixes: Proof.context -> (string * typ) list * Proof.context
wenzelm@20310
    70
  val read_tyname: Proof.context -> string -> typ
wenzelm@20310
    71
  val read_const: Proof.context -> string -> term
wenzelm@20310
    72
  val goal_export: Proof.context -> Proof.context -> thm list -> thm list
wenzelm@20310
    73
  val export: Proof.context -> Proof.context -> thm list -> thm list
wenzelm@21531
    74
  val export_morphism: Proof.context -> Proof.context -> morphism
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@21208
   142
  val add_notation: Syntax.mode -> (term * mixfix) list ->
wenzelm@21208
   143
    Proof.context -> Proof.context
wenzelm@21681
   144
  val expand_abbrevs: bool -> 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@21569
   283
      |> 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@21583
   318
      else (pp ctxt, map Thm.term_of (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@21610
   574
(** export results **)
wenzelm@21531
   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@21531
   583
fun export_morphism inner outer =
wenzelm@21531
   584
  Assumption.export_morphism inner outer $>
wenzelm@21531
   585
  Variable.export_morphism inner outer;
wenzelm@21531
   586
wenzelm@21531
   587
wenzelm@15758
   588
wenzelm@5819
   589
(** bindings **)
wenzelm@5819
   590
wenzelm@8096
   591
(* simult_matches *)
wenzelm@8096
   592
wenzelm@19867
   593
fun simult_matches ctxt (t, pats) =
wenzelm@19867
   594
  (case Seq.pull (Unify.matchers (theory_of ctxt) (map (rpair t) pats)) of
wenzelm@19867
   595
    NONE => error "Pattern match failed!"
wenzelm@19867
   596
  | SOME (env, _) => map (apsnd snd) (Envir.alist_of env));
wenzelm@8096
   597
wenzelm@8096
   598
wenzelm@8096
   599
(* add_binds(_i) *)
wenzelm@5819
   600
wenzelm@7925
   601
local
wenzelm@7925
   602
wenzelm@16031
   603
fun gen_bind prep (xi as (x, _), raw_t) ctxt =
wenzelm@19897
   604
  ctxt |> Variable.add_binds [(xi, Option.map (prep ctxt) raw_t)];
wenzelm@5819
   605
wenzelm@10810
   606
in
wenzelm@10810
   607
wenzelm@20330
   608
fun drop_schematic (b as (xi, SOME t)) = if Term.exists_subterm is_Var t then (xi, NONE) else b
wenzelm@10554
   609
  | drop_schematic b = b;
wenzelm@10554
   610
wenzelm@16031
   611
val add_binds = fold (gen_bind read_term);
wenzelm@16031
   612
val add_binds_i = fold (gen_bind cert_term);
wenzelm@8616
   613
wenzelm@16458
   614
fun auto_bind f ts ctxt = ctxt |> add_binds_i (map drop_schematic (f (theory_of ctxt) ts));
wenzelm@12147
   615
val auto_bind_goal = auto_bind AutoBind.goal;
wenzelm@12147
   616
val auto_bind_facts = auto_bind AutoBind.facts;
wenzelm@7925
   617
wenzelm@7925
   618
end;
wenzelm@5819
   619
wenzelm@5819
   620
wenzelm@8096
   621
(* match_bind(_i) *)
wenzelm@5819
   622
wenzelm@8096
   623
local
wenzelm@8096
   624
wenzelm@17860
   625
fun prep_bind prep_pats (raw_pats, t) ctxt =
wenzelm@5819
   626
  let
wenzelm@19897
   627
    val ctxt' = Variable.declare_term t ctxt;
wenzelm@19585
   628
    val pats = prep_pats (Term.fastype_of t) ctxt' raw_pats;
wenzelm@19585
   629
    val binds = simult_matches ctxt' (t, pats);
wenzelm@17860
   630
  in (binds, ctxt') end;
wenzelm@7670
   631
wenzelm@10465
   632
fun gen_binds prep_terms prep_pats gen raw_binds ctxt =
wenzelm@8616
   633
  let
wenzelm@10465
   634
    val ts = prep_terms ctxt (map snd raw_binds);
wenzelm@17860
   635
    val (binds, ctxt') =
wenzelm@19482
   636
      apfst flat (fold_map (prep_bind prep_pats) (map fst raw_binds ~~ ts) ctxt);
wenzelm@8616
   637
    val binds' =
wenzelm@19916
   638
      if gen then map #1 binds ~~ Variable.exportT_terms ctxt' ctxt (map #2 binds)
wenzelm@8616
   639
      else binds;
skalberg@15531
   640
    val binds'' = map (apsnd SOME) binds';
wenzelm@18310
   641
    val ctxt'' =
wenzelm@19897
   642
      tap (Variable.warn_extra_tfrees ctxt)
wenzelm@18310
   643
       (if gen then
wenzelm@19897
   644
          ctxt (*sic!*) |> fold Variable.declare_term (map #2 binds') |> add_binds_i binds''
wenzelm@18310
   645
        else ctxt' |> add_binds_i binds'');
wenzelm@18310
   646
  in (ts, ctxt'') end;
wenzelm@8096
   647
wenzelm@8096
   648
in
wenzelm@5935
   649
wenzelm@10465
   650
val match_bind = gen_binds read_terms read_term_pats;
wenzelm@10465
   651
val match_bind_i = gen_binds (map o cert_term) cert_term_pats;
wenzelm@8096
   652
wenzelm@8096
   653
end;
wenzelm@5935
   654
wenzelm@5935
   655
wenzelm@10465
   656
(* propositions with patterns *)
wenzelm@5935
   657
wenzelm@10465
   658
local
wenzelm@8096
   659
wenzelm@10554
   660
fun prep_propp schematic prep_props prep_pats (context, args) =
wenzelm@10465
   661
  let
wenzelm@19585
   662
    fun prep (_, raw_pats) (ctxt, prop :: props) =
wenzelm@19897
   663
          let val ctxt' = Variable.declare_term prop ctxt
wenzelm@19585
   664
          in ((prop, prep_pats ctxt' raw_pats), (ctxt', props)) end
wenzelm@17860
   665
      | prep _ _ = sys_error "prep_propp";
wenzelm@17860
   666
    val (propp, (context', _)) = (fold_map o fold_map) prep args
wenzelm@19482
   667
      (context, prep_props schematic context (maps (map fst) args));
wenzelm@10465
   668
  in (context', propp) end;
wenzelm@5935
   669
wenzelm@10465
   670
fun gen_bind_propp prepp (ctxt, raw_args) =
wenzelm@8096
   671
  let
wenzelm@10465
   672
    val (ctxt', args) = prepp (ctxt, raw_args);
wenzelm@19585
   673
    val binds = flat (flat (map (map (simult_matches ctxt')) args));
wenzelm@10465
   674
    val propss = map (map #1) args;
wenzelm@8616
   675
wenzelm@10554
   676
    (*generalize result: context evaluated now, binds added later*)
wenzelm@19916
   677
    val gen = Variable.exportT_terms ctxt' ctxt;
skalberg@15531
   678
    fun gen_binds c = c |> add_binds_i (map #1 binds ~~ map SOME (gen (map #2 binds)));
skalberg@15531
   679
  in (ctxt' |> add_binds_i (map (apsnd SOME) binds), (propss, gen_binds)) end;
wenzelm@8096
   680
wenzelm@10465
   681
in
wenzelm@10465
   682
wenzelm@11925
   683
val read_propp = prep_propp false read_props read_prop_pats;
wenzelm@11925
   684
val cert_propp = prep_propp false cert_props cert_prop_pats;
wenzelm@10554
   685
val read_propp_schematic = prep_propp true read_props read_prop_pats;
wenzelm@10554
   686
val cert_propp_schematic = prep_propp true cert_props cert_prop_pats;
wenzelm@10554
   687
wenzelm@11925
   688
val bind_propp = gen_bind_propp read_propp;
wenzelm@11925
   689
val bind_propp_i = gen_bind_propp cert_propp;
wenzelm@11925
   690
val bind_propp_schematic = gen_bind_propp read_propp_schematic;
wenzelm@10554
   691
val bind_propp_schematic_i = gen_bind_propp cert_propp_schematic;
wenzelm@6789
   692
wenzelm@10465
   693
end;
wenzelm@10465
   694
wenzelm@6789
   695
wenzelm@5819
   696
wenzelm@5819
   697
(** theorems **)
wenzelm@5819
   698
wenzelm@18042
   699
(* fact_tac *)
wenzelm@18042
   700
wenzelm@18122
   701
fun comp_incr_tac [] _ st = no_tac st
wenzelm@18122
   702
  | comp_incr_tac (th :: ths) i st =
wenzelm@18122
   703
      (Goal.compose_hhf_tac (Drule.incr_indexes st th) i APPEND comp_incr_tac ths i) st;
wenzelm@18042
   704
wenzelm@21687
   705
fun fact_tac facts = Goal.norm_hhf_tac THEN' comp_incr_tac facts;
wenzelm@18122
   706
wenzelm@18122
   707
fun some_fact_tac ctxt = SUBGOAL (fn (goal, i) =>
wenzelm@18042
   708
  let
wenzelm@19001
   709
    val index = fact_index_of ctxt;
wenzelm@18042
   710
    val facts = FactIndex.could_unify index (Term.strip_all_body goal);
wenzelm@18042
   711
  in fact_tac facts i end);
wenzelm@18042
   712
wenzelm@18042
   713
wenzelm@6091
   714
(* get_thm(s) *)
wenzelm@5819
   715
wenzelm@18042
   716
fun retrieve_thms _ pick ctxt (Fact s) =
wenzelm@16501
   717
      let
wenzelm@20049
   718
        val th = Goal.prove ctxt [] [] (read_prop ctxt s) (K (ALLGOALS (some_fact_tac ctxt)))
wenzelm@18678
   719
          handle ERROR msg => cat_error msg "Failed to retrieve literal fact.";
wenzelm@18042
   720
      in pick "" [th] end
wenzelm@18042
   721
  | retrieve_thms from_thy pick ctxt xthmref =
wenzelm@18042
   722
      let
wenzelm@18042
   723
        val thy = theory_of ctxt;
wenzelm@19001
   724
        val (space, tab) = #1 (thms_of ctxt);
wenzelm@16501
   725
        val thmref = PureThy.map_name_of_thmref (NameSpace.intern space) xthmref;
wenzelm@16501
   726
        val name = PureThy.name_of_thmref thmref;
wenzelm@16501
   727
      in
wenzelm@17412
   728
        (case Symtab.lookup tab name of
wenzelm@16540
   729
          SOME ths => map (Thm.transfer thy) (PureThy.select_thm thmref ths)
wenzelm@16540
   730
        | NONE => from_thy thy xthmref) |> pick name
wenzelm@18042
   731
      end;
wenzelm@5819
   732
wenzelm@9566
   733
val get_thm = retrieve_thms PureThy.get_thms PureThy.single_thm;
wenzelm@9566
   734
val get_thm_closure = retrieve_thms PureThy.get_thms_closure PureThy.single_thm;
wenzelm@9566
   735
val get_thms = retrieve_thms PureThy.get_thms (K I);
wenzelm@9566
   736
val get_thms_closure = retrieve_thms PureThy.get_thms_closure (K I);
wenzelm@5819
   737
wenzelm@5819
   738
wenzelm@16031
   739
(* valid_thms *)
wenzelm@16031
   740
wenzelm@16031
   741
fun valid_thms ctxt (name, ths) =
wenzelm@18678
   742
  (case try (fn () => get_thms ctxt (Name name)) () of
wenzelm@16031
   743
    NONE => false
wenzelm@16147
   744
  | SOME ths' => Thm.eq_thms (ths, ths'));
wenzelm@16031
   745
wenzelm@16031
   746
wenzelm@16031
   747
(* lthms_containing *)
wenzelm@16031
   748
wenzelm@16031
   749
fun lthms_containing ctxt spec =
wenzelm@16031
   750
  FactIndex.find (fact_index_of ctxt) spec
wenzelm@21569
   751
  |> map (fn (name, ths) =>
wenzelm@21569
   752
    if valid_thms ctxt (name, ths) then (name, ths)
wenzelm@21569
   753
    else (NameSpace.hidden (if name = "" then "unnamed" else name), ths));
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@21648
   770
  | update_thms opts ("", SOME ths) ctxt = ctxt |> map_thms (fn (facts, index) =>
wenzelm@18672
   771
      let
wenzelm@21648
   772
        val index' = uncurry FactIndex.add_local opts ("", 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@21648
   779
  | update_thms opts (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@21648
   784
        val index' = uncurry FactIndex.add_local opts (name, ths) index;
wenzelm@19001
   785
      in ((space', tab'), index') end);
wenzelm@5819
   786
wenzelm@21443
   787
fun put_thms thms ctxt =
wenzelm@21648
   788
  ctxt |> map_naming (K local_naming) |> update_thms (true, 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@21643
   797
    val name = full_name ctxt bname;
wenzelm@21643
   798
    val facts = PureThy.name_thmss false name (map (apfst (get ctxt)) raw_facts);
wenzelm@21443
   799
    fun app (th, attrs) x =
wenzelm@21643
   800
      swap (foldl_map (Thm.proof_attributes (attrs @ more_attrs @ [PureThy.kind k])) (x, th));
wenzelm@21443
   801
    val (res, ctxt') = fold_map app facts ctxt;
wenzelm@21643
   802
    val thms = PureThy.name_thms false false name (flat res);
wenzelm@21648
   803
  in ((bname, thms), ctxt' |> update_thms (is_stmt ctxt, true) (bname, SOME thms)) end);
wenzelm@12711
   804
wenzelm@12711
   805
in
wenzelm@12711
   806
haftmann@21622
   807
fun note_thmss k = gen_note_thmss get_thms k;
haftmann@21622
   808
fun note_thmss_i k = gen_note_thmss (K I) k;
ballarin@15696
   809
wenzelm@12711
   810
end;
wenzelm@9196
   811
wenzelm@5819
   812
wenzelm@5819
   813
wenzelm@18672
   814
(** parameters **)
wenzelm@17360
   815
wenzelm@8096
   816
(* variables *)
wenzelm@8096
   817
wenzelm@19897
   818
fun declare_var (x, opt_T, mx) ctxt =
wenzelm@19897
   819
  let val T = (case opt_T of SOME T => T | NONE => TypeInfer.mixfixT mx)
wenzelm@20163
   820
  in ((x, T, mx), ctxt |> Variable.declare_constraints (Free (x, T))) end;
wenzelm@19897
   821
wenzelm@10381
   822
local
wenzelm@10381
   823
wenzelm@18672
   824
fun prep_vars prep_typ internal legacy =
wenzelm@18672
   825
  fold_map (fn (raw_x, raw_T, raw_mx) => fn ctxt =>
wenzelm@18672
   826
    let
wenzelm@19371
   827
      val (x, mx) = Syntax.const_mixfix raw_x raw_mx;
wenzelm@18672
   828
      val _ =
wenzelm@18678
   829
        if not legacy andalso not (Syntax.is_identifier (no_skolem internal x)) then
wenzelm@18678
   830
          error ("Illegal variable name: " ^ quote x)
wenzelm@18672
   831
        else ();
wenzelm@12504
   832
wenzelm@18672
   833
      fun cond_tvars T =
wenzelm@18672
   834
        if internal then T
wenzelm@18678
   835
        else Type.no_tvars T handle TYPE (msg, _, _) => error msg;
wenzelm@18672
   836
      val opt_T = Option.map (cond_tvars o prep_typ ctxt) raw_T;
wenzelm@18672
   837
      val var = (x, opt_T, mx);
wenzelm@19001
   838
    in (var, ctxt |> declare_var var |> #2) end);
wenzelm@8096
   839
wenzelm@10381
   840
in
wenzelm@10381
   841
wenzelm@18672
   842
val read_vars        = prep_vars read_typ false false;
wenzelm@18672
   843
val cert_vars        = prep_vars cert_typ true false;
wenzelm@18672
   844
val read_vars_legacy = prep_vars read_typ true true;
wenzelm@18672
   845
val cert_vars_legacy = prep_vars cert_typ true true;
wenzelm@8096
   846
wenzelm@10381
   847
end;
wenzelm@10381
   848
wenzelm@8096
   849
wenzelm@19681
   850
(* authentic constants *)
wenzelm@19663
   851
wenzelm@21208
   852
fun const_syntax ctxt (Free (x, T), mx) = SOME (true, (x, T, mx))
wenzelm@21667
   853
  | const_syntax ctxt (Const (c, _), mx) =
wenzelm@21667
   854
      Option.map (pair false) (try (Consts.syntax (consts_of ctxt)) (c, mx))
wenzelm@21208
   855
  | const_syntax _ _ = NONE;
wenzelm@21208
   856
wenzelm@21208
   857
fun add_notation prmode args ctxt =
wenzelm@19663
   858
  ctxt |> map_syntax
wenzelm@21208
   859
    (LocalSyntax.add_modesyntax (theory_of ctxt) prmode (map_filter (const_syntax ctxt) args));
wenzelm@19663
   860
wenzelm@19681
   861
fun context_const_ast_tr context [Syntax.Variable c] =
wenzelm@19681
   862
      let
wenzelm@19681
   863
        val consts = Context.cases Sign.consts_of consts_of context;
wenzelm@19681
   864
        val c' = Consts.intern consts c;
wenzelm@19681
   865
        val _ = Consts.constraint consts c' handle TYPE (msg, _, _) => error msg;
wenzelm@19681
   866
      in Syntax.Constant (Syntax.constN ^ c') end
wenzelm@19681
   867
  | context_const_ast_tr _ asts = raise Syntax.AST ("const_ast_tr", asts);
wenzelm@19681
   868
wenzelm@19681
   869
val _ = Context.add_setup
wenzelm@19681
   870
 (Sign.add_syntax
wenzelm@19681
   871
   [("_context_const", "id => 'a", Delimfix "CONST _"),
wenzelm@19681
   872
    ("_context_const", "longid => 'a", Delimfix "CONST _")] #>
wenzelm@19681
   873
  Sign.add_advanced_trfuns ([("_context_const", context_const_ast_tr)], [], [], []));
wenzelm@19681
   874
wenzelm@19663
   875
wenzelm@19001
   876
(* abbreviations *)
wenzelm@19001
   877
wenzelm@19371
   878
val expand_abbrevs = map_consts o apsnd o Consts.expand_abbrevs;
wenzelm@19371
   879
wenzelm@21269
   880
fun add_abbrevs prmode = fold_map (fn ((raw_c, raw_mx), raw_t) => fn ctxt =>
wenzelm@19001
   881
  let
wenzelm@21667
   882
    val (c, mx) = Syntax.const_mixfix raw_c raw_mx;
wenzelm@21681
   883
    val t0 = cert_term (ctxt |> expand_abbrevs false) raw_t
wenzelm@21681
   884
      handle ERROR msg => cat_error msg ("in constant abbreviation " ^ quote c);
wenzelm@20008
   885
    val [t] = Variable.exportT_terms (Variable.declare_term t0 ctxt) ctxt [t0];
wenzelm@21681
   886
    val (((full_c, T), rhs), consts') = consts_of ctxt
wenzelm@21681
   887
      |> Consts.abbreviate (pp ctxt) (tsig_of ctxt) (naming_of ctxt) (#1 prmode) ((c, t), true);
wenzelm@19001
   888
  in
wenzelm@19001
   889
    ctxt
wenzelm@19897
   890
    |> Variable.declare_term t
wenzelm@21681
   891
    |> map_consts (apsnd (K consts'))
wenzelm@21681
   892
    |> map_syntax (LocalSyntax.add_modesyntax (theory_of ctxt)
wenzelm@21681
   893
      prmode [(false, (Syntax.constN ^ full_c, T, mx))])
wenzelm@21681
   894
    |> pair (Const (full_c, T), rhs)
wenzelm@19001
   895
  end);
wenzelm@19001
   896
wenzelm@19001
   897
wenzelm@18672
   898
(* fixes *)
wenzelm@5819
   899
wenzelm@8096
   900
local
wenzelm@8096
   901
wenzelm@19001
   902
fun prep_mixfix (x, T, mx) =
wenzelm@19019
   903
  if mx <> NoSyn andalso mx <> Structure andalso
wenzelm@20086
   904
      (can Name.dest_internal x orelse can Name.dest_skolem x) then
wenzelm@19001
   905
    error ("Illegal mixfix syntax for internal/skolem constant " ^ quote x)
wenzelm@19001
   906
  else (true, (x, T, mx));
wenzelm@19001
   907
wenzelm@18844
   908
fun gen_fixes prep raw_vars ctxt =
wenzelm@8096
   909
  let
wenzelm@18672
   910
    val (vars, ctxt') = prep raw_vars ctxt;
wenzelm@19897
   911
    val (xs', ctxt'') = Variable.add_fixes (map #1 vars) ctxt';
wenzelm@8096
   912
  in
wenzelm@19897
   913
    ctxt''
wenzelm@19001
   914
    |> fold_map declare_var (map2 (fn x' => fn (_, T, mx) => (x', T, mx)) xs' vars)
wenzelm@19897
   915
    |-> (map_syntax o LocalSyntax.add_syntax (theory_of ctxt) o map prep_mixfix)
wenzelm@18672
   916
    |> pair xs'
wenzelm@8096
   917
  end;
wenzelm@5819
   918
wenzelm@8096
   919
in
wenzelm@7679
   920
wenzelm@18844
   921
val add_fixes = gen_fixes read_vars;
wenzelm@18844
   922
val add_fixes_i = gen_fixes cert_vars;
wenzelm@18844
   923
val add_fixes_legacy = gen_fixes cert_vars_legacy;
wenzelm@8096
   924
wenzelm@8096
   925
end;
wenzelm@5819
   926
wenzelm@18672
   927
wenzelm@18672
   928
(* fixes vs. frees *)
wenzelm@12016
   929
wenzelm@18672
   930
fun auto_fixes (arg as (ctxt, (propss, x))) =
wenzelm@21370
   931
  ((fold o fold) Variable.auto_fixes propss ctxt, (propss, x));
wenzelm@18672
   932
wenzelm@18672
   933
fun bind_fixes xs ctxt =
wenzelm@9291
   934
  let
wenzelm@18672
   935
    val (_, ctxt') = ctxt |> add_fixes_i (map (fn x => (x, NONE, NoSyn)) xs);
wenzelm@9291
   936
    fun bind (t as Free (x, T)) =
wenzelm@18340
   937
          if member (op =) xs x then
skalberg@15531
   938
            (case lookup_skolem ctxt' x of SOME x' => Free (x', T) | NONE => t)
wenzelm@9291
   939
          else t
wenzelm@9291
   940
      | bind (t $ u) = bind t $ bind u
wenzelm@9291
   941
      | bind (Abs (x, T, t)) = Abs (x, T, bind t)
wenzelm@9291
   942
      | bind a = a;
wenzelm@18672
   943
  in (bind, ctxt') end;
wenzelm@18672
   944
wenzelm@9291
   945
wenzelm@9291
   946
wenzelm@18672
   947
(** assumptions **)
wenzelm@18187
   948
wenzelm@20209
   949
local
wenzelm@20209
   950
wenzelm@20209
   951
fun gen_assms prepp exp args ctxt =
wenzelm@20209
   952
  let
wenzelm@20234
   953
    val cert = Thm.cterm_of (theory_of ctxt);
wenzelm@20209
   954
    val (propss, ctxt1) = swap (prepp (ctxt, map snd args));
wenzelm@20234
   955
    val _ = Variable.warn_extra_tfrees ctxt ctxt1;
wenzelm@20234
   956
    val (premss, ctxt2) = fold_burrow (Assumption.add_assms exp o map cert) propss ctxt1;
wenzelm@20234
   957
  in
wenzelm@20234
   958
    ctxt2
wenzelm@20234
   959
    |> auto_bind_facts (flat propss)
wenzelm@21443
   960
    |> put_thms (AutoBind.premsN, SOME (Assumption.prems_of ctxt2))
wenzelm@21443
   961
    |> note_thmss_i Thm.assumptionK (map fst args ~~ map (map (fn th => ([th], []))) premss)
wenzelm@20234
   962
  end;
wenzelm@20209
   963
wenzelm@20209
   964
in
wenzelm@20209
   965
wenzelm@20209
   966
val add_assms = gen_assms (apsnd #1 o bind_propp);
wenzelm@20209
   967
val add_assms_i = gen_assms (apsnd #1 o bind_propp_i);
wenzelm@20209
   968
wenzelm@20209
   969
end;
wenzelm@20209
   970
wenzelm@20209
   971
wenzelm@5819
   972
wenzelm@8373
   973
(** cases **)
wenzelm@8373
   974
wenzelm@16147
   975
local
wenzelm@16147
   976
wenzelm@16668
   977
fun rem_case name = remove (fn (x: string, (y, _)) => x = y) name;
wenzelm@16147
   978
wenzelm@18476
   979
fun add_case _ ("", _) cases = cases
wenzelm@18476
   980
  | add_case _ (name, NONE) cases = rem_case name cases
wenzelm@18476
   981
  | add_case is_proper (name, SOME c) cases = (name, (c, is_proper)) :: rem_case name cases;
wenzelm@16147
   982
wenzelm@18678
   983
fun prep_case name fxs c =
wenzelm@18609
   984
  let
wenzelm@18609
   985
    fun replace (opt_x :: xs) ((y, T) :: ys) = (the_default y opt_x, T) :: replace xs ys
wenzelm@18609
   986
      | replace [] ys = ys
wenzelm@18678
   987
      | replace (_ :: _) [] = error ("Too many parameters for case " ^ quote name);
wenzelm@18609
   988
    val RuleCases.Case {fixes, assumes, binds, cases} = c;
wenzelm@18609
   989
    val fixes' = replace fxs fixes;
wenzelm@18609
   990
    val binds' = map drop_schematic binds;
wenzelm@18609
   991
  in
wenzelm@18609
   992
    if null (fold (Term.add_tvarsT o snd) fixes []) andalso
wenzelm@18609
   993
      null (fold (fold Term.add_vars o snd) assumes []) then
wenzelm@18609
   994
        RuleCases.Case {fixes = fixes', assumes = assumes, binds = binds', cases = cases}
wenzelm@18678
   995
    else error ("Illegal schematic variable(s) in case " ^ quote name)
wenzelm@18609
   996
  end;
wenzelm@18609
   997
wenzelm@18672
   998
fun fix (x, T) ctxt =
wenzelm@18672
   999
  let
wenzelm@18672
  1000
    val (bind, ctxt') = bind_fixes [x] ctxt;
wenzelm@18672
  1001
    val t = bind (Free (x, T));
wenzelm@20163
  1002
  in (t, ctxt' |> Variable.declare_constraints t) end;
wenzelm@18672
  1003
wenzelm@16147
  1004
in
wenzelm@16147
  1005
wenzelm@18672
  1006
fun add_cases is_proper = map_cases o fold (add_case is_proper);
wenzelm@18609
  1007
wenzelm@18609
  1008
fun case_result c ctxt =
wenzelm@18609
  1009
  let
wenzelm@18609
  1010
    val RuleCases.Case {fixes, ...} = c;
wenzelm@18672
  1011
    val (ts, ctxt') = ctxt |> fold_map fix fixes;
wenzelm@18672
  1012
    val RuleCases.Case {assumes, binds, cases, ...} = RuleCases.apply ts c;
wenzelm@18609
  1013
  in
wenzelm@18609
  1014
    ctxt'
wenzelm@18699
  1015
    |> add_binds_i (map drop_schematic binds)
wenzelm@18609
  1016
    |> add_cases true (map (apsnd SOME) cases)
wenzelm@18609
  1017
    |> pair (assumes, (binds, cases))
wenzelm@18609
  1018
  end;
wenzelm@18609
  1019
wenzelm@18609
  1020
val apply_case = apfst fst oo case_result;
wenzelm@18609
  1021
wenzelm@16540
  1022
fun get_case ctxt name xs =
wenzelm@17184
  1023
  (case AList.lookup (op =) (cases_of ctxt) name of
wenzelm@18678
  1024
    NONE => error ("Unknown case: " ^ quote name)
wenzelm@18678
  1025
  | SOME (c, _) => prep_case name xs c);
wenzelm@8373
  1026
wenzelm@16147
  1027
end;
wenzelm@8373
  1028
wenzelm@8373
  1029
wenzelm@8373
  1030
wenzelm@10810
  1031
(** print context information **)
wenzelm@10810
  1032
wenzelm@20310
  1033
val debug = ref false;
wenzelm@20310
  1034
wenzelm@10810
  1035
val verbose = ref false;
wenzelm@10810
  1036
fun verb f x = if ! verbose then f (x ()) else [];
wenzelm@10810
  1037
wenzelm@10810
  1038
fun setmp_verbose f x = Library.setmp verbose true f x;
wenzelm@10810
  1039
wenzelm@10810
  1040
wenzelm@12072
  1041
(* local syntax *)
wenzelm@12072
  1042
wenzelm@12093
  1043
val print_syntax = Syntax.print_syntax o syn_of;
wenzelm@12072
  1044
wenzelm@12072
  1045
wenzelm@18971
  1046
(* local consts *)
wenzelm@18971
  1047
wenzelm@18971
  1048
fun pretty_consts ctxt =
wenzelm@18971
  1049
  let
wenzelm@19033
  1050
    val ((_, globals), (space, consts)) =
wenzelm@19033
  1051
      pairself (#constants o Consts.dest) (#consts (rep_context ctxt));
wenzelm@18971
  1052
    fun local_abbrev (_, (_, NONE)) = I
wenzelm@18971
  1053
      | local_abbrev (c, (T, SOME t)) =
wenzelm@18971
  1054
          if Symtab.defined globals c then I else cons (c, Logic.mk_equals (Const (c, T), t));
wenzelm@18971
  1055
    val abbrevs = NameSpace.extern_table (space, Symtab.make (Symtab.fold local_abbrev consts []));
wenzelm@18971
  1056
  in
wenzelm@18971
  1057
    if null abbrevs andalso not (! verbose) then []
wenzelm@19310
  1058
    else [Pretty.big_list "abbreviations:" (map (pretty_term_no_abbrevs ctxt o #2) abbrevs)]
wenzelm@18971
  1059
  end;
wenzelm@18971
  1060
wenzelm@18971
  1061
wenzelm@10810
  1062
(* term bindings *)
wenzelm@10810
  1063
wenzelm@16540
  1064
fun pretty_binds ctxt =
wenzelm@10810
  1065
  let
wenzelm@19897
  1066
    val binds = Variable.binds_of ctxt;
wenzelm@19310
  1067
    fun prt_bind (xi, (T, t)) = pretty_term_no_abbrevs ctxt (Logic.mk_equals (Var (xi, T), t));
wenzelm@10810
  1068
  in
wenzelm@15758
  1069
    if Vartab.is_empty binds andalso not (! verbose) then []
wenzelm@15758
  1070
    else [Pretty.big_list "term bindings:" (map prt_bind (Vartab.dest binds))]
wenzelm@10810
  1071
  end;
wenzelm@10810
  1072
wenzelm@10810
  1073
val print_binds = Pretty.writeln o Pretty.chunks o pretty_binds;
wenzelm@10810
  1074
wenzelm@10810
  1075
wenzelm@10810
  1076
(* local theorems *)
wenzelm@10810
  1077
wenzelm@16540
  1078
fun pretty_lthms ctxt =
wenzelm@20012
  1079
  let
wenzelm@20012
  1080
    val props = FactIndex.props (fact_index_of ctxt);
wenzelm@20012
  1081
    val facts =
wenzelm@20012
  1082
      (if null props then I else cons ("unnamed", props))
wenzelm@20012
  1083
      (NameSpace.extern_table (#1 (thms_of ctxt)));
wenzelm@20012
  1084
  in
wenzelm@20012
  1085
    if null facts andalso not (! verbose) then []
wenzelm@20012
  1086
    else [Pretty.big_list "facts:" (map (pretty_fact ctxt) facts)]
wenzelm@20012
  1087
  end;
wenzelm@10810
  1088
wenzelm@12057
  1089
val print_lthms = Pretty.writeln o Pretty.chunks o pretty_lthms;
wenzelm@10810
  1090
wenzelm@10810
  1091
wenzelm@10810
  1092
(* local contexts *)
wenzelm@10810
  1093
wenzelm@16540
  1094
fun pretty_cases ctxt =
wenzelm@10810
  1095
  let
wenzelm@12057
  1096
    val prt_term = pretty_term ctxt;
wenzelm@12057
  1097
wenzelm@10810
  1098
    fun prt_let (xi, t) = Pretty.block
wenzelm@10818
  1099
      [Pretty.quote (prt_term (Var (xi, Term.fastype_of t))), Pretty.str " =", Pretty.brk 1,
wenzelm@10810
  1100
        Pretty.quote (prt_term t)];
wenzelm@10810
  1101
wenzelm@13425
  1102
    fun prt_asm (a, ts) = Pretty.block (Pretty.breaks
wenzelm@13425
  1103
      ((if a = "" then [] else [Pretty.str (a ^ ":")]) @ map (Pretty.quote o prt_term) ts));
wenzelm@13425
  1104
wenzelm@10810
  1105
    fun prt_sect _ _ _ [] = []
wenzelm@10810
  1106
      | prt_sect s sep prt xs = [Pretty.block (Pretty.breaks (Pretty.str s ::
wenzelm@19482
  1107
            flat (Library.separate sep (map (Library.single o prt) xs))))];
wenzelm@10810
  1108
wenzelm@18609
  1109
    fun prt_case (name, (fixes, (asms, (lets, cs)))) = Pretty.block (Pretty.fbreaks
wenzelm@10810
  1110
      (Pretty.str (name ^ ":") ::
wenzelm@11915
  1111
        prt_sect "fix" [] (Pretty.str o fst) fixes @
wenzelm@10810
  1112
        prt_sect "let" [Pretty.str "and"] prt_let
wenzelm@19482
  1113
          (map_filter (fn (xi, SOME t) => SOME (xi, t) | _ => NONE) lets) @
wenzelm@13425
  1114
        (if forall (null o #2) asms then []
wenzelm@18609
  1115
          else prt_sect "assume" [Pretty.str "and"] prt_asm asms) @
wenzelm@18609
  1116
        prt_sect "subcases:" [] (Pretty.str o fst) cs));
wenzelm@16540
  1117
wenzelm@18476
  1118
    fun add_case (_, (_, false)) = I
wenzelm@18609
  1119
      | add_case (name, (c as RuleCases.Case {fixes, ...}, true)) =
wenzelm@18609
  1120
          cons (name, (fixes, #1 (case_result c ctxt)));
wenzelm@18476
  1121
    val cases = fold add_case (cases_of ctxt) [];
wenzelm@10810
  1122
  in
wenzelm@10810
  1123
    if null cases andalso not (! verbose) then []
wenzelm@18476
  1124
    else [Pretty.big_list "cases:" (map prt_case cases)]
wenzelm@10810
  1125
  end;
wenzelm@10810
  1126
wenzelm@10810
  1127
val print_cases = Pretty.writeln o Pretty.chunks o pretty_cases;
wenzelm@10810
  1128
wenzelm@10810
  1129
wenzelm@12057
  1130
(* core context *)
wenzelm@10810
  1131
wenzelm@20367
  1132
val prems_limit = ref ~1;
wenzelm@10810
  1133
wenzelm@18672
  1134
fun pretty_ctxt ctxt =
wenzelm@20310
  1135
  if ! prems_limit < 0 andalso not (! debug) then []
wenzelm@20310
  1136
  else
wenzelm@20310
  1137
    let
wenzelm@20310
  1138
      val prt_term = pretty_term ctxt;
wenzelm@12057
  1139
wenzelm@20310
  1140
      (*structures*)
wenzelm@20310
  1141
      val structs = LocalSyntax.structs_of (syntax_of ctxt);
wenzelm@20310
  1142
      val prt_structs = if null structs then []
wenzelm@20310
  1143
        else [Pretty.block (Pretty.str "structures:" :: Pretty.brk 1 ::
wenzelm@20310
  1144
          Pretty.commas (map Pretty.str structs))];
wenzelm@12093
  1145
wenzelm@20310
  1146
      (*fixes*)
wenzelm@20310
  1147
      fun prt_fix (x, x') =
wenzelm@20310
  1148
        if x = x' then Pretty.str x
wenzelm@20310
  1149
        else Pretty.block [Pretty.str x, Pretty.str " =", Pretty.brk 1, prt_term (Syntax.free x')];
wenzelm@20310
  1150
      val fixes =
wenzelm@20310
  1151
        rev (filter_out ((can Name.dest_internal orf member (op =) structs) o #1)
wenzelm@20310
  1152
          (Variable.fixes_of ctxt));
wenzelm@20310
  1153
      val prt_fixes = if null fixes then []
wenzelm@20310
  1154
        else [Pretty.block (Pretty.str "fixed variables:" :: Pretty.brk 1 ::
wenzelm@20310
  1155
          Pretty.commas (map prt_fix fixes))];
wenzelm@12057
  1156
wenzelm@20310
  1157
      (*prems*)
wenzelm@20310
  1158
      val prems = Assumption.prems_of ctxt;
wenzelm@20310
  1159
      val len = length prems;
wenzelm@20367
  1160
      val suppressed = len - ! prems_limit;
wenzelm@20310
  1161
      val prt_prems = if null prems then []
wenzelm@20367
  1162
        else [Pretty.big_list "prems:" ((if suppressed <= 0 then [] else [Pretty.str "..."]) @
wenzelm@20367
  1163
          map (pretty_thm ctxt) (Library.drop (suppressed, prems)))];
wenzelm@20310
  1164
    in prt_structs @ prt_fixes @ prt_prems end;
wenzelm@10810
  1165
wenzelm@10810
  1166
wenzelm@10810
  1167
(* main context *)
wenzelm@10810
  1168
wenzelm@16540
  1169
fun pretty_context ctxt =
wenzelm@10810
  1170
  let
wenzelm@12057
  1171
    val prt_term = pretty_term ctxt;
wenzelm@12057
  1172
    val prt_typ = pretty_typ ctxt;
wenzelm@12057
  1173
    val prt_sort = pretty_sort ctxt;
wenzelm@10810
  1174
wenzelm@10810
  1175
    (*theory*)
wenzelm@12057
  1176
    val pretty_thy = Pretty.block
wenzelm@17384
  1177
      [Pretty.str "theory:", Pretty.brk 1, Context.pretty_thy (theory_of ctxt)];
wenzelm@10810
  1178
wenzelm@10810
  1179
    (*defaults*)
wenzelm@10810
  1180
    fun prt_atom prt prtT (x, X) = Pretty.block
wenzelm@10810
  1181
      [prt x, Pretty.str " ::", Pretty.brk 1, prtT X];
wenzelm@10810
  1182
wenzelm@10810
  1183
    fun prt_var (x, ~1) = prt_term (Syntax.free x)
wenzelm@10810
  1184
      | prt_var xi = prt_term (Syntax.var xi);
wenzelm@10810
  1185
wenzelm@10810
  1186
    fun prt_varT (x, ~1) = prt_typ (TFree (x, []))
wenzelm@10810
  1187
      | prt_varT xi = prt_typ (TVar (xi, []));
wenzelm@10810
  1188
wenzelm@10810
  1189
    val prt_defT = prt_atom prt_var prt_typ;
wenzelm@10810
  1190
    val prt_defS = prt_atom prt_varT prt_sort;
wenzelm@16540
  1191
wenzelm@20163
  1192
    val (types, sorts) = Variable.constraints_of ctxt;
wenzelm@10810
  1193
  in
wenzelm@18609
  1194
    verb single (K pretty_thy) @
wenzelm@18672
  1195
    pretty_ctxt ctxt @
wenzelm@18971
  1196
    verb pretty_consts (K ctxt) @
wenzelm@10810
  1197
    verb pretty_binds (K ctxt) @
wenzelm@12057
  1198
    verb pretty_lthms (K ctxt) @
wenzelm@10810
  1199
    verb pretty_cases (K ctxt) @
wenzelm@18609
  1200
    verb single (fn () => Pretty.big_list "type constraints:" (map prt_defT (Vartab.dest types))) @
wenzelm@20163
  1201
    verb single (fn () => Pretty.big_list "default sorts:" (map prt_defS (Vartab.dest sorts)))
wenzelm@10810
  1202
  end;
wenzelm@10810
  1203
wenzelm@5819
  1204
end;