src/Pure/Isar/proof_context.ML
author wenzelm
Mon Aug 29 16:18:04 2005 +0200 (2005-08-29 ago)
changeset 17184 3d80209e9a53
parent 17072 501c28052aea
child 17221 6cd180204582
permissions -rw-r--r--
use AList operations;
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@15758
     5
The key concept of Isar proof contexts.
wenzelm@5819
     6
*)
wenzelm@5819
     7
wenzelm@14707
     8
val show_structs = ref false;
wenzelm@14707
     9
wenzelm@5819
    10
signature PROOF_CONTEXT =
wenzelm@5819
    11
sig
wenzelm@5819
    12
  type context
wenzelm@9470
    13
  type exporter
wenzelm@5819
    14
  exception CONTEXT of string * context
wenzelm@5819
    15
  val theory_of: context -> theory
wenzelm@16458
    16
  val sign_of: context -> theory    (*obsolete*)
wenzelm@14828
    17
  val is_fixed: context -> string -> bool
wenzelm@16031
    18
  val is_known: context -> string -> bool
wenzelm@12057
    19
  val fixed_names_of: context -> string list
wenzelm@12057
    20
  val assumptions_of: context -> (cterm list * exporter) list
wenzelm@7557
    21
  val prems_of: context -> thm list
wenzelm@16031
    22
  val fact_index_of: context -> FactIndex.T
wenzelm@5874
    23
  val init: theory -> context
wenzelm@17072
    24
  val transfer: theory -> context -> context
wenzelm@14828
    25
  val pretty_term: context -> term -> Pretty.T
wenzelm@14828
    26
  val pretty_typ: context -> typ -> Pretty.T
wenzelm@14828
    27
  val pretty_sort: context -> sort -> Pretty.T
wenzelm@14828
    28
  val pp: context -> Pretty.pp
wenzelm@14828
    29
  val pretty_thm: context -> thm -> Pretty.T
wenzelm@14828
    30
  val pretty_thms: context -> thm list -> Pretty.T
wenzelm@14828
    31
  val pretty_fact: context -> string * thm list -> Pretty.T
wenzelm@17072
    32
  val pretty_proof: context -> Proofterm.proof -> Pretty.T
wenzelm@17072
    33
  val pretty_proof_of: context -> bool -> thm -> Pretty.T
wenzelm@14828
    34
  val string_of_term: context -> term -> string
wenzelm@12414
    35
  val default_type: context -> string -> typ option
wenzelm@12504
    36
  val used_types: context -> string list
wenzelm@5819
    37
  val read_typ: context -> string -> typ
wenzelm@16348
    38
  val read_typ_syntax: context -> string -> typ
wenzelm@16348
    39
  val read_typ_abbrev: context -> string -> typ
wenzelm@5819
    40
  val cert_typ: context -> typ -> typ
wenzelm@16348
    41
  val cert_typ_syntax: context -> typ -> typ
wenzelm@16348
    42
  val cert_typ_abbrev: context -> typ -> typ
wenzelm@10583
    43
  val get_skolem: context -> string -> string
wenzelm@9133
    44
  val extern_skolem: context -> term -> term
wenzelm@14720
    45
  val read_termTs: context -> (string -> bool) -> (indexname -> typ option)
wenzelm@14720
    46
    -> (indexname -> sort option) -> string list -> (string * typ) list
wenzelm@14720
    47
    -> term list * (indexname * typ) list
wenzelm@14720
    48
  val read_termTs_schematic: context -> (string -> bool) -> (indexname -> typ option)
wenzelm@14720
    49
    -> (indexname -> sort option) -> string list -> (string * typ) list
wenzelm@14720
    50
    -> term list * (indexname * typ) list
wenzelm@14720
    51
  val read_term_liberal: context -> string -> term
wenzelm@5819
    52
  val read_term: context -> string -> term
wenzelm@5819
    53
  val read_prop: context -> string -> term
wenzelm@11925
    54
  val read_prop_schematic: context -> string -> term
wenzelm@10465
    55
  val read_terms: context -> string list -> term list
wenzelm@8096
    56
  val read_term_pats: typ -> context -> string list -> term list
wenzelm@8096
    57
  val read_prop_pats: context -> string list -> term list
wenzelm@5819
    58
  val cert_term: context -> term -> term
wenzelm@5819
    59
  val cert_prop: context -> term -> term
wenzelm@8096
    60
  val cert_term_pats: typ -> context -> term list -> term list
wenzelm@8096
    61
  val cert_prop_pats: context -> term list -> term list
wenzelm@5819
    62
  val declare_term: term -> context -> context
wenzelm@15703
    63
  val read_tyname: context -> string -> typ
wenzelm@15703
    64
  val read_const: context -> string -> term
wenzelm@7925
    65
  val warn_extra_tfrees: context -> context -> context
wenzelm@12550
    66
  val generalize: context -> context -> term list -> term list
wenzelm@9470
    67
  val find_free: term -> string -> term option
wenzelm@12008
    68
  val export: bool -> context -> context -> thm -> thm Seq.seq
wenzelm@13415
    69
  val export_standard: cterm list -> context -> context -> thm -> thm
ballarin@15696
    70
  val export_plain: cterm list -> context -> context -> thm -> thm
wenzelm@10810
    71
  val drop_schematic: indexname * term option -> indexname * term option
wenzelm@10810
    72
  val add_binds: (indexname * string option) list -> context -> context
wenzelm@10810
    73
  val add_binds_i: (indexname * term option) list -> context -> context
wenzelm@12147
    74
  val auto_bind_goal: term list -> context -> context
wenzelm@12147
    75
  val auto_bind_facts: term list -> context -> context
wenzelm@8616
    76
  val match_bind: bool -> (string list * string) list -> context -> context
wenzelm@8616
    77
  val match_bind_i: bool -> (term list * term) list -> context -> context
wenzelm@10465
    78
  val read_propp: context * (string * (string list * string list)) list list
wenzelm@10465
    79
    -> context * (term * (term list * term list)) list list
wenzelm@10465
    80
  val cert_propp: context * (term * (term list * term list)) list list
wenzelm@10465
    81
    -> context * (term * (term list * term list)) list list
wenzelm@10554
    82
  val read_propp_schematic: context * (string * (string list * string list)) list list
wenzelm@10554
    83
    -> context * (term * (term list * term list)) list list
wenzelm@10554
    84
  val cert_propp_schematic: context * (term * (term list * term list)) list list
wenzelm@10554
    85
    -> context * (term * (term list * term list)) list list
wenzelm@10465
    86
  val bind_propp: context * (string * (string list * string list)) list list
wenzelm@10465
    87
    -> context * (term list list * (context -> context))
wenzelm@10465
    88
  val bind_propp_i: context * (term * (term list * term list)) list list
wenzelm@10465
    89
    -> context * (term list list * (context -> context))
wenzelm@10554
    90
  val bind_propp_schematic: context * (string * (string list * string list)) list list
wenzelm@10554
    91
    -> context * (term list list * (context -> context))
wenzelm@10554
    92
  val bind_propp_schematic_i: context * (term * (term list * term list)) list list
wenzelm@10554
    93
    -> context * (term list list * (context -> context))
berghofe@15456
    94
  val get_thm: context -> thmref -> thm
berghofe@15456
    95
  val get_thm_closure: context -> thmref -> thm
berghofe@15456
    96
  val get_thms: context -> thmref -> thm list
berghofe@15456
    97
  val get_thms_closure: context -> thmref -> thm list
wenzelm@16031
    98
  val valid_thms: context -> string * thm list -> bool
wenzelm@16031
    99
  val lthms_containing: context -> FactIndex.spec -> (string * thm list) list
wenzelm@16348
   100
  val extern_thm: context -> string -> xstring
wenzelm@16147
   101
  val qualified_names: context -> context
wenzelm@16147
   102
  val no_base_names: context -> context
wenzelm@16147
   103
  val custom_accesses: (string list -> string list list) -> context -> context
wenzelm@16147
   104
  val restore_naming: context -> context -> context
wenzelm@13425
   105
  val hide_thms: bool -> string list -> context -> context
wenzelm@6091
   106
  val put_thm: string * thm -> context -> context
wenzelm@6091
   107
  val put_thms: string * thm list -> context -> context
wenzelm@6091
   108
  val put_thmss: (string * thm list) list -> context -> context
wenzelm@7606
   109
  val reset_thms: string -> context -> context
wenzelm@14564
   110
  val note_thmss:
wenzelm@16147
   111
    ((bstring * context attribute list) * (thmref * context attribute list) list) list ->
wenzelm@16147
   112
      context -> context * (bstring * thm list) list
wenzelm@14564
   113
  val note_thmss_i:
wenzelm@16147
   114
    ((bstring * context attribute list) * (thm list * context attribute list) list) list ->
wenzelm@16147
   115
      context -> context * (bstring * thm list) list
wenzelm@11918
   116
  val export_assume: exporter
wenzelm@11918
   117
  val export_presume: exporter
wenzelm@12086
   118
  val cert_def: context -> term -> string * term
wenzelm@11918
   119
  val export_def: exporter
wenzelm@9470
   120
  val assume: exporter
wenzelm@10465
   121
    -> ((string * context attribute list) * (string * (string list * string list)) list) list
wenzelm@12835
   122
    -> context -> context * (bstring * thm list) list
wenzelm@9470
   123
  val assume_i: exporter
wenzelm@10465
   124
    -> ((string * context attribute list) * (term * (term list * term list)) list) list
wenzelm@12835
   125
    -> context -> context * (bstring * thm list) list
wenzelm@14720
   126
  val read_vars: context * (string list * string option)
wenzelm@14720
   127
    -> context * (string list * typ option)
wenzelm@14720
   128
  val cert_vars: context * (string list * typ option)
wenzelm@14720
   129
    -> context * (string list * typ option)
wenzelm@14720
   130
  val read_vars_liberal: context * (string list * string option)
wenzelm@14720
   131
    -> context * (string list * typ option)
wenzelm@14720
   132
  val cert_vars_liberal: context * (string list * typ option)
wenzelm@14720
   133
    -> context * (string list * typ option)
wenzelm@7411
   134
  val fix: (string list * string option) list -> context -> context
wenzelm@7663
   135
  val fix_i: (string list * typ option) list -> context -> context
wenzelm@14643
   136
  val add_fixes: (string * typ option * Syntax.mixfix option) list -> context -> context
wenzelm@14720
   137
  val add_fixes_liberal: (string * typ option * Syntax.mixfix option) list -> context -> context
wenzelm@12016
   138
  val fix_frees: term list -> context -> context
wenzelm@9291
   139
  val bind_skolem: context -> string list -> term -> term
wenzelm@13425
   140
  val apply_case: RuleCases.T -> context
wenzelm@13425
   141
    -> context * ((indexname * term option) list * (string * term list) list)
wenzelm@16147
   142
  val get_case: context -> string -> string option list -> RuleCases.T
wenzelm@16147
   143
  val add_cases: (string * RuleCases.T option) list -> context -> context
wenzelm@10810
   144
  val verbose: bool ref
wenzelm@10810
   145
  val setmp_verbose: ('a -> 'b) -> 'a -> 'b
wenzelm@12072
   146
  val print_syntax: context -> unit
wenzelm@10810
   147
  val print_binds: context -> unit
wenzelm@12057
   148
  val print_lthms: context -> unit
wenzelm@10810
   149
  val print_cases: context -> unit
wenzelm@10810
   150
  val prems_limit: int ref
wenzelm@12057
   151
  val pretty_asms: context -> Pretty.T list
wenzelm@10810
   152
  val pretty_context: context -> Pretty.T list
wenzelm@5819
   153
end;
wenzelm@5819
   154
wenzelm@16540
   155
structure ProofContext: PROOF_CONTEXT =
wenzelm@5819
   156
struct
wenzelm@5819
   157
wenzelm@16540
   158
(** generic proof contexts **)
wenzelm@9470
   159
wenzelm@16540
   160
type context = Context.proof;
wenzelm@17072
   161
exception CONTEXT = Context.PROOF;
wenzelm@5819
   162
wenzelm@16540
   163
val theory_of = Context.theory_of_proof;
wenzelm@16458
   164
val sign_of = theory_of;
wenzelm@5819
   165
wenzelm@16540
   166
val init = Context.init_proof;
wenzelm@12057
   167
wenzelm@7270
   168
wenzelm@5819
   169
wenzelm@16540
   170
(** Isar proof context information **)
wenzelm@5819
   171
wenzelm@16540
   172
type exporter = bool -> cterm list -> thm -> thm Seq.seq;
wenzelm@5819
   173
wenzelm@16540
   174
datatype ctxt =
wenzelm@16540
   175
  Ctxt of
wenzelm@17072
   176
   {syntax: (Syntax.syntax * Syntax.syntax * (Syntax.syntax -> Syntax.syntax)) *
wenzelm@17072
   177
      string list * string list,                (*global/local syntax with structs and mixfixed*)
wenzelm@16540
   178
    asms:
wenzelm@17072
   179
      ((cterm list * exporter) list *           (*assumes: A ==> _*)
wenzelm@17072
   180
        (string * thm list) list) *             (*prems: A |- A *)
wenzelm@17072
   181
      (string * string) list,                   (*fixes: !!x. _*)
wenzelm@17072
   182
    binds: (term * typ) Vartab.table,           (*term bindings*)
wenzelm@17072
   183
    thms: NameSpace.naming *                    (*local thms*)
wenzelm@16540
   184
      thm list NameSpace.table * FactIndex.T,
wenzelm@17072
   185
    cases: (string * RuleCases.T) list,         (*local contexts*)
wenzelm@16540
   186
    defs:
wenzelm@17072
   187
      typ Vartab.table *                        (*type constraints*)
wenzelm@17072
   188
      sort Vartab.table *                       (*default sorts*)
wenzelm@17072
   189
      string list *                             (*used type variables*)
wenzelm@17072
   190
      term list Symtab.table};                  (*type variable occurrences*)
wenzelm@5819
   191
wenzelm@16540
   192
fun make_ctxt (syntax, asms, binds, thms, cases, defs) =
wenzelm@16540
   193
  Ctxt {syntax = syntax, asms = asms, binds = binds, thms = thms, cases = cases, defs = defs};
wenzelm@5819
   194
wenzelm@16540
   195
structure ContextData = ProofDataFun
wenzelm@16458
   196
(struct
wenzelm@16540
   197
  val name = "Isar/context";
wenzelm@16540
   198
  type T = ctxt;
wenzelm@16540
   199
  fun init thy =
wenzelm@17072
   200
    make_ctxt (((Sign.syn_of thy, Sign.syn_of thy, I), [], []), (([], []), []),
wenzelm@17072
   201
      Vartab.empty, (NameSpace.default_naming, NameSpace.empty_table, FactIndex.empty), [],
wenzelm@16540
   202
      (Vartab.empty, Vartab.empty, [], Symtab.empty));
wenzelm@16540
   203
  fun print _ _ = ();
wenzelm@16458
   204
end);
wenzelm@5819
   205
wenzelm@16540
   206
val _ = Context.add_setup [ContextData.init];
wenzelm@5819
   207
wenzelm@16540
   208
fun rep_context ctxt = ContextData.get ctxt |> (fn Ctxt args => args);
wenzelm@5819
   209
wenzelm@16540
   210
fun map_context f = ContextData.map (fn Ctxt {syntax, asms, binds, thms, cases, defs} =>
wenzelm@16540
   211
  make_ctxt (f (syntax, asms, binds, thms, cases, defs)));
wenzelm@5819
   212
wenzelm@16540
   213
val syntax_of = #syntax o rep_context;
wenzelm@5819
   214
wenzelm@16540
   215
val assumptions_of = #1 o #1 o #asms o rep_context;
wenzelm@16540
   216
val prems_of = List.concat o map #2 o #2 o #1 o #asms o rep_context;
wenzelm@16540
   217
val fixes_of = #2 o #asms o rep_context;
wenzelm@16540
   218
val fixed_names_of = map #2 o fixes_of;
wenzelm@5819
   219
wenzelm@16540
   220
val binds_of =  #binds o rep_context;
wenzelm@5819
   221
wenzelm@16540
   222
val thms_of = #thms o rep_context;
wenzelm@16540
   223
val fact_index_of = #3 o thms_of;
wenzelm@16540
   224
wenzelm@16540
   225
val cases_of = #cases o rep_context;
wenzelm@5819
   226
wenzelm@16540
   227
val defaults_of = #defs o rep_context;
wenzelm@16540
   228
val type_occs_of = #4 o defaults_of;
wenzelm@5819
   229
wenzelm@16540
   230
fun is_fixed ctxt x = exists (equal x o #2) (fixes_of ctxt);
wenzelm@16894
   231
fun is_known ctxt x = Vartab.defined (#1 (defaults_of ctxt)) (x, ~1) orelse is_fixed ctxt x;
wenzelm@5819
   232
wenzelm@5819
   233
wenzelm@8096
   234
wenzelm@12093
   235
(** local syntax **)
wenzelm@12093
   236
wenzelm@12093
   237
val fixedN = "\\<^fixed>";
wenzelm@12093
   238
val structN = "\\<^struct>";
wenzelm@12093
   239
wenzelm@12100
   240
wenzelm@14697
   241
(* translation functions *)
wenzelm@14665
   242
wenzelm@14665
   243
fun fixed_tr x = (fixedN ^ x, curry Term.list_comb (Syntax.free x));
wenzelm@14665
   244
wenzelm@12100
   245
fun context_tr' ctxt =
wenzelm@12100
   246
  let
wenzelm@12100
   247
    val (_, structs, mixfixed) = syntax_of ctxt;
wenzelm@12100
   248
wenzelm@12100
   249
    fun tr' (t $ u) = tr' t $ tr' u
wenzelm@12100
   250
      | tr' (Abs (x, T, t)) = Abs (x, T, tr' t)
wenzelm@12100
   251
      | tr' (t as Free (x, T)) =
wenzelm@14697
   252
          let val i = Library.find_index_eq x structs + 1 in
wenzelm@14697
   253
            if i = 0 andalso x mem_string mixfixed then Const (fixedN ^ x, T)
wenzelm@14707
   254
            else if i = 1 andalso not (! show_structs) then
wenzelm@14707
   255
              Syntax.const "_struct" $ Syntax.const "_indexdefault"
wenzelm@12100
   256
            else t
wenzelm@12100
   257
          end
wenzelm@12100
   258
      | tr' a = a;
wenzelm@12100
   259
  in tr' end;
wenzelm@12100
   260
wenzelm@12100
   261
wenzelm@12576
   262
(* add syntax *)
wenzelm@12576
   263
wenzelm@12576
   264
fun mixfix_type mx = replicate (Syntax.mixfix_args mx) TypeInfer.logicT ---> TypeInfer.logicT;
wenzelm@12093
   265
wenzelm@12093
   266
local
wenzelm@12093
   267
skalberg@15531
   268
fun mixfix x NONE mx = (fixedN ^ x, mixfix_type mx, Syntax.fix_mixfix x mx)
skalberg@15531
   269
  | mixfix x (SOME T) mx = (fixedN ^ x, T, Syntax.fix_mixfix x mx);
wenzelm@12093
   270
skalberg@15531
   271
fun prep_mixfix (_, _, NONE) = NONE
skalberg@15531
   272
  | prep_mixfix (x, opt_T, SOME mx) = SOME (mixfix x opt_T mx);
wenzelm@12093
   273
skalberg@15531
   274
fun prep_mixfix' (_, _, NONE) = NONE
skalberg@15531
   275
  | prep_mixfix' (x, _, SOME Syntax.NoSyn) = NONE
skalberg@15531
   276
  | prep_mixfix' (x, opt_T, _) = SOME (x, mixfix x opt_T (Syntax.literal x));
wenzelm@12093
   277
skalberg@15531
   278
fun prep_struct (x, _, NONE) = SOME x
skalberg@15531
   279
  | prep_struct _ = NONE;
wenzelm@12093
   280
wenzelm@15750
   281
fun mk trs = map Syntax.mk_trfun trs;
wenzelm@15750
   282
wenzelm@17072
   283
fun extend_syntax thy extend (global_syn, syn, mk_syn) =
wenzelm@17072
   284
  let
wenzelm@17072
   285
    val thy_syn = Sign.syn_of thy;
wenzelm@17072
   286
    val mk_syn' = extend o mk_syn;
wenzelm@17072
   287
    val (global_syn', syn') =
wenzelm@17072
   288
      if Syntax.eq_syntax (global_syn, thy_syn)
wenzelm@17072
   289
      then (global_syn, extend syn)
wenzelm@17072
   290
      else (thy_syn, mk_syn' thy_syn);    (*potentially expensive*)
wenzelm@17072
   291
  in (global_syn', syn', mk_syn') end;
wenzelm@17072
   292
wenzelm@12093
   293
in
wenzelm@12093
   294
wenzelm@17072
   295
fun add_syntax decls ctxt = ctxt |> map_context (fn (syntax, asms, binds, thms, cases, defs) =>
wenzelm@17072
   296
  let
wenzelm@17072
   297
    val (syns, structs, mixfixed) = syntax;
wenzelm@17072
   298
    val thy = theory_of ctxt;
wenzelm@17072
   299
wenzelm@17072
   300
    val is_logtype = Sign.is_logtype thy;
wenzelm@17072
   301
    val structs' = structs @ List.mapPartial prep_struct decls;
wenzelm@17072
   302
    val mxs = List.mapPartial prep_mixfix decls;
wenzelm@17072
   303
    val (fixed, mxs_output) = Library.split_list (List.mapPartial prep_mixfix' decls);
wenzelm@17072
   304
    val trs = map fixed_tr fixed;
wenzelm@12093
   305
wenzelm@17072
   306
    val extend =
wenzelm@17072
   307
      Syntax.extend_const_gram is_logtype ("", false) mxs_output
wenzelm@17072
   308
      #> Syntax.extend_const_gram is_logtype ("", true) mxs
wenzelm@17072
   309
      #> Syntax.extend_trfuns ([], mk trs, [], []);
wenzelm@17072
   310
    val syns' = extend_syntax thy extend syns;
wenzelm@17072
   311
  in ((syns', structs', fixed @ mixfixed), asms, binds, thms, cases, defs) end);
wenzelm@17072
   312
wenzelm@17072
   313
fun syn_of' thy ctxt =
wenzelm@16540
   314
  let
wenzelm@17072
   315
    val (syns, structs, _) = syntax_of ctxt;
wenzelm@16540
   316
    val (atrs, trs, trs', atrs') = Syntax.struct_trfuns structs;
wenzelm@17072
   317
    val extend = Syntax.extend_trfuns (mk atrs, mk trs, mk trs', mk atrs');
wenzelm@17072
   318
  in #2 (extend_syntax thy extend syns) end;
wenzelm@17072
   319
wenzelm@17072
   320
fun syn_of ctxt = syn_of' (theory_of ctxt) ctxt;
wenzelm@14697
   321
wenzelm@12093
   322
end;
wenzelm@12093
   323
wenzelm@17072
   324
fun transfer thy = add_syntax [] o Context.transfer_proof thy;
wenzelm@17072
   325
wenzelm@12093
   326
wenzelm@12093
   327
wenzelm@14828
   328
(** pretty printing **)
wenzelm@14828
   329
wenzelm@17072
   330
fun pretty_term' thy ctxt t = Sign.pretty_term' (syn_of' thy ctxt) thy (context_tr' ctxt t);
wenzelm@17072
   331
fun pretty_term ctxt t = pretty_term' (theory_of ctxt) ctxt (context_tr' ctxt t);
wenzelm@16458
   332
fun pretty_typ ctxt T = Sign.pretty_typ (theory_of ctxt) T;
wenzelm@16458
   333
fun pretty_sort ctxt S = Sign.pretty_sort (theory_of ctxt) S;
wenzelm@16458
   334
fun pretty_classrel ctxt cs = Sign.pretty_classrel (theory_of ctxt) cs;
wenzelm@16458
   335
fun pretty_arity ctxt ar = Sign.pretty_arity (theory_of ctxt) ar;
wenzelm@14828
   336
wenzelm@14974
   337
fun pp ctxt = Pretty.pp (pretty_term ctxt, pretty_typ ctxt, pretty_sort ctxt,
wenzelm@14974
   338
  pretty_classrel ctxt, pretty_arity ctxt);
wenzelm@14828
   339
wenzelm@14828
   340
val string_of_term = Pretty.string_of oo pretty_term;
wenzelm@14828
   341
wenzelm@14828
   342
fun pretty_thm ctxt thm =
wenzelm@14828
   343
  if ! Display.show_hyps then
wenzelm@14876
   344
    Display.pretty_thm_aux (pp ctxt) false thm
wenzelm@14828
   345
  else pretty_term ctxt (Thm.prop_of thm);
wenzelm@14828
   346
wenzelm@14828
   347
fun pretty_thms ctxt [th] = pretty_thm ctxt th
wenzelm@14828
   348
  | pretty_thms ctxt ths = Pretty.blk (0, Pretty.fbreaks (map (pretty_thm ctxt) ths));
wenzelm@14828
   349
wenzelm@14828
   350
fun pretty_fact ctxt ("", ths) = pretty_thms ctxt ths
wenzelm@14828
   351
  | pretty_fact ctxt (a, [th]) =
wenzelm@14828
   352
      Pretty.block [Pretty.str (a ^ ":"), Pretty.brk 1, pretty_thm ctxt th]
wenzelm@14828
   353
  | pretty_fact ctxt (a, ths) =
wenzelm@14828
   354
      Pretty.block (Pretty.fbreaks (Pretty.str (a ^ ":") :: map (pretty_thm ctxt) ths));
wenzelm@14828
   355
wenzelm@17072
   356
fun pretty_proof ctxt prf =
wenzelm@17072
   357
  pretty_term' (ProofSyntax.proof_syntax prf (theory_of ctxt)) ctxt
wenzelm@17072
   358
    (ProofSyntax.term_of_proof prf);
wenzelm@17072
   359
wenzelm@17072
   360
fun pretty_proof_of ctxt full th =
wenzelm@17072
   361
  pretty_proof ctxt (ProofSyntax.proof_of full th);
wenzelm@17072
   362
wenzelm@14828
   363
wenzelm@14828
   364
wenzelm@7663
   365
(** default sorts and types **)
wenzelm@7663
   366
wenzelm@16540
   367
fun def_sort ctxt xi = Vartab.lookup (#2 (defaults_of ctxt), xi);
wenzelm@7663
   368
wenzelm@16540
   369
fun def_type ctxt pattern xi =
wenzelm@16540
   370
  let val {binds, defs = (types, _, _, _), ...} = rep_context ctxt in
wenzelm@16540
   371
    (case Vartab.lookup (types, xi) of
wenzelm@16540
   372
      NONE =>
wenzelm@16540
   373
        if pattern then NONE
wenzelm@16540
   374
        else Vartab.lookup (binds, xi) |> Option.map (TypeInfer.polymorphicT o #2)
wenzelm@16540
   375
    | some => some)
wenzelm@16540
   376
  end;
wenzelm@7663
   377
wenzelm@16540
   378
fun default_type ctxt x = Vartab.lookup (#1 (defaults_of ctxt), (x, ~1));
wenzelm@16540
   379
val used_types = #3 o defaults_of;
wenzelm@12414
   380
wenzelm@7663
   381
wenzelm@5819
   382
wenzelm@5819
   383
(** prepare types **)
wenzelm@5819
   384
wenzelm@9504
   385
local
wenzelm@9504
   386
wenzelm@9504
   387
fun read_typ_aux read ctxt s =
wenzelm@16458
   388
  transform_error (read (syn_of ctxt) (theory_of ctxt, def_sort ctxt)) s
wenzelm@7663
   389
    handle ERROR_MESSAGE msg => raise CONTEXT (msg, ctxt);
wenzelm@5819
   390
wenzelm@10554
   391
fun cert_typ_aux cert ctxt raw_T =
wenzelm@16458
   392
  cert (theory_of ctxt) raw_T
wenzelm@10554
   393
    handle TYPE (msg, _, _) => raise CONTEXT (msg, ctxt);
wenzelm@9504
   394
wenzelm@9504
   395
in
wenzelm@9504
   396
wenzelm@16348
   397
val read_typ        = read_typ_aux Sign.read_typ';
wenzelm@16348
   398
val read_typ_syntax = read_typ_aux Sign.read_typ_syntax';
wenzelm@16348
   399
val read_typ_abbrev = read_typ_aux Sign.read_typ_abbrev';
wenzelm@16348
   400
val cert_typ        = cert_typ_aux Sign.certify_typ;
wenzelm@16348
   401
val cert_typ_syntax = cert_typ_aux Sign.certify_typ_syntax;
wenzelm@16348
   402
val cert_typ_abbrev = cert_typ_aux Sign.certify_typ_abbrev;
wenzelm@9504
   403
wenzelm@9504
   404
end;
wenzelm@9504
   405
wenzelm@5819
   406
wenzelm@7679
   407
(* internalize Skolem constants *)
wenzelm@7679
   408
wenzelm@17184
   409
val lookup_skolem = AList.lookup (op =) o fixes_of;
wenzelm@15974
   410
fun get_skolem ctxt x = if_none (lookup_skolem ctxt x) x;
wenzelm@7679
   411
wenzelm@12504
   412
fun no_skolem internal ctxt x =
wenzelm@9291
   413
  if can Syntax.dest_skolem x then
wenzelm@7679
   414
    raise CONTEXT ("Illegal reference to internal Skolem constant: " ^ quote x, ctxt)
wenzelm@12504
   415
  else if not internal andalso can Syntax.dest_internal x then
wenzelm@9291
   416
    raise CONTEXT ("Illegal reference to internal variable: " ^ quote x, ctxt)
wenzelm@7679
   417
  else x;
wenzelm@7679
   418
wenzelm@14720
   419
fun intern_skolem ctxt internal =
wenzelm@7679
   420
  let
wenzelm@7679
   421
    fun intern (t as Free (x, T)) =
wenzelm@14720
   422
          if internal x then t
wenzelm@14720
   423
          else
wenzelm@14720
   424
            (case lookup_skolem ctxt (no_skolem false ctxt x) of
skalberg@15531
   425
              SOME x' => Free (x', T)
skalberg@15531
   426
            | NONE => t)
wenzelm@7679
   427
      | intern (t $ u) = intern t $ intern u
wenzelm@7679
   428
      | intern (Abs (x, T, t)) = Abs (x, T, intern t)
wenzelm@7679
   429
      | intern a = a;
wenzelm@7679
   430
  in intern end;
wenzelm@7679
   431
wenzelm@7679
   432
wenzelm@9133
   433
(* externalize Skolem constants -- for printing purposes only *)
wenzelm@9133
   434
wenzelm@9133
   435
fun extern_skolem ctxt =
wenzelm@9133
   436
  let
wenzelm@9133
   437
    val rev_fixes = map Library.swap (fixes_of ctxt);
wenzelm@9133
   438
wenzelm@9133
   439
    fun extern (t as Free (x, T)) =
wenzelm@17184
   440
          (case AList.lookup (op =) rev_fixes x of
skalberg@15531
   441
            SOME x' => Free (if lookup_skolem ctxt x' = SOME x then x' else NameSpace.hidden x', T)
skalberg@15531
   442
          | NONE => t)
wenzelm@9133
   443
      | extern (t $ u) = extern t $ extern u
wenzelm@9133
   444
      | extern (Abs (x, T, t)) = Abs (x, T, extern t)
wenzelm@9133
   445
      | extern a = a;
wenzelm@9133
   446
  in extern end
wenzelm@9133
   447
wenzelm@8096
   448
wenzelm@5819
   449
(** prepare terms and propositions **)
wenzelm@5819
   450
wenzelm@5819
   451
(*
wenzelm@16501
   452
  (1) read / certify wrt. theory of context
wenzelm@5819
   453
  (2) intern Skolem constants
wenzelm@5819
   454
  (3) expand term bindings
wenzelm@5819
   455
*)
wenzelm@5819
   456
wenzelm@5819
   457
wenzelm@16501
   458
(* read wrt. theory *)     (*exception ERROR*)
wenzelm@5819
   459
wenzelm@16458
   460
fun read_def_termTs freeze pp syn thy (types, sorts, used) sTs =
wenzelm@16458
   461
  Sign.read_def_terms' pp (Sign.is_logtype thy) syn (thy, types, sorts) used freeze sTs;
wenzelm@5874
   462
wenzelm@16458
   463
fun read_def_termT freeze pp syn thy defs sT =
wenzelm@16458
   464
  apfst hd (read_def_termTs freeze pp syn thy defs [sT]);
wenzelm@14828
   465
wenzelm@16458
   466
fun read_term_thy freeze pp syn thy defs s =
wenzelm@16458
   467
  #1 (read_def_termT freeze pp syn thy defs (s, TypeInfer.logicT));
wenzelm@5874
   468
wenzelm@16458
   469
fun read_prop_thy freeze pp syn thy defs s =
wenzelm@16458
   470
  #1 (read_def_termT freeze pp syn thy defs (s, propT));
wenzelm@12072
   471
wenzelm@16458
   472
fun read_terms_thy freeze pp syn thy defs =
wenzelm@16458
   473
  #1 o read_def_termTs freeze pp syn thy defs o map (rpair TypeInfer.logicT);
wenzelm@12072
   474
wenzelm@16458
   475
fun read_props_thy freeze pp syn thy defs =
wenzelm@16458
   476
  #1 o read_def_termTs freeze pp syn thy defs o map (rpair propT);
wenzelm@5819
   477
wenzelm@5819
   478
wenzelm@5819
   479
(* norm_term *)
wenzelm@5819
   480
wenzelm@5819
   481
(*beta normal form for terms (not eta normal form), chase variables in
wenzelm@5819
   482
  bindings environment (code taken from Pure/envir.ML)*)
wenzelm@5819
   483
wenzelm@8616
   484
fun unifyT ctxt (T, U) =
wenzelm@8616
   485
  let val maxidx = Int.max (Term.maxidx_of_typ T, Term.maxidx_of_typ U)
wenzelm@16948
   486
  in #1 (Sign.typ_unify (theory_of ctxt) (T, U) (Vartab.empty, maxidx)) end;
wenzelm@8616
   487
wenzelm@16540
   488
fun norm_term ctxt schematic =
wenzelm@5819
   489
  let
wenzelm@5819
   490
    (*raised when norm has no effect on a term, to do sharing instead of copying*)
wenzelm@5819
   491
    exception SAME;
wenzelm@5819
   492
wenzelm@16540
   493
    val binds = binds_of ctxt;
wenzelm@5819
   494
    fun norm (t as Var (xi, T)) =
wenzelm@5819
   495
          (case Vartab.lookup (binds, xi) of
wenzelm@15758
   496
            SOME (u, U) =>
wenzelm@8616
   497
              let
wenzelm@8616
   498
                val env = unifyT ctxt (T, U) handle Type.TUNIFY =>
ballarin@14174
   499
                  raise TYPE ("norm_term: ill-typed variable assignment", [T, U], [t, u]);
berghofe@15798
   500
                val u' = Envir.subst_TVars env u;
wenzelm@8616
   501
              in norm u' handle SAME => u' end
wenzelm@15758
   502
          | NONE =>
wenzelm@10554
   503
            if schematic then raise SAME
wenzelm@10554
   504
            else raise CONTEXT ("Unbound schematic variable: " ^ Syntax.string_of_vname xi, ctxt))
wenzelm@5819
   505
      | norm (Abs (a, T, body)) =  Abs (a, T, norm body)
wenzelm@5819
   506
      | norm (Abs (_, _, body) $ t) = normh (subst_bound (t, body))
wenzelm@5819
   507
      | norm (f $ t) =
wenzelm@5819
   508
          ((case norm f of
wenzelm@5819
   509
            Abs (_, _, body) => normh (subst_bound (t, body))
wenzelm@5819
   510
          | nf => nf $ (norm t handle SAME => t)) handle SAME => f $ norm t)
wenzelm@5819
   511
      | norm _ =  raise SAME
wenzelm@5819
   512
    and normh t = norm t handle SAME => t
wenzelm@5819
   513
  in normh end;
wenzelm@5819
   514
wenzelm@5819
   515
wenzelm@6550
   516
(* dummy patterns *)
wenzelm@6550
   517
wenzelm@9540
   518
fun prepare_dummies t = #2 (Term.replace_dummy_patterns (1, t));
wenzelm@6762
   519
wenzelm@9540
   520
fun reject_dummies ctxt t = Term.no_dummy_patterns t
wenzelm@9540
   521
  handle TERM _ => raise CONTEXT ("Illegal dummy pattern(s) in term", ctxt);
wenzelm@6550
   522
wenzelm@6550
   523
wenzelm@5819
   524
(* read terms *)
wenzelm@5819
   525
wenzelm@10554
   526
local
wenzelm@10554
   527
skalberg@15531
   528
fun append_env e1 e2 x = (case e2 x of NONE => e1 x | some => some);
wenzelm@14720
   529
wenzelm@16031
   530
fun gen_read' read app pattern schematic
wenzelm@14720
   531
    ctxt internal more_types more_sorts more_used s =
ballarin@14174
   532
  let
wenzelm@14720
   533
    val types = append_env (def_type ctxt pattern) more_types;
wenzelm@14720
   534
    val sorts = append_env (def_sort ctxt) more_sorts;
wenzelm@14720
   535
    val used = used_types ctxt @ more_used;
ballarin@14174
   536
  in
wenzelm@16458
   537
    (transform_error (read (pp ctxt) (syn_of ctxt) (theory_of ctxt) (types, sorts, used)) s
ballarin@14174
   538
      handle TERM (msg, _) => raise CONTEXT (msg, ctxt)
wenzelm@14720
   539
        | ERROR_MESSAGE msg => raise CONTEXT (msg, ctxt))
wenzelm@14720
   540
    |> app (intern_skolem ctxt internal)
wenzelm@14720
   541
    |> app (if pattern then I else norm_term ctxt schematic)
wenzelm@16031
   542
    |> app (if pattern then prepare_dummies else reject_dummies ctxt)
wenzelm@14720
   543
  end;
wenzelm@14720
   544
wenzelm@16031
   545
fun gen_read read app pattern schematic ctxt =
wenzelm@16031
   546
  gen_read' read app pattern schematic ctxt (K false) (K NONE) (K NONE) [];
wenzelm@14720
   547
wenzelm@10554
   548
in
wenzelm@10554
   549
wenzelm@16031
   550
val read_termTs           = gen_read' (read_def_termTs false) (apfst o map) false false;
wenzelm@16031
   551
val read_termTs_schematic = gen_read' (read_def_termTs false) (apfst o map) false true;
wenzelm@8096
   552
wenzelm@14720
   553
fun read_term_pats T ctxt =
wenzelm@16031
   554
  #1 o gen_read (read_def_termTs false) (apfst o map) true false ctxt o map (rpair T);
wenzelm@8096
   555
val read_prop_pats = read_term_pats propT;
wenzelm@8096
   556
wenzelm@14720
   557
fun read_term_liberal ctxt =
wenzelm@16458
   558
  gen_read' (read_term_thy true) I false false ctxt (K true) (K NONE) (K NONE) [];
wenzelm@14720
   559
wenzelm@16458
   560
val read_term              = gen_read (read_term_thy true) I false false;
wenzelm@16458
   561
val read_prop              = gen_read (read_prop_thy true) I false false;
wenzelm@16458
   562
val read_prop_schematic    = gen_read (read_prop_thy true) I false true;
wenzelm@16458
   563
val read_terms             = gen_read (read_terms_thy true) map false false;
wenzelm@16458
   564
fun read_props schematic   = gen_read (read_props_thy true) map false schematic;
wenzelm@5819
   565
wenzelm@10554
   566
end;
wenzelm@10554
   567
wenzelm@5819
   568
wenzelm@5819
   569
(* certify terms *)
wenzelm@5819
   570
wenzelm@10554
   571
local
wenzelm@10554
   572
wenzelm@14720
   573
fun gen_cert cert pattern schematic ctxt t = t
wenzelm@14720
   574
  |> (if pattern then I else norm_term ctxt schematic)
wenzelm@16458
   575
  |> (fn t' => cert (pp ctxt) (theory_of ctxt) t'
wenzelm@16501
   576
    handle TYPE (msg, _, _) => raise CONTEXT (msg, ctxt)
wenzelm@16501
   577
      | TERM (msg, _) => raise CONTEXT (msg, ctxt));
wenzelm@16501
   578
wenzelm@16501
   579
val certify_term = #1 ooo Sign.certify_term;
wenzelm@16501
   580
val certify_prop = #1 ooo Sign.certify_prop;
wenzelm@5819
   581
wenzelm@10554
   582
in
wenzelm@8096
   583
wenzelm@16501
   584
val cert_term = gen_cert certify_term false false;
wenzelm@16501
   585
val cert_prop = gen_cert certify_prop false false;
wenzelm@16501
   586
val cert_props = map oo gen_cert certify_prop false;
wenzelm@10554
   587
wenzelm@16501
   588
fun cert_term_pats _ = map o gen_cert certify_term true false;
wenzelm@16501
   589
val cert_prop_pats = map o gen_cert certify_prop true false;
wenzelm@10554
   590
wenzelm@10554
   591
end;
wenzelm@5819
   592
wenzelm@5819
   593
wenzelm@5819
   594
(* declare terms *)
wenzelm@5819
   595
wenzelm@10381
   596
local
wenzelm@10381
   597
wenzelm@16861
   598
val ins_types = fold_aterms
wenzelm@16861
   599
  (fn Free (x, T) => curry Vartab.update ((x, ~1), T)
wenzelm@16861
   600
    | Var v => curry Vartab.update v
wenzelm@16861
   601
    | _ => I);
wenzelm@5819
   602
wenzelm@16861
   603
val ins_sorts = fold_types (fold_atyps
wenzelm@16861
   604
  (fn TFree (x, S) => curry Vartab.update ((x, ~1), S)
wenzelm@16861
   605
    | TVar v => curry Vartab.update v
wenzelm@16861
   606
    | _ => I));
wenzelm@5819
   607
wenzelm@16861
   608
val ins_used = fold_term_types (fn t =>
wenzelm@16861
   609
  fold_atyps (fn TFree (x, _) => insert (op =) x | _ => I));
wenzelm@12291
   610
wenzelm@16861
   611
val ins_occs = fold_term_types (fn t =>
wenzelm@16861
   612
  fold_atyps (fn TFree (x, _) => curry Symtab.update_multi (x, t) | _ => I));
wenzelm@5819
   613
wenzelm@16861
   614
fun ins_skolem def_ty = fold_rev (fn (x, x') =>
wenzelm@16861
   615
  (case def_ty x' of
wenzelm@16861
   616
    SOME T => curry Vartab.update ((x, ~1), T)
wenzelm@16861
   617
  | NONE => I));
wenzelm@5994
   618
wenzelm@16540
   619
fun map_defaults f = map_context (fn (syntax, asms, binds, thms, cases, defs) =>
wenzelm@16540
   620
  (syntax, asms, binds, thms, cases, f defs));
wenzelm@5819
   621
wenzelm@16031
   622
in
wenzelm@16031
   623
wenzelm@16031
   624
fun declare_term_syntax t ctxt =
wenzelm@5819
   625
  ctxt
wenzelm@16861
   626
  |> map_defaults (fn (types, sorts, used, occ) => (ins_types t types, sorts, used, occ))
wenzelm@16861
   627
  |> map_defaults (fn (types, sorts, used, occ) => (types, ins_sorts t sorts, used, occ))
wenzelm@16861
   628
  |> map_defaults (fn (types, sorts, used, occ) => (types, sorts, ins_used t used, occ));
wenzelm@10381
   629
wenzelm@16540
   630
fun declare_term t ctxt =
wenzelm@16031
   631
  ctxt
wenzelm@16031
   632
  |> declare_term_syntax t
wenzelm@16861
   633
  |> map_defaults (fn (types, sorts, used, occ) => (types, sorts, used, ins_occs t occ))
wenzelm@12291
   634
  |> map_defaults (fn (types, sorts, used, occ) =>
wenzelm@16861
   635
      (ins_skolem (fn x => Vartab.lookup (types, (x, ~1))) (fixes_of ctxt) types,
wenzelm@16861
   636
        sorts, used, occ));
wenzelm@5819
   637
wenzelm@10381
   638
end;
wenzelm@5819
   639
wenzelm@5819
   640
wenzelm@15703
   641
(* type and constant names *)
wenzelm@15703
   642
wenzelm@15703
   643
fun read_tyname ctxt c =
wenzelm@15703
   644
  if c mem_string used_types ctxt then
wenzelm@16458
   645
    TFree (c, if_none (def_sort ctxt (c, ~1)) (Sign.defaultS (theory_of ctxt)))
wenzelm@16458
   646
  else Sign.read_tyname (theory_of ctxt) c;
wenzelm@15703
   647
wenzelm@15703
   648
fun read_const ctxt c =
wenzelm@15703
   649
  (case lookup_skolem ctxt c of
wenzelm@15703
   650
    SOME c' => Free (c', dummyT)
wenzelm@16458
   651
  | NONE => Sign.read_const (theory_of ctxt) c);
wenzelm@15703
   652
wenzelm@15703
   653
wenzelm@8616
   654
wenzelm@8616
   655
(** Hindley-Milner polymorphism **)
wenzelm@8616
   656
wenzelm@7925
   657
(* warn_extra_tfrees *)
wenzelm@7925
   658
wenzelm@16540
   659
fun warn_extra_tfrees ctxt1 ctxt2 =
wenzelm@12130
   660
  let
wenzelm@12130
   661
    fun known_tfree a (Type (_, Ts)) = exists (known_tfree a) Ts
wenzelm@12130
   662
      | known_tfree a (TFree (a', _)) = a = a'
wenzelm@12130
   663
      | known_tfree _ _ = false;
wenzelm@8616
   664
wenzelm@12130
   665
    val extras =
wenzelm@16540
   666
      Library.gen_rems Library.eq_fst (pairself (Symtab.dest o type_occs_of) (ctxt1, ctxt2))
wenzelm@16031
   667
      |> map (fn (a, ts) => map (pair a) (List.mapPartial (try (#1 o Term.dest_Free)) ts))
wenzelm@16031
   668
      |> List.concat
skalberg@15570
   669
      |> List.mapPartial (fn (a, x) =>
skalberg@15531
   670
          (case def_type ctxt1 false (x, ~1) of NONE => SOME (a, x)
skalberg@15531
   671
          | SOME T => if known_tfree a T then NONE else SOME (a, x)));
wenzelm@12130
   672
    val tfrees = map #1 extras |> Library.sort_strings |> Library.unique_strings;
wenzelm@12130
   673
    val frees = map #2 extras |> Library.sort_strings |> Library.unique_strings;
wenzelm@12130
   674
  in
wenzelm@12130
   675
    if null extras then ()
wenzelm@12130
   676
    else warning ("Just introduced free type variable(s): " ^ commas tfrees ^ " in " ^
wenzelm@12130
   677
      space_implode " or " frees);
wenzelm@12130
   678
    ctxt2
wenzelm@12130
   679
  end;
wenzelm@8616
   680
wenzelm@8616
   681
wenzelm@8616
   682
(* generalize type variables *)
wenzelm@8616
   683
wenzelm@12550
   684
fun generalize_tfrees inner outer =
wenzelm@8616
   685
  let
wenzelm@12057
   686
    val extra_fixes = fixed_names_of inner \\ fixed_names_of outer;
wenzelm@8616
   687
    fun still_fixed (Free (x, _)) = not (x mem_string extra_fixes)
wenzelm@8616
   688
      | still_fixed _ = false;
wenzelm@16540
   689
    val occs_inner = type_occs_of inner;
wenzelm@16540
   690
    val occs_outer = type_occs_of outer;
wenzelm@16031
   691
    fun add a gen =
wenzelm@16894
   692
      if Symtab.defined occs_outer a orelse
wenzelm@12550
   693
        exists still_fixed (Symtab.lookup_multi (occs_inner, a))
wenzelm@8616
   694
      then gen else a :: gen;
wenzelm@16031
   695
  in fn tfrees => fold add tfrees [] end;
wenzelm@8616
   696
wenzelm@12550
   697
fun generalize inner outer ts =
wenzelm@8616
   698
  let
skalberg@15574
   699
    val tfrees = generalize_tfrees inner outer (foldr Term.add_term_tfree_names [] ts);
wenzelm@8616
   700
    fun gen (x, S) = if x mem_string tfrees then TVar ((x, 0), S) else TFree (x, S);
wenzelm@12550
   701
  in map (Term.map_term_types (Term.map_type_tfree gen)) ts end;
wenzelm@8616
   702
wenzelm@8616
   703
wenzelm@9553
   704
wenzelm@9553
   705
(** export theorems **)
wenzelm@8616
   706
wenzelm@16861
   707
fun get_free x (t as Free (y, _)) NONE = if x = y then SOME t else NONE
wenzelm@16861
   708
  | get_free _ _ opt = opt;
haftmann@16790
   709
wenzelm@16861
   710
fun find_free t x = fold_aterms (get_free x) t NONE;
wenzelm@8616
   711
wenzelm@13415
   712
fun export_view view is_goal inner outer =
wenzelm@8616
   713
  let
wenzelm@12550
   714
    val gen = generalize_tfrees inner outer;
wenzelm@12057
   715
    val fixes = fixed_names_of inner \\ fixed_names_of outer;
wenzelm@12057
   716
    val asms = Library.drop (length (assumptions_of outer), assumptions_of inner);
wenzelm@11816
   717
    val exp_asms = map (fn (cprops, exp) => exp is_goal cprops) asms;
wenzelm@16948
   718
  in
wenzelm@16948
   719
    Tactic.norm_hhf_rule
wenzelm@16948
   720
    #> Seq.EVERY (rev exp_asms)
wenzelm@16948
   721
    #> Seq.map (Drule.implies_intr_list view)
wenzelm@16948
   722
    #> Seq.map (fn rule =>
wenzelm@11816
   723
      let
wenzelm@16992
   724
        val thy = Thm.theory_of_thm rule;
wenzelm@16992
   725
        val prop = Thm.full_prop_of rule;
wenzelm@16458
   726
        val frees = map (Thm.cterm_of thy) (List.mapPartial (find_free prop) fixes);
wenzelm@12550
   727
        val tfrees = gen (Term.add_term_tfree_names (prop, []));
wenzelm@11816
   728
      in
wenzelm@11816
   729
        rule
wenzelm@11816
   730
        |> Drule.forall_intr_list frees
wenzelm@12804
   731
        |> Tactic.norm_hhf_rule
wenzelm@12504
   732
        |> (#1 o Drule.tvars_intr_list tfrees)
wenzelm@11816
   733
      end)
wenzelm@11816
   734
  end;
wenzelm@8616
   735
wenzelm@15758
   736
(*without varification*)
ballarin@15696
   737
fun export_view' view is_goal inner outer =
ballarin@15696
   738
  let
ballarin@15696
   739
    val asms = Library.drop (length (assumptions_of outer), assumptions_of inner);
ballarin@15696
   740
    val exp_asms = map (fn (cprops, exp) => exp is_goal cprops) asms;
wenzelm@16948
   741
  in
wenzelm@16948
   742
    Tactic.norm_hhf_plain
wenzelm@16948
   743
    #> Seq.EVERY (rev exp_asms)
wenzelm@16948
   744
    #> Seq.map (Drule.implies_intr_list view)
wenzelm@16948
   745
    #> Seq.map Tactic.norm_hhf_plain
ballarin@15696
   746
  end;
ballarin@15696
   747
wenzelm@13415
   748
val export = export_view [];
wenzelm@13399
   749
ballarin@15696
   750
fun gen_export_std exp_view view inner outer =
ballarin@15696
   751
  let val exp = exp_view view false inner outer in
wenzelm@13378
   752
    fn th =>
wenzelm@13378
   753
      (case Seq.pull (exp th) of
skalberg@15531
   754
        SOME (th', _) => th' |> Drule.local_standard
wenzelm@16850
   755
      | NONE => sys_error "Failed to export theorem")
wenzelm@13378
   756
  end;
wenzelm@12704
   757
ballarin@15696
   758
val export_standard = gen_export_std export_view;
ballarin@15696
   759
val export_plain = gen_export_std export_view';
wenzelm@7925
   760
wenzelm@5819
   761
wenzelm@15758
   762
wenzelm@5819
   763
(** bindings **)
wenzelm@5819
   764
wenzelm@15758
   765
(* delete_update_binds *)
wenzelm@15758
   766
wenzelm@15758
   767
local
wenzelm@5819
   768
wenzelm@16540
   769
fun del_bind xi = map_context (fn (syntax, asms, binds, thms, cases, defs) =>
wenzelm@16540
   770
  (syntax, asms, Vartab.delete_safe xi binds, thms, cases, defs));
wenzelm@7606
   771
wenzelm@15758
   772
fun upd_bind ((x, i), t) =
wenzelm@8616
   773
  let
wenzelm@8616
   774
    val T = Term.fastype_of t;
wenzelm@8616
   775
    val t' =
wenzelm@8616
   776
      if null (Term.term_tvars t \\ Term.typ_tvars T) then t
wenzelm@8637
   777
      else Var ((x ^ "_has_extra_type_vars_on_rhs", i), T);
wenzelm@8616
   778
  in
wenzelm@16540
   779
    map_context (fn (syntax, asms, binds, thms, cases, defs) =>
wenzelm@16540
   780
      (syntax, asms, Vartab.update (((x, i), (t', T)), binds), thms, cases, defs))
wenzelm@15758
   781
    o declare_term t'
wenzelm@5819
   782
  end;
wenzelm@5819
   783
wenzelm@15758
   784
fun del_upd_bind (xi, NONE) = del_bind xi
wenzelm@15758
   785
  | del_upd_bind (xi, SOME t) = upd_bind (xi, t);
wenzelm@7606
   786
wenzelm@15758
   787
in
wenzelm@15758
   788
wenzelm@15758
   789
val delete_update_binds = fold del_upd_bind;
wenzelm@15758
   790
wenzelm@15758
   791
end;
wenzelm@7606
   792
wenzelm@5819
   793
wenzelm@8096
   794
(* simult_matches *)
wenzelm@8096
   795
wenzelm@8616
   796
fun simult_matches ctxt [] = []
wenzelm@8616
   797
  | simult_matches ctxt pairs =
wenzelm@8096
   798
      let
wenzelm@10554
   799
        fun fail () = raise CONTEXT ("Pattern match failed!", ctxt);
wenzelm@10554
   800
wenzelm@16031
   801
        val maxidx = fold (fn (t1, t2) => fn i =>
wenzelm@16031
   802
          Int.max (Int.max (Term.maxidx_of_term t1, Term.maxidx_of_term t2), i)) pairs ~1;
wenzelm@16458
   803
        val envs = Unify.smash_unifiers (theory_of ctxt, Envir.empty maxidx,
wenzelm@10554
   804
          map swap pairs);    (*prefer assignment of variables from patterns*)
wenzelm@10554
   805
        val env =
wenzelm@8096
   806
          (case Seq.pull envs of
skalberg@15531
   807
            NONE => fail ()
skalberg@15531
   808
          | SOME (env, _) => env);    (*ignore further results*)
wenzelm@12309
   809
        val domain =
wenzelm@12309
   810
          filter_out Term.is_replaced_dummy_pattern (map #1 (Drule.vars_of_terms (map #1 pairs)));
wenzelm@10554
   811
        val _ =    (*may not assign variables from text*)
wenzelm@12309
   812
          if null (map #1 (Envir.alist_of env) inter (map #1 (Drule.vars_of_terms (map #2 pairs))))
wenzelm@12309
   813
          then () else fail ();
wenzelm@16948
   814
        fun norm_bind (xi, (_, t)) =
wenzelm@16948
   815
          if mem_ix (xi, domain) then SOME (xi, Envir.norm_term env t) else NONE;
skalberg@15570
   816
      in List.mapPartial norm_bind (Envir.alist_of env) end;
wenzelm@8096
   817
wenzelm@8096
   818
wenzelm@8096
   819
(* add_binds(_i) *)
wenzelm@5819
   820
wenzelm@7925
   821
local
wenzelm@7925
   822
wenzelm@16031
   823
fun gen_bind prep (xi as (x, _), raw_t) ctxt =
skalberg@15570
   824
  ctxt |> delete_update_binds [(xi, Option.map (prep ctxt) raw_t)];
wenzelm@5819
   825
wenzelm@10810
   826
in
wenzelm@10810
   827
skalberg@15531
   828
fun drop_schematic (b as (xi, SOME t)) = if null (Term.term_vars t) then b else (xi, NONE)
wenzelm@10554
   829
  | drop_schematic b = b;
wenzelm@10554
   830
wenzelm@16031
   831
val add_binds = fold (gen_bind read_term);
wenzelm@16031
   832
val add_binds_i = fold (gen_bind cert_term);
wenzelm@8616
   833
wenzelm@16458
   834
fun auto_bind f ts ctxt = ctxt |> add_binds_i (map drop_schematic (f (theory_of ctxt) ts));
wenzelm@12147
   835
val auto_bind_goal = auto_bind AutoBind.goal;
wenzelm@12147
   836
val auto_bind_facts = auto_bind AutoBind.facts;
wenzelm@7925
   837
wenzelm@7925
   838
end;
wenzelm@5819
   839
wenzelm@5819
   840
wenzelm@8096
   841
(* match_bind(_i) *)
wenzelm@5819
   842
wenzelm@8096
   843
local
wenzelm@8096
   844
wenzelm@10465
   845
fun prep_bind prep_pats (ctxt, (raw_pats, t)) =
wenzelm@5819
   846
  let
wenzelm@8096
   847
    val ctxt' = declare_term t ctxt;
wenzelm@8096
   848
    val pats = prep_pats (fastype_of t) ctxt' raw_pats;
wenzelm@8616
   849
    val binds = simult_matches ctxt' (map (rpair t) pats);
wenzelm@8616
   850
  in (ctxt', binds) end;
wenzelm@7670
   851
wenzelm@10465
   852
fun gen_binds prep_terms prep_pats gen raw_binds ctxt =
wenzelm@8616
   853
  let
wenzelm@10465
   854
    val ts = prep_terms ctxt (map snd raw_binds);
wenzelm@10465
   855
    val (ctxt', binds) =
skalberg@15570
   856
      apsnd List.concat (foldl_map (prep_bind prep_pats) (ctxt, map fst raw_binds ~~ ts));
wenzelm@8616
   857
    val binds' =
wenzelm@12550
   858
      if gen then map #1 binds ~~ generalize ctxt' ctxt (map #2 binds)
wenzelm@8616
   859
      else binds;
skalberg@15531
   860
    val binds'' = map (apsnd SOME) binds';
wenzelm@8616
   861
  in
wenzelm@8616
   862
    warn_extra_tfrees ctxt
wenzelm@16031
   863
     (if gen then
wenzelm@16031
   864
        ctxt (*sic!*) |> fold declare_term (map #2 binds') |> add_binds_i binds''
wenzelm@8616
   865
      else ctxt' |> add_binds_i binds'')
wenzelm@8616
   866
  end;
wenzelm@8096
   867
wenzelm@8096
   868
in
wenzelm@5935
   869
wenzelm@10465
   870
val match_bind = gen_binds read_terms read_term_pats;
wenzelm@10465
   871
val match_bind_i = gen_binds (map o cert_term) cert_term_pats;
wenzelm@8096
   872
wenzelm@8096
   873
end;
wenzelm@5935
   874
wenzelm@5935
   875
wenzelm@10465
   876
(* propositions with patterns *)
wenzelm@5935
   877
wenzelm@10465
   878
local
wenzelm@8096
   879
wenzelm@10554
   880
fun prep_propp schematic prep_props prep_pats (context, args) =
wenzelm@10465
   881
  let
wenzelm@10465
   882
    fun prep ((ctxt, prop :: props), (_, (raw_pats1, raw_pats2))) =
wenzelm@10465
   883
          let
wenzelm@10465
   884
            val ctxt' = declare_term prop ctxt;
wenzelm@10465
   885
            val pats = prep_pats ctxt' (raw_pats1 @ raw_pats2);    (*simultaneous type inference!*)
nipkow@13629
   886
          in ((ctxt', props), (prop, splitAt(length raw_pats1, pats))) end
wenzelm@10465
   887
      | prep _ = sys_error "prep_propp";
wenzelm@10465
   888
    val ((context', _), propp) = foldl_map (foldl_map prep)
skalberg@15570
   889
        ((context, prep_props schematic context (List.concat (map (map fst) args))), args);
wenzelm@10465
   890
  in (context', propp) end;
wenzelm@5935
   891
wenzelm@10465
   892
fun matches ctxt (prop, (pats1, pats2)) =
wenzelm@10465
   893
  simult_matches ctxt (map (rpair prop) pats1 @ map (rpair (Logic.strip_imp_concl prop)) pats2);
wenzelm@8096
   894
wenzelm@10465
   895
fun gen_bind_propp prepp (ctxt, raw_args) =
wenzelm@8096
   896
  let
wenzelm@10465
   897
    val (ctxt', args) = prepp (ctxt, raw_args);
skalberg@15570
   898
    val binds = List.concat (List.concat (map (map (matches ctxt')) args));
wenzelm@10465
   899
    val propss = map (map #1) args;
wenzelm@8616
   900
wenzelm@10554
   901
    (*generalize result: context evaluated now, binds added later*)
wenzelm@8616
   902
    val gen = generalize ctxt' ctxt;
skalberg@15531
   903
    fun gen_binds c = c |> add_binds_i (map #1 binds ~~ map SOME (gen (map #2 binds)));
skalberg@15531
   904
  in (ctxt' |> add_binds_i (map (apsnd SOME) binds), (propss, gen_binds)) end;
wenzelm@8096
   905
wenzelm@10465
   906
in
wenzelm@10465
   907
wenzelm@11925
   908
val read_propp = prep_propp false read_props read_prop_pats;
wenzelm@11925
   909
val cert_propp = prep_propp false cert_props cert_prop_pats;
wenzelm@10554
   910
val read_propp_schematic = prep_propp true read_props read_prop_pats;
wenzelm@10554
   911
val cert_propp_schematic = prep_propp true cert_props cert_prop_pats;
wenzelm@10554
   912
wenzelm@11925
   913
val bind_propp = gen_bind_propp read_propp;
wenzelm@11925
   914
val bind_propp_i = gen_bind_propp cert_propp;
wenzelm@11925
   915
val bind_propp_schematic = gen_bind_propp read_propp_schematic;
wenzelm@10554
   916
val bind_propp_schematic_i = gen_bind_propp cert_propp_schematic;
wenzelm@6789
   917
wenzelm@10465
   918
end;
wenzelm@10465
   919
wenzelm@6789
   920
wenzelm@5819
   921
wenzelm@5819
   922
(** theorems **)
wenzelm@5819
   923
wenzelm@6091
   924
(* get_thm(s) *)
wenzelm@5819
   925
wenzelm@9566
   926
(*beware of proper order of evaluation!*)
wenzelm@16540
   927
fun retrieve_thms from_thy pick ctxt =
wenzelm@16540
   928
  let
wenzelm@16540
   929
    val thy_ref = Theory.self_ref (theory_of ctxt);
wenzelm@16540
   930
    val (_, (space, tab), _) = thms_of ctxt;
wenzelm@16540
   931
  in
wenzelm@16501
   932
    fn xthmref =>
wenzelm@16501
   933
      let
wenzelm@16540
   934
        val thy = Theory.deref thy_ref;
wenzelm@16501
   935
        val thmref = PureThy.map_name_of_thmref (NameSpace.intern space) xthmref;
wenzelm@16501
   936
        val name = PureThy.name_of_thmref thmref;
wenzelm@16501
   937
      in
wenzelm@16501
   938
        (case Symtab.lookup (tab, name) of
wenzelm@16540
   939
          SOME ths => map (Thm.transfer thy) (PureThy.select_thm thmref ths)
wenzelm@16540
   940
        | NONE => from_thy thy xthmref) |> pick name
wenzelm@16501
   941
      end
wenzelm@9566
   942
  end;
wenzelm@5819
   943
wenzelm@9566
   944
val get_thm = retrieve_thms PureThy.get_thms PureThy.single_thm;
wenzelm@9566
   945
val get_thm_closure = retrieve_thms PureThy.get_thms_closure PureThy.single_thm;
wenzelm@9566
   946
val get_thms = retrieve_thms PureThy.get_thms (K I);
wenzelm@9566
   947
val get_thms_closure = retrieve_thms PureThy.get_thms_closure (K I);
wenzelm@5819
   948
wenzelm@5819
   949
wenzelm@16031
   950
(* valid_thms *)
wenzelm@16031
   951
wenzelm@16031
   952
fun valid_thms ctxt (name, ths) =
wenzelm@16501
   953
  (case try (transform_error (fn () => get_thms ctxt (Name name))) () of
wenzelm@16031
   954
    NONE => false
wenzelm@16147
   955
  | SOME ths' => Thm.eq_thms (ths, ths'));
wenzelm@16031
   956
wenzelm@16031
   957
wenzelm@16031
   958
(* lthms_containing *)
wenzelm@16031
   959
wenzelm@16031
   960
fun lthms_containing ctxt spec =
wenzelm@16031
   961
  FactIndex.find (fact_index_of ctxt) spec
wenzelm@16031
   962
  |> List.filter (valid_thms ctxt)
wenzelm@16031
   963
  |> gen_distinct eq_fst;
wenzelm@16031
   964
wenzelm@16031
   965
wenzelm@13425
   966
(* name space operations *)
wenzelm@12309
   967
wenzelm@16540
   968
val extern_thm = NameSpace.extern o #1 o #2 o thms_of;
wenzelm@12309
   969
wenzelm@16540
   970
fun map_naming f = map_context (fn (syntax, asms, binds,
wenzelm@16348
   971
    (naming, table, index), cases, defs) =>
wenzelm@16540
   972
  (syntax, asms, binds, (f naming, table, index), cases, defs));
wenzelm@12309
   973
wenzelm@16147
   974
val qualified_names = map_naming NameSpace.qualified_names;
wenzelm@16147
   975
val no_base_names = map_naming NameSpace.no_base_names;
wenzelm@16147
   976
val custom_accesses = map_naming o NameSpace.custom_accesses;
wenzelm@16540
   977
val restore_naming = map_naming o K o #1 o thms_of;
wenzelm@12309
   978
wenzelm@16348
   979
fun hide_thms fully names = map_context
wenzelm@16540
   980
  (fn (syntax, asms, binds, (naming, (space, tab), index), cases, defs) =>
wenzelm@16540
   981
    (syntax, asms, binds,
wenzelm@16348
   982
      (naming, (fold (NameSpace.hide fully) names space, tab), index), cases, defs));
wenzelm@13425
   983
wenzelm@12309
   984
wenzelm@6091
   985
(* put_thm(s) *)
wenzelm@5819
   986
wenzelm@16147
   987
fun put_thms ("", _) ctxt = ctxt
wenzelm@16147
   988
  | put_thms (bname, ths) ctxt = ctxt |> map_context
wenzelm@16540
   989
      (fn (syntax, asms, binds, (naming, (space, tab), index), cases, defs) =>
wenzelm@16147
   990
        let
wenzelm@16147
   991
          val name = NameSpace.full naming bname;
wenzelm@16147
   992
          val space' = NameSpace.declare naming name space;
wenzelm@16147
   993
          val tab' = Symtab.update ((name, ths), tab);
wenzelm@16147
   994
          val index' = FactIndex.add (is_known ctxt) (name, ths) index;
wenzelm@16540
   995
        in (syntax, asms, binds, (naming, (space', tab'), index'), cases, defs) end);
wenzelm@5819
   996
wenzelm@16147
   997
fun put_thm (name, th) = put_thms (name, [th]);
wenzelm@16147
   998
val put_thmss = fold put_thms;
wenzelm@5819
   999
wenzelm@15758
  1000
wenzelm@7606
  1001
(* reset_thms *)
wenzelm@7606
  1002
wenzelm@17072
  1003
fun reset_thms name =
wenzelm@16540
  1004
  map_context (fn (syntax, asms, binds, (q, (space, tab), index), cases, defs) =>
wenzelm@16540
  1005
    (syntax, asms, binds, (q, (space, Symtab.delete_safe name tab), index), cases, defs));
wenzelm@7606
  1006
wenzelm@7606
  1007
wenzelm@14564
  1008
(* note_thmss *)
wenzelm@5819
  1009
wenzelm@12711
  1010
local
wenzelm@16147
  1011
wenzelm@16147
  1012
fun gen_note_thss get (ctxt, ((name, more_attrs), ths_attrs)) =
wenzelm@5819
  1013
  let
wenzelm@5819
  1014
    fun app ((ct, ths), (th, attrs)) =
wenzelm@12711
  1015
      let val (ct', th') = Thm.applys_attributes ((ct, get ctxt th), attrs @ more_attrs)
wenzelm@12711
  1016
      in (ct', th' :: ths) end;
skalberg@15570
  1017
    val (ctxt', rev_thms) = Library.foldl app ((ctxt, []), ths_attrs);
skalberg@15570
  1018
    val thms = List.concat (rev rev_thms);
wenzelm@16147
  1019
  in (ctxt' |> put_thms (name, thms), (name, thms)) end;
wenzelm@5819
  1020
wenzelm@16147
  1021
fun gen_note_thmss get args ctxt =
wenzelm@16147
  1022
  foldl_map (gen_note_thss get) (ctxt, args);
wenzelm@12711
  1023
wenzelm@12711
  1024
in
wenzelm@12711
  1025
wenzelm@16147
  1026
val note_thmss = gen_note_thmss get_thms;
wenzelm@16147
  1027
val note_thmss_i = gen_note_thmss (K I);
ballarin@15696
  1028
ballarin@15696
  1029
val note_thmss_accesses = gen_note_thmss get_thms;
ballarin@15696
  1030
val note_thmss_accesses_i = gen_note_thmss (K I);
wenzelm@12711
  1031
wenzelm@12711
  1032
end;
wenzelm@9196
  1033
wenzelm@5819
  1034
wenzelm@5819
  1035
wenzelm@5819
  1036
(** assumptions **)
wenzelm@5819
  1037
wenzelm@11918
  1038
(* basic exporters *)
wenzelm@11918
  1039
wenzelm@11918
  1040
fun export_assume true = Seq.single oo Drule.implies_intr_goals
wenzelm@11918
  1041
  | export_assume false = Seq.single oo Drule.implies_intr_list;
wenzelm@11918
  1042
wenzelm@11918
  1043
fun export_presume _ = export_assume false;
wenzelm@11918
  1044
wenzelm@11918
  1045
wenzelm@12057
  1046
(* defs *)
wenzelm@12057
  1047
wenzelm@12066
  1048
fun cert_def ctxt eq =
wenzelm@12016
  1049
  let
wenzelm@12057
  1050
    fun err msg = raise CONTEXT (msg ^
wenzelm@12057
  1051
      "\nThe error(s) above occurred in local definition: " ^ string_of_term ctxt eq, ctxt);
wenzelm@12057
  1052
    val (lhs, rhs) = Logic.dest_equals (Term.strip_all_body eq)
wenzelm@12057
  1053
      handle TERM _ => err "Not a meta-equality (==)";
wenzelm@12086
  1054
    val (f, xs) = Term.strip_comb lhs;
wenzelm@12086
  1055
    val (c, _) = Term.dest_Free f handle TERM _ =>
wenzelm@13430
  1056
      err "Head of lhs must be a free/fixed variable";
wenzelm@12057
  1057
wenzelm@12086
  1058
    fun is_free (Free (x, _)) = not (is_fixed ctxt x)
wenzelm@12086
  1059
      | is_free _ = false;
skalberg@15570
  1060
    val extra_frees = List.filter is_free (term_frees rhs) \\ xs;
wenzelm@12016
  1061
  in
wenzelm@12086
  1062
    conditional (not (forall (is_Bound orf is_free) xs andalso null (duplicates xs))) (fn () =>
wenzelm@13430
  1063
      err "Arguments of lhs must be distinct free/bound variables");
wenzelm@12086
  1064
    conditional (f mem Term.term_frees rhs) (fn () =>
wenzelm@12086
  1065
      err "Element to be defined occurs on rhs");
wenzelm@12086
  1066
    conditional (not (null extra_frees)) (fn () =>
wenzelm@12086
  1067
      err ("Extra free variables on rhs: " ^ commas_quote (map (#1 o dest_Free) extra_frees)));
skalberg@15570
  1068
    (c, Term.list_all_free (List.mapPartial (try Term.dest_Free) xs, eq))
wenzelm@12057
  1069
  end;
wenzelm@12057
  1070
wenzelm@12057
  1071
fun head_of_def cprop =
wenzelm@12057
  1072
  #1 (Term.strip_comb (#1 (Logic.dest_equals (Term.strip_all_body (Thm.term_of cprop)))))
wenzelm@16458
  1073
  |> Thm.cterm_of (Thm.theory_of_cterm cprop);
wenzelm@11918
  1074
wenzelm@11918
  1075
fun export_def _ cprops thm =
wenzelm@11918
  1076
  thm
wenzelm@11918
  1077
  |> Drule.implies_intr_list cprops
wenzelm@12057
  1078
  |> Drule.forall_intr_list (map head_of_def cprops)
wenzelm@11918
  1079
  |> Drule.forall_elim_vars 0
wenzelm@11918
  1080
  |> RANGE (replicate (length cprops) (Tactic.rtac Drule.reflexive_thm)) 1;
wenzelm@11918
  1081
wenzelm@11918
  1082
wenzelm@5819
  1083
(* assume *)
wenzelm@5819
  1084
wenzelm@7270
  1085
local
wenzelm@6797
  1086
wenzelm@10465
  1087
fun add_assm (ctxt, ((name, attrs), props)) =
wenzelm@5819
  1088
  let
wenzelm@16458
  1089
    val cprops = map (Thm.cterm_of (theory_of ctxt)) props;
wenzelm@12804
  1090
    val asms = map (Tactic.norm_hhf_rule o Thm.assume) cprops;
wenzelm@5919
  1091
wenzelm@5919
  1092
    val ths = map (fn th => ([th], [])) asms;
wenzelm@10465
  1093
    val (ctxt', [(_, thms)]) =
wenzelm@10465
  1094
      ctxt
wenzelm@12147
  1095
      |> auto_bind_facts props
wenzelm@14564
  1096
      |> note_thmss_i [((name, attrs), ths)];
wenzelm@10465
  1097
  in (ctxt', (cprops, (name, asms), (name, thms))) end;
wenzelm@5819
  1098
wenzelm@9470
  1099
fun gen_assms prepp exp args ctxt =
wenzelm@9470
  1100
  let
wenzelm@10465
  1101
    val (ctxt1, propss) = prepp (ctxt, map snd args);
wenzelm@10465
  1102
    val (ctxt2, results) = foldl_map add_assm (ctxt1, map fst args ~~ propss);
wenzelm@10465
  1103
skalberg@15570
  1104
    val cprops = List.concat (map #1 results);
wenzelm@9470
  1105
    val asmss = map #2 results;
wenzelm@9470
  1106
    val thmss = map #3 results;
wenzelm@12072
  1107
    val ctxt3 = ctxt2 |> map_context
wenzelm@16540
  1108
      (fn (syntax, ((asms_ct, asms_th), fixes), binds, thms, cases, defs) =>
wenzelm@16540
  1109
        (syntax, ((asms_ct @ [(cprops, exp)], asms_th @ asmss), fixes), binds, thms,
ballarin@15735
  1110
          cases, defs));
wenzelm@11925
  1111
    val ctxt4 = ctxt3 |> put_thms ("prems", prems_of ctxt3);
wenzelm@11925
  1112
  in (warn_extra_tfrees ctxt ctxt4, thmss) end;
wenzelm@5819
  1113
wenzelm@7270
  1114
in
wenzelm@7270
  1115
wenzelm@8616
  1116
val assume = gen_assms (apsnd #1 o bind_propp);
wenzelm@8616
  1117
val assume_i = gen_assms (apsnd #1 o bind_propp_i);
wenzelm@7270
  1118
wenzelm@7270
  1119
end;
wenzelm@5819
  1120
wenzelm@5819
  1121
wenzelm@8096
  1122
(* variables *)
wenzelm@8096
  1123
wenzelm@10381
  1124
local
wenzelm@10381
  1125
wenzelm@14720
  1126
fun prep_vars prep_typ internal liberal (ctxt, (xs, raw_T)) =
wenzelm@8096
  1127
  let
wenzelm@12504
  1128
    fun cond_tvars T =
wenzelm@12504
  1129
      if internal then T
wenzelm@12504
  1130
      else Type.no_tvars T handle TYPE (msg, _, _) => raise CONTEXT (msg, ctxt);
wenzelm@12504
  1131
wenzelm@14720
  1132
    val _ = if liberal then () else
skalberg@15570
  1133
      (case List.filter (not o Syntax.is_identifier) (map (no_skolem internal ctxt) xs) of
wenzelm@8096
  1134
      [] => () | bads => raise CONTEXT ("Bad variable name(s): " ^ commas_quote bads, ctxt));
wenzelm@8096
  1135
skalberg@15570
  1136
    val opt_T = Option.map (cond_tvars o prep_typ ctxt) raw_T;
wenzelm@15974
  1137
    val T = if_none opt_T TypeInfer.logicT;
wenzelm@16031
  1138
    val ctxt' = ctxt |> fold declare_term_syntax (map (fn x => Free (x, T)) xs);
wenzelm@8096
  1139
  in (ctxt', (xs, opt_T)) end;
wenzelm@8096
  1140
wenzelm@10381
  1141
in
wenzelm@10381
  1142
wenzelm@14720
  1143
val read_vars         = prep_vars read_typ false false;
wenzelm@14720
  1144
val cert_vars         = prep_vars cert_typ true false;
wenzelm@14720
  1145
val read_vars_liberal = prep_vars read_typ false true;
wenzelm@14720
  1146
val cert_vars_liberal = prep_vars cert_typ true true;
wenzelm@8096
  1147
wenzelm@10381
  1148
end;
wenzelm@10381
  1149
wenzelm@8096
  1150
wenzelm@5819
  1151
(* fix *)
wenzelm@5819
  1152
wenzelm@8096
  1153
local
wenzelm@8096
  1154
wenzelm@12309
  1155
fun map_fixes f =
wenzelm@16540
  1156
  map_context (fn (syntax, (assumes, fixes), binds, thms, cases, defs) =>
wenzelm@16540
  1157
    (syntax, (assumes, f fixes), binds, thms, cases, defs));
wenzelm@5819
  1158
wenzelm@11925
  1159
fun err_dups ctxt xs = raise CONTEXT ("Duplicate variable(s): " ^ commas_quote xs, ctxt);
wenzelm@11925
  1160
wenzelm@12130
  1161
val declare =
wenzelm@16031
  1162
  fold declare_term_syntax o
wenzelm@16031
  1163
  List.mapPartial (fn (_, NONE) => NONE | (x, SOME T) => SOME (Free (x, T)));
wenzelm@12130
  1164
wenzelm@12130
  1165
fun add_vars xs Ts ctxt =
wenzelm@12309
  1166
  let val xs' = Term.variantlist (map Syntax.skolem xs, map #2 (fixes_of ctxt)) in
wenzelm@12309
  1167
    ctxt
wenzelm@12309
  1168
    |> declare (xs' ~~ Ts)
wenzelm@12309
  1169
    |> map_fixes (fn fixes => (xs ~~ xs') @ fixes)
wenzelm@12130
  1170
  end;
wenzelm@11925
  1171
wenzelm@12130
  1172
fun add_vars_direct xs Ts ctxt =
wenzelm@12309
  1173
  ctxt
wenzelm@12309
  1174
  |> declare (xs ~~ Ts)
wenzelm@12309
  1175
  |> map_fixes (fn fixes =>
wenzelm@12130
  1176
    (case xs inter_string map #1 fixes of
wenzelm@12309
  1177
      [] => (xs ~~ xs) @ fixes
wenzelm@12130
  1178
    | dups => err_dups ctxt dups));
wenzelm@12130
  1179
wenzelm@11925
  1180
wenzelm@11925
  1181
fun gen_fix prep add raw_vars ctxt =
wenzelm@8096
  1182
  let
wenzelm@8096
  1183
    val (ctxt', varss) = foldl_map prep (ctxt, raw_vars);
skalberg@15570
  1184
    val vars = rev (List.concat (map (fn (xs, T) => map (rpair T) xs) varss));
wenzelm@12130
  1185
    val xs = map #1 vars;
wenzelm@12130
  1186
    val Ts = map #2 vars;
wenzelm@8096
  1187
  in
wenzelm@11925
  1188
    (case Library.duplicates xs of [] => () | dups => err_dups ctxt dups);
wenzelm@12130
  1189
    ctxt' |> add xs Ts
wenzelm@8096
  1190
  end;
wenzelm@5819
  1191
skalberg@15531
  1192
fun prep_type (x, NONE, SOME mx) = ([x], SOME (mixfix_type mx))
wenzelm@12576
  1193
  | prep_type (x, opt_T, _) = ([x], opt_T);
wenzelm@12576
  1194
wenzelm@8096
  1195
in
wenzelm@7679
  1196
wenzelm@11925
  1197
val fix = gen_fix read_vars add_vars;
wenzelm@11925
  1198
val fix_i = gen_fix cert_vars add_vars;
wenzelm@14720
  1199
wenzelm@14720
  1200
fun fix_direct liberal =
wenzelm@14720
  1201
  gen_fix (if liberal then cert_vars_liberal else cert_vars) add_vars_direct;
wenzelm@14720
  1202
wenzelm@14720
  1203
fun add_fixes decls = add_syntax decls o fix_direct false (map prep_type decls);
wenzelm@14720
  1204
fun add_fixes_liberal decls = add_syntax decls o fix_direct true (map prep_type decls);
wenzelm@8096
  1205
wenzelm@8096
  1206
end;
wenzelm@5819
  1207
wenzelm@12048
  1208
fun fix_frees ts ctxt =
wenzelm@12048
  1209
  let
wenzelm@16861
  1210
    val frees = fold Term.add_frees ts [];
skalberg@15531
  1211
    fun new (x, T) = if is_fixed ctxt x then NONE else SOME ([x], SOME T);
skalberg@15570
  1212
  in fix_direct false (rev (List.mapPartial new frees)) ctxt end;
wenzelm@12016
  1213
wenzelm@6895
  1214
wenzelm@9291
  1215
(*Note: improper use may result in variable capture / dynamic scoping!*)
wenzelm@9291
  1216
fun bind_skolem ctxt xs =
wenzelm@9291
  1217
  let
skalberg@15531
  1218
    val ctxt' = ctxt |> fix_i [(xs, NONE)];
wenzelm@9291
  1219
    fun bind (t as Free (x, T)) =
wenzelm@9291
  1220
          if x mem_string xs then
skalberg@15531
  1221
            (case lookup_skolem ctxt' x of SOME x' => Free (x', T) | NONE => t)
wenzelm@9291
  1222
          else t
wenzelm@9291
  1223
      | bind (t $ u) = bind t $ bind u
wenzelm@9291
  1224
      | bind (Abs (x, T, t)) = Abs (x, T, bind t)
wenzelm@9291
  1225
      | bind a = a;
wenzelm@9291
  1226
  in bind end;
wenzelm@9291
  1227
wenzelm@9291
  1228
wenzelm@5819
  1229
wenzelm@8373
  1230
(** cases **)
wenzelm@8373
  1231
wenzelm@16147
  1232
fun apply_case ({fixes, assumes, binds}: RuleCases.T) ctxt =
wenzelm@16147
  1233
  let
wenzelm@16147
  1234
    fun bind (c, (x, T)) = (c |> fix_i [([x], SOME T)], bind_skolem c [x] (Free (x, T)));
wenzelm@16147
  1235
    val (ctxt', xs) = foldl_map bind (ctxt, fixes);
wenzelm@16147
  1236
    fun app t = Library.foldl Term.betapply (t, xs);
wenzelm@16147
  1237
  in (ctxt', (map (apsnd (Option.map app)) binds, map (apsnd (map app)) assumes)) end;
wenzelm@16147
  1238
wenzelm@16147
  1239
local
wenzelm@16147
  1240
wenzelm@11793
  1241
fun prep_case ctxt name xs {fixes, assumes, binds} =
wenzelm@11793
  1242
  let
wenzelm@15974
  1243
    fun replace (opt_x :: xs) ((y, T) :: ys) = (if_none opt_x y, T) :: replace xs ys
wenzelm@11793
  1244
      | replace [] ys = ys
wenzelm@11793
  1245
      | replace (_ :: _) [] = raise CONTEXT ("Too many parameters for case " ^ quote name, ctxt);
wenzelm@11793
  1246
  in
skalberg@15574
  1247
    if null (foldr Term.add_typ_tvars [] (map snd fixes)) andalso
skalberg@15574
  1248
      null (foldr Term.add_term_vars [] (List.concat (map snd assumes))) then
wenzelm@11793
  1249
        {fixes = replace xs fixes, assumes = assumes, binds = map drop_schematic binds}
wenzelm@11793
  1250
    else raise CONTEXT ("Illegal schematic variable(s) in case " ^ quote name, ctxt)
wenzelm@11793
  1251
  end;
wenzelm@8403
  1252
wenzelm@16668
  1253
fun rem_case name = remove (fn (x: string, (y, _)) => x = y) name;
wenzelm@16147
  1254
wenzelm@16147
  1255
fun add_case ("", _) cases = cases
wenzelm@16147
  1256
  | add_case (name, NONE) cases = rem_case name cases
wenzelm@16147
  1257
  | add_case (name, SOME c) cases = (name, c) :: rem_case name cases;
wenzelm@16147
  1258
wenzelm@16147
  1259
in
wenzelm@16147
  1260
wenzelm@16540
  1261
fun get_case ctxt name xs =
wenzelm@17184
  1262
  (case AList.lookup (op =) (cases_of ctxt) name of
skalberg@15531
  1263
    NONE => raise CONTEXT ("Unknown case: " ^ quote name, ctxt)
skalberg@15531
  1264
  | SOME c => prep_case ctxt name xs c);
wenzelm@8373
  1265
wenzelm@16540
  1266
fun add_cases xs = map_context (fn (syntax, asms, binds, thms, cases, defs) =>
wenzelm@16540
  1267
  (syntax, asms, binds, thms, fold add_case xs cases, defs));
wenzelm@8384
  1268
wenzelm@16147
  1269
end;
wenzelm@8373
  1270
wenzelm@8373
  1271
wenzelm@8373
  1272
wenzelm@10810
  1273
(** print context information **)
wenzelm@10810
  1274
wenzelm@10810
  1275
val verbose = ref false;
wenzelm@10810
  1276
fun verb f x = if ! verbose then f (x ()) else [];
wenzelm@10810
  1277
fun verb_single x = verb Library.single x;
wenzelm@10810
  1278
wenzelm@10810
  1279
fun setmp_verbose f x = Library.setmp verbose true f x;
wenzelm@10810
  1280
wenzelm@10810
  1281
fun pretty_items prt name items =
wenzelm@10810
  1282
  let
wenzelm@10810
  1283
    fun prt_itms (name, [x]) = Pretty.block [Pretty.str (name ^ ":"), Pretty.brk 1, prt x]
wenzelm@10810
  1284
      | prt_itms (name, xs) = Pretty.big_list (name ^ ":") (map prt xs);
wenzelm@10810
  1285
  in
wenzelm@10810
  1286
    if null items andalso not (! verbose) then []
wenzelm@10810
  1287
    else [Pretty.big_list name (map prt_itms items)]
wenzelm@10810
  1288
  end;
wenzelm@10810
  1289
wenzelm@10810
  1290
wenzelm@12072
  1291
(* local syntax *)
wenzelm@12072
  1292
wenzelm@12093
  1293
val print_syntax = Syntax.print_syntax o syn_of;
wenzelm@12072
  1294
wenzelm@12072
  1295
wenzelm@10810
  1296
(* term bindings *)
wenzelm@10810
  1297
wenzelm@16540
  1298
fun pretty_binds ctxt =
wenzelm@10810
  1299
  let
wenzelm@16540
  1300
    val binds = binds_of ctxt;
wenzelm@12057
  1301
    fun prt_bind (xi, (t, T)) = pretty_term ctxt (Logic.mk_equals (Var (xi, T), t));
wenzelm@10810
  1302
  in
wenzelm@15758
  1303
    if Vartab.is_empty binds andalso not (! verbose) then []
wenzelm@15758
  1304
    else [Pretty.big_list "term bindings:" (map prt_bind (Vartab.dest binds))]
wenzelm@10810
  1305
  end;
wenzelm@10810
  1306
wenzelm@10810
  1307
val print_binds = Pretty.writeln o Pretty.chunks o pretty_binds;
wenzelm@10810
  1308
wenzelm@10810
  1309
wenzelm@10810
  1310
(* local theorems *)
wenzelm@10810
  1311
wenzelm@16540
  1312
fun pretty_lthms ctxt =
wenzelm@16540
  1313
  pretty_items (pretty_thm ctxt) "facts:" (NameSpace.extern_table (#2 (thms_of ctxt)));
wenzelm@10810
  1314
wenzelm@12057
  1315
val print_lthms = Pretty.writeln o Pretty.chunks o pretty_lthms;
wenzelm@10810
  1316
wenzelm@10810
  1317
wenzelm@10810
  1318
(* local contexts *)
wenzelm@10810
  1319
wenzelm@16540
  1320
fun pretty_cases ctxt =
wenzelm@10810
  1321
  let
wenzelm@12057
  1322
    val prt_term = pretty_term ctxt;
wenzelm@12057
  1323
wenzelm@10810
  1324
    fun prt_let (xi, t) = Pretty.block
wenzelm@10818
  1325
      [Pretty.quote (prt_term (Var (xi, Term.fastype_of t))), Pretty.str " =", Pretty.brk 1,
wenzelm@10810
  1326
        Pretty.quote (prt_term t)];
wenzelm@10810
  1327
wenzelm@13425
  1328
    fun prt_asm (a, ts) = Pretty.block (Pretty.breaks
wenzelm@13425
  1329
      ((if a = "" then [] else [Pretty.str (a ^ ":")]) @ map (Pretty.quote o prt_term) ts));
wenzelm@13425
  1330
wenzelm@10810
  1331
    fun prt_sect _ _ _ [] = []
wenzelm@10810
  1332
      | prt_sect s sep prt xs = [Pretty.block (Pretty.breaks (Pretty.str s ::
skalberg@15570
  1333
            List.concat (Library.separate sep (map (Library.single o prt) xs))))];
wenzelm@10810
  1334
wenzelm@10830
  1335
    fun prt_case (name, (fixes, (lets, asms))) = Pretty.block (Pretty.fbreaks
wenzelm@10810
  1336
      (Pretty.str (name ^ ":") ::
wenzelm@11915
  1337
        prt_sect "fix" [] (Pretty.str o fst) fixes @
wenzelm@10810
  1338
        prt_sect "let" [Pretty.str "and"] prt_let
skalberg@15570
  1339
          (List.mapPartial (fn (xi, SOME t) => SOME (xi, t) | _ => NONE) lets) @
wenzelm@13425
  1340
        (if forall (null o #2) asms then []
wenzelm@13425
  1341
          else prt_sect "assume" [Pretty.str "and"] prt_asm asms)));
wenzelm@16540
  1342
wenzelm@16540
  1343
    val cases = cases_of ctxt;
wenzelm@10810
  1344
  in
wenzelm@10810
  1345
    if null cases andalso not (! verbose) then []
wenzelm@10830
  1346
    else [Pretty.big_list "cases:"
wenzelm@16147
  1347
      (map (prt_case o apsnd (fn c => (#fixes c, #2 (apply_case c ctxt)))) (rev cases))]
wenzelm@10810
  1348
  end;
wenzelm@10810
  1349
wenzelm@10810
  1350
val print_cases = Pretty.writeln o Pretty.chunks o pretty_cases;
wenzelm@10810
  1351
wenzelm@10810
  1352
wenzelm@12057
  1353
(* core context *)
wenzelm@10810
  1354
wenzelm@10810
  1355
val prems_limit = ref 10;
wenzelm@10810
  1356
wenzelm@12057
  1357
fun pretty_asms ctxt =
wenzelm@10810
  1358
  let
wenzelm@12057
  1359
    val prt_term = pretty_term ctxt;
wenzelm@12057
  1360
wenzelm@12093
  1361
    (*structures*)
wenzelm@12093
  1362
    val (_, structs, _) = syntax_of ctxt;
wenzelm@12093
  1363
    val prt_structs = if null structs then []
wenzelm@12093
  1364
      else [Pretty.block (Pretty.str "structures:" :: Pretty.brk 1 ::
wenzelm@12093
  1365
        Pretty.commas (map Pretty.str structs))];
wenzelm@12093
  1366
wenzelm@12057
  1367
    (*fixes*)
wenzelm@12057
  1368
    fun prt_fix (x, x') =
wenzelm@12057
  1369
      if x = x' then Pretty.str x
wenzelm@12057
  1370
      else Pretty.block [Pretty.str x, Pretty.str " =", Pretty.brk 1, prt_term (Syntax.free x')];
wenzelm@12093
  1371
    val fixes = rev (filter_out
wenzelm@12093
  1372
      ((can Syntax.dest_internal o #1) orf (fn (_, x') => x' mem_string structs)) (fixes_of ctxt));
wenzelm@12093
  1373
    val prt_fixes = if null fixes then []
wenzelm@12093
  1374
      else [Pretty.block (Pretty.str "fixed variables:" :: Pretty.brk 1 ::
wenzelm@12093
  1375
        Pretty.commas (map prt_fix fixes))];
wenzelm@12057
  1376
wenzelm@12057
  1377
    (*prems*)
wenzelm@10810
  1378
    val limit = ! prems_limit;
wenzelm@10810
  1379
    val prems = prems_of ctxt;
wenzelm@10810
  1380
    val len = length prems;
wenzelm@12093
  1381
    val prt_prems = if null prems then []
wenzelm@12093
  1382
      else [Pretty.big_list "prems:" ((if len <= limit then [] else [Pretty.str "..."]) @
wenzelm@12093
  1383
        map (pretty_thm ctxt) (Library.drop (len - limit, prems)))];
wenzelm@12093
  1384
wenzelm@12093
  1385
  in prt_structs @ prt_fixes @ prt_prems end;
wenzelm@10810
  1386
wenzelm@10810
  1387
wenzelm@10810
  1388
(* main context *)
wenzelm@10810
  1389
wenzelm@16540
  1390
fun pretty_context ctxt =
wenzelm@10810
  1391
  let
wenzelm@12057
  1392
    val prt_term = pretty_term ctxt;
wenzelm@12057
  1393
    val prt_typ = pretty_typ ctxt;
wenzelm@12057
  1394
    val prt_sort = pretty_sort ctxt;
wenzelm@10810
  1395
wenzelm@10810
  1396
    (*theory*)
wenzelm@12057
  1397
    val pretty_thy = Pretty.block
wenzelm@16458
  1398
      [Pretty.str "Theory:", Pretty.brk 1, Context.pretty_thy (theory_of ctxt)];
wenzelm@10810
  1399
wenzelm@10810
  1400
    (*defaults*)
wenzelm@10810
  1401
    fun prt_atom prt prtT (x, X) = Pretty.block
wenzelm@10810
  1402
      [prt x, Pretty.str " ::", Pretty.brk 1, prtT X];
wenzelm@10810
  1403
wenzelm@10810
  1404
    fun prt_var (x, ~1) = prt_term (Syntax.free x)
wenzelm@10810
  1405
      | prt_var xi = prt_term (Syntax.var xi);
wenzelm@10810
  1406
wenzelm@10810
  1407
    fun prt_varT (x, ~1) = prt_typ (TFree (x, []))
wenzelm@10810
  1408
      | prt_varT xi = prt_typ (TVar (xi, []));
wenzelm@10810
  1409
wenzelm@10810
  1410
    val prt_defT = prt_atom prt_var prt_typ;
wenzelm@10810
  1411
    val prt_defS = prt_atom prt_varT prt_sort;
wenzelm@16540
  1412
wenzelm@16540
  1413
    val (types, sorts, used, _) = defaults_of ctxt;
wenzelm@10810
  1414
  in
wenzelm@10810
  1415
    verb_single (K pretty_thy) @
wenzelm@12057
  1416
    pretty_asms ctxt @
wenzelm@10810
  1417
    verb pretty_binds (K ctxt) @
wenzelm@12057
  1418
    verb pretty_lthms (K ctxt) @
wenzelm@10810
  1419
    verb pretty_cases (K ctxt) @
wenzelm@10810
  1420
    verb_single (fn () => Pretty.big_list "type constraints:" (map prt_defT (Vartab.dest types))) @
wenzelm@10810
  1421
    verb_single (fn () => Pretty.big_list "default sorts:" (map prt_defS (Vartab.dest sorts))) @
wenzelm@10810
  1422
    verb_single (fn () => Pretty.strs ("used type variable names:" :: used))
wenzelm@10810
  1423
  end;
wenzelm@10810
  1424
wenzelm@5819
  1425
end;