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