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