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