src/Pure/Isar/proof_context.ML
author wenzelm
Fri Sep 12 12:04:20 2008 +0200 (2008-09-12 ago)
changeset 28212 44831b583999
parent 28209 02f3222a392d
child 28396 72695dd4395d
permissions -rw-r--r--
added extern_fact (local or global);
more procise printing of fact names;
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@24501
    15
  val mode_default: mode
wenzelm@24501
    16
  val mode_stmt: mode
wenzelm@24501
    17
  val mode_pattern: mode
wenzelm@24501
    18
  val mode_schematic: mode
wenzelm@24501
    19
  val mode_abbrev: mode
wenzelm@24388
    20
  val set_mode: mode -> Proof.context -> Proof.context
wenzelm@24388
    21
  val get_mode: Proof.context -> mode
wenzelm@24388
    22
  val restore_mode: Proof.context -> Proof.context -> Proof.context
wenzelm@27286
    23
  val abbrev_mode: Proof.context -> bool
wenzelm@21667
    24
  val set_stmt: bool -> Proof.context -> Proof.context
wenzelm@21667
    25
  val naming_of: Proof.context -> NameSpace.naming
wenzelm@20310
    26
  val full_name: Proof.context -> bstring -> string
wenzelm@20310
    27
  val consts_of: Proof.context -> Consts.T
wenzelm@21183
    28
  val const_syntax_name: Proof.context -> string -> string
haftmann@24752
    29
  val the_const_constraint: Proof.context -> string -> typ
haftmann@26268
    30
  val mk_const: Proof.context -> string * typ list -> term
wenzelm@20784
    31
  val set_syntax_mode: Syntax.mode -> Proof.context -> Proof.context
wenzelm@20310
    32
  val restore_syntax_mode: Proof.context -> Proof.context -> Proof.context
wenzelm@26284
    33
  val facts_of: Proof.context -> Facts.T
wenzelm@27259
    34
  val transfer_syntax: theory -> Proof.context -> Proof.context
wenzelm@20310
    35
  val transfer: theory -> Proof.context -> Proof.context
wenzelm@20367
    36
  val theory: (theory -> theory) -> Proof.context -> Proof.context
wenzelm@20367
    37
  val theory_result: (theory -> 'a * theory) -> Proof.context -> 'a * Proof.context
wenzelm@28212
    38
  val extern_fact: Proof.context -> string -> xstring
wenzelm@21728
    39
  val pretty_term_abbrev: Proof.context -> term -> Pretty.T
wenzelm@22874
    40
  val pretty_thm_legacy: thm -> Pretty.T
wenzelm@20310
    41
  val pretty_thm: Proof.context -> thm -> Pretty.T
wenzelm@20310
    42
  val pretty_thms: Proof.context -> thm list -> Pretty.T
wenzelm@20310
    43
  val pretty_fact: Proof.context -> string * thm list -> Pretty.T
wenzelm@20310
    44
  val string_of_thm: Proof.context -> thm -> string
wenzelm@20310
    45
  val read_typ: Proof.context -> string -> typ
wenzelm@20310
    46
  val read_typ_syntax: Proof.context -> string -> typ
wenzelm@20310
    47
  val read_typ_abbrev: Proof.context -> string -> typ
wenzelm@20310
    48
  val cert_typ: Proof.context -> typ -> typ
wenzelm@20310
    49
  val cert_typ_syntax: Proof.context -> typ -> typ
wenzelm@20310
    50
  val cert_typ_abbrev: Proof.context -> typ -> typ
wenzelm@20310
    51
  val get_skolem: Proof.context -> string -> string
wenzelm@20310
    52
  val revert_skolem: Proof.context -> string -> string
wenzelm@25328
    53
  val infer_type: Proof.context -> string -> typ
wenzelm@28082
    54
  val inferred_param: string -> Proof.context -> typ * Proof.context
wenzelm@25328
    55
  val inferred_fixes: Proof.context -> (string * typ) list * Proof.context
wenzelm@25328
    56
  val read_tyname: Proof.context -> string -> typ
wenzelm@25345
    57
  val read_const_proper: Proof.context -> string -> term
wenzelm@25328
    58
  val read_const: Proof.context -> string -> term
wenzelm@27259
    59
  val allow_dummies: Proof.context -> Proof.context
wenzelm@22763
    60
  val decode_term: Proof.context -> term -> term
wenzelm@25406
    61
  val standard_infer_types: Proof.context -> term list -> term list
wenzelm@24684
    62
  val read_term_pattern: Proof.context -> string -> term
wenzelm@24684
    63
  val read_term_schematic: Proof.context -> string -> term
wenzelm@24684
    64
  val read_term_abbrev: Proof.context -> string -> term
wenzelm@25345
    65
  val expand_abbrevs: Proof.context -> term -> term
wenzelm@20310
    66
  val cert_term: Proof.context -> term -> term
wenzelm@20310
    67
  val cert_prop: Proof.context -> term -> term
wenzelm@20310
    68
  val goal_export: Proof.context -> Proof.context -> thm list -> thm list
wenzelm@20310
    69
  val export: Proof.context -> Proof.context -> thm list -> thm list
wenzelm@21531
    70
  val export_morphism: Proof.context -> Proof.context -> morphism
wenzelm@20310
    71
  val add_binds: (indexname * string option) list -> Proof.context -> Proof.context
wenzelm@20310
    72
  val add_binds_i: (indexname * term option) list -> Proof.context -> Proof.context
wenzelm@20310
    73
  val auto_bind_goal: term list -> Proof.context -> Proof.context
wenzelm@20310
    74
  val auto_bind_facts: term list -> Proof.context -> Proof.context
wenzelm@20310
    75
  val match_bind: bool -> (string list * string) list -> Proof.context -> term list * Proof.context
wenzelm@20310
    76
  val match_bind_i: bool -> (term list * term) list -> Proof.context -> term list * Proof.context
wenzelm@20310
    77
  val read_propp: Proof.context * (string * string list) list list
wenzelm@20310
    78
    -> Proof.context * (term * term list) list list
wenzelm@20310
    79
  val cert_propp: Proof.context * (term * term list) list list
wenzelm@20310
    80
    -> Proof.context * (term * term list) list list
wenzelm@20310
    81
  val read_propp_schematic: Proof.context * (string * string list) list list
wenzelm@20310
    82
    -> Proof.context * (term * term list) list list
wenzelm@20310
    83
  val cert_propp_schematic: Proof.context * (term * term list) list list
wenzelm@20310
    84
    -> Proof.context * (term * term list) list list
wenzelm@20310
    85
  val bind_propp: Proof.context * (string * string list) list list
wenzelm@20310
    86
    -> Proof.context * (term list list * (Proof.context -> Proof.context))
wenzelm@20310
    87
  val bind_propp_i: Proof.context * (term * term list) list list
wenzelm@20310
    88
    -> Proof.context * (term list list * (Proof.context -> Proof.context))
wenzelm@20310
    89
  val bind_propp_schematic: Proof.context * (string * string list) list list
wenzelm@20310
    90
    -> Proof.context * (term list list * (Proof.context -> Proof.context))
wenzelm@20310
    91
  val bind_propp_schematic_i: Proof.context * (term * term list) list list
wenzelm@20310
    92
    -> Proof.context * (term list list * (Proof.context -> Proof.context))
wenzelm@18042
    93
  val fact_tac: thm list -> int -> tactic
wenzelm@20310
    94
  val some_fact_tac: Proof.context -> int -> tactic
wenzelm@26346
    95
  val get_fact: Proof.context -> Facts.ref -> thm list
wenzelm@26346
    96
  val get_fact_single: Proof.context -> Facts.ref -> thm
wenzelm@26346
    97
  val get_thms: Proof.context -> xstring -> thm list
wenzelm@26346
    98
  val get_thm: Proof.context -> xstring -> thm
haftmann@22352
    99
  val add_path: string -> Proof.context -> Proof.context
wenzelm@20310
   100
  val no_base_names: Proof.context -> Proof.context
wenzelm@20310
   101
  val qualified_names: Proof.context -> Proof.context
wenzelm@20310
   102
  val sticky_prefix: string -> Proof.context -> Proof.context
wenzelm@20310
   103
  val restore_naming: Proof.context -> Proof.context -> Proof.context
wenzelm@21728
   104
  val reset_naming: Proof.context -> Proof.context
wenzelm@21443
   105
  val note_thmss: string ->
wenzelm@28082
   106
    ((Name.binding * attribute list) * (Facts.ref * attribute list) list) list ->
wenzelm@28082
   107
      Proof.context -> (string * thm list) list * Proof.context
wenzelm@21443
   108
  val note_thmss_i: string ->
wenzelm@28082
   109
    ((Name.binding * attribute list) * (thm list * attribute list) list) list ->
wenzelm@28082
   110
      Proof.context -> (string * thm list) list * Proof.context
wenzelm@28082
   111
  val put_thms: bool -> string * thm list option -> Proof.context -> Proof.context
wenzelm@28082
   112
  val read_vars: (Name.binding * string option * mixfix) list -> Proof.context ->
wenzelm@28082
   113
    (Name.binding * typ option * mixfix) list * Proof.context
wenzelm@28082
   114
  val cert_vars: (Name.binding * typ option * mixfix) list -> Proof.context ->
wenzelm@28082
   115
    (Name.binding * typ option * mixfix) list * Proof.context
wenzelm@28082
   116
  val add_fixes: (Name.binding * string option * mixfix) list ->
wenzelm@20310
   117
    Proof.context -> string list * Proof.context
wenzelm@28082
   118
  val add_fixes_i: (Name.binding * typ option * mixfix) list ->
wenzelm@20310
   119
    Proof.context -> string list * Proof.context
wenzelm@20310
   120
  val auto_fixes: Proof.context * (term list list * 'a) -> Proof.context * (term list list * 'a)
wenzelm@20310
   121
  val bind_fixes: string list -> Proof.context -> (term -> term) * Proof.context
wenzelm@20234
   122
  val add_assms: Assumption.export ->
wenzelm@28082
   123
    ((Name.binding * attribute list) * (string * string list) list) list ->
wenzelm@28082
   124
    Proof.context -> (string * thm list) list * Proof.context
wenzelm@20234
   125
  val add_assms_i: Assumption.export ->
wenzelm@28082
   126
    ((Name.binding * attribute list) * (term * term list) list) list ->
wenzelm@28082
   127
    Proof.context -> (string * thm list) list * Proof.context
wenzelm@20310
   128
  val add_cases: bool -> (string * RuleCases.T option) list -> Proof.context -> Proof.context
wenzelm@20310
   129
  val apply_case: RuleCases.T -> Proof.context -> (string * term list) list * Proof.context
wenzelm@20310
   130
  val get_case: Proof.context -> string -> string option list -> RuleCases.T
wenzelm@24949
   131
  val notation: bool -> Syntax.mode -> (term * mixfix) list -> Proof.context -> Proof.context
wenzelm@24949
   132
  val target_notation: bool -> Syntax.mode -> (term * mixfix) list -> morphism ->
wenzelm@21744
   133
    Context.generic -> Context.generic
wenzelm@24767
   134
  val add_const_constraint: string * typ option -> Proof.context -> Proof.context
wenzelm@28017
   135
  val add_abbrev: string -> Properties.T ->
wenzelm@24778
   136
    bstring * term -> Proof.context -> (term * term) * Proof.context
wenzelm@25052
   137
  val revert_abbrev: string -> string -> Proof.context -> Proof.context
wenzelm@10810
   138
  val verbose: bool ref
wenzelm@10810
   139
  val setmp_verbose: ('a -> 'b) -> 'a -> 'b
wenzelm@20310
   140
  val print_syntax: Proof.context -> unit
wenzelm@21728
   141
  val print_abbrevs: Proof.context -> unit
wenzelm@20310
   142
  val print_binds: Proof.context -> unit
wenzelm@20310
   143
  val print_lthms: Proof.context -> unit
wenzelm@20310
   144
  val print_cases: Proof.context -> unit
wenzelm@20310
   145
  val debug: bool ref
wenzelm@10810
   146
  val prems_limit: int ref
wenzelm@20310
   147
  val pretty_ctxt: Proof.context -> Pretty.T list
wenzelm@20310
   148
  val pretty_context: Proof.context -> Pretty.T list
wenzelm@28017
   149
  val query_type: Proof.context -> string -> Properties.T
wenzelm@28017
   150
  val query_const: Proof.context -> string -> Properties.T
wenzelm@28017
   151
  val query_class: Proof.context -> string -> Properties.T
wenzelm@5819
   152
end;
wenzelm@5819
   153
wenzelm@16540
   154
structure ProofContext: PROOF_CONTEXT =
wenzelm@5819
   155
struct
wenzelm@5819
   156
wenzelm@16540
   157
val theory_of = Context.theory_of_proof;
wenzelm@16540
   158
val init = Context.init_proof;
wenzelm@12057
   159
wenzelm@7270
   160
wenzelm@24388
   161
(** inner syntax mode **)
wenzelm@24388
   162
wenzelm@24388
   163
datatype mode =
wenzelm@24388
   164
  Mode of
wenzelm@24486
   165
   {stmt: bool,                (*inner statement mode*)
wenzelm@24388
   166
    pattern: bool,             (*pattern binding schematic variables*)
wenzelm@24388
   167
    schematic: bool,           (*term referencing loose schematic variables*)
wenzelm@24388
   168
    abbrev: bool};             (*abbrev mode -- no normalization*)
wenzelm@24388
   169
wenzelm@24486
   170
fun make_mode (stmt, pattern, schematic, abbrev) =
wenzelm@24486
   171
  Mode {stmt = stmt, pattern = pattern, schematic = schematic, abbrev = abbrev};
wenzelm@24388
   172
wenzelm@24486
   173
val mode_default   = make_mode (false, false, false, false);
wenzelm@24486
   174
val mode_stmt      = make_mode (true, false, false, false);
wenzelm@24486
   175
val mode_pattern   = make_mode (false, true, false, false);
wenzelm@24486
   176
val mode_schematic = make_mode (false, false, true, false);
wenzelm@24486
   177
val mode_abbrev    = make_mode (false, false, false, true);
wenzelm@24388
   178
wenzelm@24388
   179
wenzelm@5819
   180
wenzelm@16540
   181
(** Isar proof context information **)
wenzelm@5819
   182
wenzelm@16540
   183
datatype ctxt =
wenzelm@16540
   184
  Ctxt of
wenzelm@24675
   185
   {mode: mode,                                       (*inner syntax mode*)
wenzelm@24675
   186
    naming: NameSpace.naming,                         (*local naming conventions*)
wenzelm@24675
   187
    syntax: LocalSyntax.T,                            (*local syntax*)
haftmann@25039
   188
    consts: Consts.T * Consts.T,                      (*local/global consts*)
wenzelm@26284
   189
    facts: Facts.T,                                   (*local facts*)
wenzelm@26284
   190
    cases: (string * (RuleCases.T * bool)) list};     (*named case contexts*)
wenzelm@5819
   191
wenzelm@26284
   192
fun make_ctxt (mode, naming, syntax, consts, facts, cases) =
haftmann@26240
   193
  Ctxt {mode = mode, naming = naming, syntax = syntax,
wenzelm@26284
   194
    consts = consts, facts = facts, cases = cases};
wenzelm@5819
   195
wenzelm@19079
   196
val local_naming = NameSpace.default_naming |> NameSpace.add_path "local";
wenzelm@19079
   197
wenzelm@16540
   198
structure ContextData = ProofDataFun
wenzelm@18672
   199
(
wenzelm@16540
   200
  type T = ctxt;
wenzelm@16540
   201
  fun init thy =
haftmann@26240
   202
    make_ctxt (mode_default, local_naming, LocalSyntax.init thy,
wenzelm@26284
   203
      (Sign.consts_of thy, Sign.consts_of thy), Facts.empty, []);
wenzelm@18672
   204
);
wenzelm@5819
   205
wenzelm@16540
   206
fun rep_context ctxt = ContextData.get ctxt |> (fn Ctxt args => args);
wenzelm@5819
   207
wenzelm@18672
   208
fun map_context f =
wenzelm@26284
   209
  ContextData.map (fn Ctxt {mode, naming, syntax, consts, facts, cases} =>
wenzelm@26284
   210
    make_ctxt (f (mode, naming, syntax, consts, facts, cases)));
wenzelm@24388
   211
wenzelm@26284
   212
fun set_mode mode = map_context (fn (_, naming, syntax, consts, facts, cases) =>
wenzelm@26284
   213
  (mode, naming, syntax, consts, facts, cases));
wenzelm@21443
   214
wenzelm@24388
   215
fun map_mode f =
wenzelm@26284
   216
  map_context (fn (Mode {stmt, pattern, schematic, abbrev}, naming, syntax, consts, facts, cases) =>
wenzelm@26284
   217
    (make_mode (f (stmt, pattern, schematic, abbrev)), naming, syntax, consts, facts, cases));
wenzelm@18672
   218
wenzelm@19001
   219
fun map_naming f =
wenzelm@26284
   220
  map_context (fn (mode, naming, syntax, consts, facts, cases) =>
wenzelm@26284
   221
    (mode, f naming, syntax, consts, facts, cases));
wenzelm@18672
   222
wenzelm@19001
   223
fun map_syntax f =
wenzelm@26284
   224
  map_context (fn (mode, naming, syntax, consts, facts, cases) =>
wenzelm@26284
   225
    (mode, naming, f syntax, consts, facts, cases));
wenzelm@18672
   226
wenzelm@19001
   227
fun map_consts f =
wenzelm@26284
   228
  map_context (fn (mode, naming, syntax, consts, facts, cases) =>
wenzelm@26284
   229
    (mode, naming, syntax, f consts, facts, cases));
wenzelm@18672
   230
wenzelm@26284
   231
fun map_facts f =
wenzelm@26284
   232
  map_context (fn (mode, naming, syntax, consts, facts, cases) =>
wenzelm@26284
   233
    (mode, naming, syntax, consts, f facts, cases));
wenzelm@18672
   234
wenzelm@19001
   235
fun map_cases f =
wenzelm@26284
   236
  map_context (fn (mode, naming, syntax, consts, facts, cases) =>
wenzelm@26284
   237
    (mode, naming, syntax, consts, facts, f cases));
wenzelm@24388
   238
wenzelm@24388
   239
val get_mode = #mode o rep_context;
wenzelm@24388
   240
fun restore_mode ctxt = set_mode (get_mode ctxt);
wenzelm@27286
   241
val abbrev_mode = get_mode #> (fn Mode {abbrev, ...} => abbrev);
wenzelm@21443
   242
wenzelm@24486
   243
fun set_stmt stmt =
wenzelm@24486
   244
  map_mode (fn (_, pattern, schematic, abbrev) => (stmt, pattern, schematic, abbrev));
wenzelm@19001
   245
wenzelm@19001
   246
val naming_of = #naming o rep_context;
wenzelm@19387
   247
val full_name = NameSpace.full o naming_of;
wenzelm@5819
   248
wenzelm@16540
   249
val syntax_of = #syntax o rep_context;
wenzelm@19001
   250
val syn_of = LocalSyntax.syn_of o syntax_of;
wenzelm@19543
   251
val set_syntax_mode = map_syntax o LocalSyntax.set_mode;
wenzelm@19543
   252
val restore_syntax_mode = map_syntax o LocalSyntax.restore_mode o syntax_of;
wenzelm@19001
   253
wenzelm@25052
   254
val consts_of = #1 o #consts o rep_context;
wenzelm@21183
   255
val const_syntax_name = Consts.syntax_name o consts_of;
haftmann@24752
   256
val the_const_constraint = Consts.the_constraint o consts_of;
wenzelm@5819
   257
haftmann@26268
   258
fun mk_const ctxt (c, Ts) = Const (c, Consts.instance (consts_of ctxt) (c, Ts));
haftmann@26268
   259
wenzelm@26284
   260
val facts_of = #facts o rep_context;
wenzelm@16540
   261
val cases_of = #cases o rep_context;
wenzelm@5819
   262
wenzelm@5819
   263
wenzelm@20367
   264
(* theory transfer *)
wenzelm@12093
   265
wenzelm@19001
   266
fun transfer_syntax thy =
wenzelm@19001
   267
  map_syntax (LocalSyntax.rebuild thy) #>
haftmann@25039
   268
  map_consts (fn consts as (local_consts, global_consts) =>
wenzelm@19033
   269
    let val thy_consts = Sign.consts_of thy in
wenzelm@19033
   270
      if Consts.eq_consts (thy_consts, global_consts) then consts
haftmann@25039
   271
      else (Consts.merge (local_consts, thy_consts), thy_consts)
wenzelm@19033
   272
    end);
wenzelm@17072
   273
wenzelm@19001
   274
fun transfer thy = Context.transfer_proof thy #> transfer_syntax thy;
wenzelm@17072
   275
wenzelm@20367
   276
fun theory f ctxt = transfer (f (theory_of ctxt)) ctxt;
wenzelm@20367
   277
wenzelm@20367
   278
fun theory_result f ctxt =
wenzelm@20367
   279
  let val (res, thy') = f (theory_of ctxt)
wenzelm@20367
   280
  in (res, ctxt |> transfer thy') end;
wenzelm@19019
   281
wenzelm@12093
   282
wenzelm@12093
   283
wenzelm@14828
   284
(** pretty printing **)
wenzelm@14828
   285
wenzelm@28212
   286
(* extern *)
wenzelm@28212
   287
wenzelm@28212
   288
fun extern_fact ctxt name =
wenzelm@28212
   289
  let
wenzelm@28212
   290
    val local_facts = facts_of ctxt;
wenzelm@28212
   291
    val global_facts = PureThy.facts_of (theory_of ctxt);
wenzelm@28212
   292
  in
wenzelm@28212
   293
    if is_some (Facts.lookup (Context.Proof ctxt) local_facts name)
wenzelm@28212
   294
    then Facts.extern local_facts name
wenzelm@28212
   295
    else Facts.extern global_facts name
wenzelm@28212
   296
  end;
wenzelm@28212
   297
wenzelm@28212
   298
wenzelm@28212
   299
(* pretty *)
wenzelm@28212
   300
wenzelm@24922
   301
fun pretty_term_abbrev ctxt = Syntax.pretty_term (set_mode mode_abbrev ctxt);
wenzelm@14828
   302
wenzelm@22874
   303
fun pretty_thm_legacy th =
wenzelm@22874
   304
  let val thy = Thm.theory_of_thm th
wenzelm@26939
   305
  in Display.pretty_thm_aux (Syntax.pp_global thy) true false [] th end;
wenzelm@20234
   306
wenzelm@17451
   307
fun pretty_thm ctxt th =
wenzelm@22874
   308
  let val asms = map Thm.term_of (Assumption.assms_of ctxt)
wenzelm@24961
   309
  in Display.pretty_thm_aux (Syntax.pp ctxt) false true asms th end;
wenzelm@14828
   310
wenzelm@14828
   311
fun pretty_thms ctxt [th] = pretty_thm ctxt th
wenzelm@14828
   312
  | pretty_thms ctxt ths = Pretty.blk (0, Pretty.fbreaks (map (pretty_thm ctxt) ths));
wenzelm@14828
   313
wenzelm@28212
   314
fun pretty_fact_name ctxt a = Pretty.block
wenzelm@28212
   315
  [Pretty.markup (Markup.fact a) [Pretty.str (extern_fact ctxt a)], Pretty.str ":"];
wenzelm@28209
   316
wenzelm@14828
   317
fun pretty_fact ctxt ("", ths) = pretty_thms ctxt ths
wenzelm@28087
   318
  | pretty_fact ctxt (a, [th]) = Pretty.block
wenzelm@28212
   319
      [pretty_fact_name ctxt a, Pretty.brk 1, pretty_thm ctxt th]
wenzelm@28087
   320
  | pretty_fact ctxt (a, ths) = Pretty.block
wenzelm@28212
   321
      (Pretty.fbreaks (pretty_fact_name ctxt a :: map (pretty_thm ctxt) ths));
wenzelm@14828
   322
wenzelm@17860
   323
val string_of_thm = Pretty.string_of oo pretty_thm;
wenzelm@17860
   324
wenzelm@14828
   325
wenzelm@14828
   326
wenzelm@5819
   327
(** prepare types **)
wenzelm@5819
   328
wenzelm@24277
   329
(* read_typ *)
wenzelm@24277
   330
wenzelm@24277
   331
fun read_typ_mode mode ctxt s =
wenzelm@24486
   332
  Syntax.read_typ (Type.set_mode mode ctxt) s;
wenzelm@24277
   333
wenzelm@24277
   334
val read_typ        = read_typ_mode Type.mode_default;
wenzelm@24277
   335
val read_typ_syntax = read_typ_mode Type.mode_syntax;
wenzelm@24277
   336
val read_typ_abbrev = read_typ_mode Type.mode_abbrev;
wenzelm@24277
   337
wenzelm@24277
   338
wenzelm@24277
   339
(* cert_typ *)
wenzelm@24277
   340
wenzelm@24277
   341
fun cert_typ_mode mode ctxt T =
wenzelm@24277
   342
  Sign.certify_typ_mode mode (theory_of ctxt) T
wenzelm@24277
   343
    handle TYPE (msg, _, _) => error msg;
wenzelm@24277
   344
wenzelm@24277
   345
val cert_typ        = cert_typ_mode Type.mode_default;
wenzelm@24277
   346
val cert_typ_syntax = cert_typ_mode Type.mode_syntax;
wenzelm@24277
   347
val cert_typ_abbrev = cert_typ_mode Type.mode_abbrev;
wenzelm@24277
   348
wenzelm@24277
   349
wenzelm@24388
   350
wenzelm@24388
   351
(** prepare variables **)
wenzelm@24388
   352
wenzelm@7679
   353
(* internalize Skolem constants *)
wenzelm@7679
   354
wenzelm@19897
   355
val lookup_skolem = AList.lookup (op =) o Variable.fixes_of;
wenzelm@18187
   356
fun get_skolem ctxt x = the_default x (lookup_skolem ctxt x);
wenzelm@7679
   357
wenzelm@18678
   358
fun no_skolem internal x =
wenzelm@20086
   359
  if can Name.dest_skolem x then
wenzelm@18678
   360
    error ("Illegal reference to internal Skolem constant: " ^ quote x)
wenzelm@20086
   361
  else if not internal andalso can Name.dest_internal x then
wenzelm@18678
   362
    error ("Illegal reference to internal variable: " ^ quote x)
wenzelm@7679
   363
  else x;
wenzelm@7679
   364
wenzelm@7679
   365
wenzelm@26717
   366
(* revert Skolem constants -- if possible *)
wenzelm@18255
   367
wenzelm@26717
   368
fun revert_skolem ctxt x =
wenzelm@26717
   369
  (case find_first (fn (_, y) => y = x) (Variable.fixes_of ctxt) of
wenzelm@26717
   370
    SOME (x', _) => if lookup_skolem ctxt x' = SOME x then x' else x
wenzelm@26717
   371
  | NONE => x);
wenzelm@9133
   372
wenzelm@8096
   373
wenzelm@26705
   374
(* default token translations *)
wenzelm@26705
   375
wenzelm@26705
   376
local
wenzelm@26705
   377
wenzelm@26717
   378
fun free_or_skolem ctxt x =
wenzelm@26717
   379
  (if can Name.dest_skolem x then Pretty.mark Markup.skolem (Pretty.str (revert_skolem ctxt x))
wenzelm@26717
   380
   else Pretty.mark Markup.free (Pretty.str x))
wenzelm@26930
   381
  |> Pretty.mark
wenzelm@26939
   382
    (if Variable.is_fixed ctxt x orelse Syntax.is_pretty_global ctxt then Markup.fixed x
wenzelm@26930
   383
     else Markup.hilite);
wenzelm@26705
   384
wenzelm@26705
   385
fun var_or_skolem _ s =
wenzelm@26705
   386
  (case Lexicon.read_variable s of
wenzelm@26705
   387
    SOME (x, i) =>
wenzelm@26705
   388
      (case try Name.dest_skolem x of
wenzelm@26705
   389
        NONE => Pretty.mark Markup.var (Pretty.str s)
wenzelm@26705
   390
      | SOME x' => Pretty.mark Markup.skolem
wenzelm@26705
   391
          (Pretty.str (setmp show_question_marks true Term.string_of_vname (x', i))))
wenzelm@26705
   392
  | NONE => Pretty.mark Markup.var (Pretty.str s));
wenzelm@26705
   393
wenzelm@26705
   394
fun class_markup _ c =    (* FIXME authentic name *)
wenzelm@27828
   395
  Pretty.mark (Markup.tclassN, []) (Pretty.str c);
wenzelm@26705
   396
wenzelm@26705
   397
fun plain_markup m _ s = Pretty.mark m (Pretty.str s);
wenzelm@26705
   398
wenzelm@26705
   399
val token_trans =
wenzelm@26705
   400
 Syntax.tokentrans_mode ""
wenzelm@26705
   401
  [("class", class_markup),
wenzelm@26705
   402
   ("tfree", plain_markup Markup.tfree),
wenzelm@26705
   403
   ("tvar", plain_markup Markup.tvar),
wenzelm@26705
   404
   ("free", free_or_skolem),
wenzelm@26705
   405
   ("bound", plain_markup Markup.bound),
wenzelm@26705
   406
   ("var", var_or_skolem),
wenzelm@26705
   407
   ("num", plain_markup Markup.num),
wenzelm@26705
   408
   ("xnum", plain_markup Markup.xnum),
wenzelm@26705
   409
   ("xstr", plain_markup Markup.xstr)];
wenzelm@26705
   410
wenzelm@26705
   411
in val _ = Context.>> (Context.map_theory (Sign.add_tokentrfuns token_trans)) end;
wenzelm@26705
   412
wenzelm@26705
   413
wenzelm@18187
   414
wenzelm@5819
   415
(** prepare terms and propositions **)
wenzelm@5819
   416
wenzelm@25328
   417
(* inferred types of parameters *)
wenzelm@25328
   418
wenzelm@25328
   419
fun infer_type ctxt x =
wenzelm@25328
   420
  Term.fastype_of (singleton (Syntax.check_terms (set_mode mode_schematic ctxt))
wenzelm@25328
   421
    (Free (x, dummyT)));
wenzelm@25328
   422
wenzelm@25328
   423
fun inferred_param x ctxt =
wenzelm@25328
   424
  let val T = infer_type ctxt x
wenzelm@28082
   425
  in (T, ctxt |> Variable.declare_term (Free (x, T))) end;
wenzelm@25328
   426
wenzelm@25328
   427
fun inferred_fixes ctxt =
wenzelm@28082
   428
  let
wenzelm@28082
   429
    val xs = rev (map #2 (Variable.fixes_of ctxt));
wenzelm@28082
   430
    val (Ts, ctxt') = fold_map inferred_param xs ctxt;
wenzelm@28082
   431
  in (xs ~~ Ts, ctxt') end;
wenzelm@25328
   432
wenzelm@25328
   433
wenzelm@25328
   434
(* type and constant names *)
wenzelm@25328
   435
wenzelm@27821
   436
local
wenzelm@27821
   437
wenzelm@27821
   438
val token_content = Syntax.read_token #>> SymbolPos.content;
wenzelm@27821
   439
wenzelm@27821
   440
fun prep_const_proper ctxt (c, pos) =
wenzelm@27821
   441
  let val t as (Const (d, _)) =
wenzelm@27821
   442
    (case Variable.lookup_const ctxt c of
wenzelm@27821
   443
      SOME d => Const (d, Consts.type_scheme (consts_of ctxt) d handle TYPE (msg, _, _) => error msg)
wenzelm@27821
   444
    | NONE => Consts.read_const (consts_of ctxt) c)
wenzelm@27821
   445
  in Position.report (Markup.const d) pos; t end;
wenzelm@27821
   446
wenzelm@27821
   447
in
wenzelm@25328
   448
wenzelm@27821
   449
fun read_tyname ctxt str =
wenzelm@27821
   450
  let
wenzelm@27821
   451
    val thy = theory_of ctxt;
wenzelm@27821
   452
    val (c, pos) = token_content str;
wenzelm@27821
   453
  in
wenzelm@27821
   454
    if Syntax.is_tid c then
wenzelm@27821
   455
     (Position.report Markup.tfree pos;
wenzelm@27821
   456
      TFree (c, the_default (Sign.defaultS thy) (Variable.def_sort ctxt (c, ~1))))
wenzelm@27821
   457
    else
wenzelm@27821
   458
      let
wenzelm@27821
   459
        val d = Sign.intern_type thy c;
wenzelm@27821
   460
        val _ = Position.report (Markup.tycon d) pos;
wenzelm@27821
   461
      in Type (d, replicate (Sign.arity_number thy d) dummyT) end
wenzelm@27821
   462
  end;
wenzelm@25328
   463
wenzelm@27821
   464
fun read_const_proper ctxt = prep_const_proper ctxt o token_content;
wenzelm@27821
   465
wenzelm@27821
   466
fun read_const ctxt str =
wenzelm@27821
   467
  let val (c, pos) = token_content str in
wenzelm@27821
   468
    (case (lookup_skolem ctxt c, Variable.is_const ctxt c) of
wenzelm@27821
   469
      (SOME x, false) =>
wenzelm@27821
   470
        (Position.report (Markup.name x
wenzelm@27821
   471
            (if can Name.dest_skolem x then Markup.skolem else Markup.free)) pos;
wenzelm@27821
   472
          Free (x, infer_type ctxt x))
wenzelm@27821
   473
    | _ => prep_const_proper ctxt (c, pos))
wenzelm@27821
   474
  end;
wenzelm@27821
   475
wenzelm@27821
   476
end;
wenzelm@25328
   477
wenzelm@25328
   478
wenzelm@24684
   479
(* read_term *)
wenzelm@24684
   480
wenzelm@24684
   481
fun read_term_mode mode ctxt = Syntax.read_term (set_mode mode ctxt);
wenzelm@24684
   482
wenzelm@24684
   483
val read_term_pattern   = read_term_mode mode_pattern;
wenzelm@24684
   484
val read_term_schematic = read_term_mode mode_schematic;
wenzelm@24684
   485
val read_term_abbrev    = read_term_mode mode_abbrev;
wenzelm@24684
   486
wenzelm@24684
   487
wenzelm@19001
   488
(* local abbreviations *)
wenzelm@5819
   489
haftmann@26240
   490
val tsig_of = Sign.tsig_of o ProofContext.theory_of;
haftmann@26240
   491
wenzelm@24501
   492
local
wenzelm@24501
   493
haftmann@26731
   494
fun certify_consts ctxt = Consts.certify (Syntax.pp ctxt) (tsig_of ctxt)
wenzelm@27286
   495
  (not (abbrev_mode ctxt)) (consts_of ctxt);
wenzelm@19001
   496
wenzelm@19897
   497
fun reject_schematic (Var (xi, _)) =
wenzelm@22678
   498
      error ("Unbound schematic variable: " ^ Term.string_of_vname xi)
wenzelm@19897
   499
  | reject_schematic (Abs (_, _, t)) = reject_schematic t
wenzelm@19897
   500
  | reject_schematic (t $ u) = (reject_schematic t; reject_schematic u)
wenzelm@19897
   501
  | reject_schematic _ = ();
wenzelm@5819
   502
wenzelm@24495
   503
fun expand_binds ctxt =
wenzelm@24495
   504
  let val Mode {pattern, schematic, ...} = get_mode ctxt in
wenzelm@24495
   505
    if pattern then I
wenzelm@24495
   506
    else Variable.expand_binds ctxt #> (if schematic then I else tap reject_schematic)
wenzelm@24495
   507
  end;
wenzelm@5819
   508
wenzelm@24501
   509
in
wenzelm@24501
   510
wenzelm@24501
   511
fun expand_abbrevs ctxt = certify_consts ctxt #> expand_binds ctxt;
wenzelm@24501
   512
wenzelm@24501
   513
end;
wenzelm@24501
   514
wenzelm@5819
   515
wenzelm@24922
   516
fun contract_abbrevs ctxt t =
wenzelm@24922
   517
  let
wenzelm@24922
   518
    val thy = theory_of ctxt;
wenzelm@24922
   519
    val consts = consts_of ctxt;
wenzelm@24922
   520
    val Mode {abbrev, ...} = get_mode ctxt;
wenzelm@24922
   521
  in
wenzelm@25052
   522
    if abbrev orelse print_mode_active "no_abbrevs" orelse not (can Term.type_of t) then t
wenzelm@25052
   523
    else t |> Pattern.rewrite_term thy (Consts.abbrevs_of consts (print_mode_value () @ [""])) []
wenzelm@24922
   524
  end;
wenzelm@24922
   525
wenzelm@24922
   526
wenzelm@24518
   527
(* patterns *)
wenzelm@24518
   528
wenzelm@24518
   529
fun prepare_patternT ctxt =
wenzelm@24518
   530
  let val Mode {pattern, schematic, ...} = get_mode ctxt in
wenzelm@24518
   531
    if pattern orelse schematic then I
wenzelm@24518
   532
    else Term.map_atyps
wenzelm@24518
   533
      (fn T as TVar (xi, _) =>
wenzelm@24518
   534
            if not (TypeInfer.is_param xi)
wenzelm@24518
   535
            then error ("Illegal schematic type variable: " ^ Term.string_of_vname xi)
wenzelm@24518
   536
            else T
wenzelm@24518
   537
        | T => T)
wenzelm@24518
   538
  end;
wenzelm@24518
   539
wenzelm@22712
   540
wenzelm@24505
   541
local
wenzelm@6550
   542
wenzelm@27259
   543
structure AllowDummies = ProofDataFun(type T = bool fun init _ = false);
wenzelm@27259
   544
wenzelm@27259
   545
fun check_dummies ctxt t =
wenzelm@27259
   546
  if AllowDummies.get ctxt then t
wenzelm@27259
   547
  else Term.no_dummy_patterns t handle TERM _ => error "Illegal dummy pattern(s) in term";
wenzelm@27259
   548
wenzelm@24767
   549
fun prepare_dummies ts = #1 (fold_map Term.replace_dummy_patterns ts 1);
wenzelm@6762
   550
wenzelm@27259
   551
in
wenzelm@6550
   552
wenzelm@27259
   553
val allow_dummies = AllowDummies.put true;
wenzelm@24505
   554
wenzelm@24684
   555
fun prepare_patterns ctxt =
wenzelm@24518
   556
  let val Mode {pattern, ...} = get_mode ctxt in
wenzelm@24767
   557
    TypeInfer.fixate_params (Variable.names_of ctxt) #>
wenzelm@24767
   558
    pattern ? Variable.polymorphic ctxt #>
wenzelm@24684
   559
    (map o Term.map_types) (prepare_patternT ctxt) #>
wenzelm@27259
   560
    (if pattern then prepare_dummies else map (check_dummies ctxt))
wenzelm@24505
   561
  end;
wenzelm@24505
   562
wenzelm@24505
   563
end;
wenzelm@24505
   564
wenzelm@6550
   565
wenzelm@22763
   566
(* decoding raw terms (syntax trees) *)
wenzelm@22763
   567
wenzelm@27286
   568
(* types *)
wenzelm@27286
   569
wenzelm@27286
   570
fun get_sort thy def_sort raw_env =
wenzelm@27286
   571
  let
wenzelm@27286
   572
    val tsig = Sign.tsig_of thy;
wenzelm@27286
   573
wenzelm@27286
   574
    fun eq ((xi, S), (xi', S')) =
wenzelm@27286
   575
      Term.eq_ix (xi, xi') andalso Type.eq_sort tsig (S, S');
wenzelm@27286
   576
    val env = distinct eq raw_env;
wenzelm@27286
   577
    val _ = (case duplicates (eq_fst (op =)) env of [] => ()
wenzelm@27286
   578
      | dups => error ("Inconsistent sort constraints for type variable(s) "
wenzelm@27286
   579
          ^ commas_quote (map (Term.string_of_vname' o fst) dups)));
wenzelm@27286
   580
wenzelm@27286
   581
    fun get xi =
wenzelm@27286
   582
      (case (AList.lookup (op =) env xi, def_sort xi) of
wenzelm@27286
   583
        (NONE, NONE) => Type.defaultS tsig
wenzelm@27286
   584
      | (NONE, SOME S) => S
wenzelm@27286
   585
      | (SOME S, NONE) => S
wenzelm@27286
   586
      | (SOME S, SOME S') =>
wenzelm@27286
   587
          if Type.eq_sort tsig (S, S') then S'
wenzelm@27286
   588
          else error ("Sort constraint inconsistent with default for type variable " ^
wenzelm@27286
   589
            quote (Term.string_of_vname' xi)));
wenzelm@27286
   590
  in get end;
wenzelm@27286
   591
wenzelm@25353
   592
local
wenzelm@25353
   593
wenzelm@25353
   594
fun intern_skolem ctxt def_type x =
wenzelm@22763
   595
  let
wenzelm@25353
   596
    val _ = no_skolem false x;
wenzelm@22763
   597
    val sko = lookup_skolem ctxt x;
wenzelm@25452
   598
    val is_const = can (read_const_proper ctxt) x orelse NameSpace.is_qualified x;
wenzelm@22763
   599
    val is_declared = is_some (def_type (x, ~1));
wenzelm@25319
   600
  in
wenzelm@25353
   601
    if Variable.is_const ctxt x then NONE
wenzelm@25353
   602
    else if is_some sko then sko
wenzelm@25353
   603
    else if not is_const orelse is_declared then SOME x
wenzelm@25353
   604
    else NONE
wenzelm@25319
   605
  end;
wenzelm@22763
   606
wenzelm@25353
   607
in
wenzelm@25353
   608
wenzelm@24371
   609
fun term_context ctxt =
wenzelm@24371
   610
  let val thy = theory_of ctxt in
wenzelm@27286
   611
   {get_sort = get_sort thy (Variable.def_sort ctxt),
wenzelm@27195
   612
    map_const = fn a => ((true, #1 (Term.dest_Const (read_const_proper ctxt a)))
wenzelm@27195
   613
      handle ERROR _ => (false, Consts.intern (consts_of ctxt) a)),
wenzelm@25353
   614
    map_free = intern_skolem ctxt (Variable.def_type ctxt false),
wenzelm@24371
   615
    map_type = Sign.intern_tycons thy,
wenzelm@24371
   616
    map_sort = Sign.intern_sort thy}
wenzelm@24371
   617
  end;
wenzelm@24371
   618
wenzelm@22763
   619
fun decode_term ctxt =
wenzelm@24371
   620
  let val {get_sort, map_const, map_free, map_type, map_sort} = term_context ctxt
wenzelm@22763
   621
  in Syntax.decode_term get_sort map_const map_free map_type map_sort end;
wenzelm@22763
   622
wenzelm@10554
   623
end;
wenzelm@10554
   624
wenzelm@5819
   625
wenzelm@5819
   626
(* certify terms *)
wenzelm@5819
   627
wenzelm@10554
   628
local
wenzelm@10554
   629
wenzelm@24684
   630
fun gen_cert prop ctxt t =
wenzelm@24684
   631
  t
wenzelm@24684
   632
  |> expand_abbrevs ctxt
wenzelm@24961
   633
  |> (fn t' => #1 (Sign.certify' prop (Syntax.pp ctxt) false (consts_of ctxt) (theory_of ctxt) t')
wenzelm@24684
   634
    handle TYPE (msg, _, _) => error msg
wenzelm@24684
   635
      | TERM (msg, _) => error msg);
wenzelm@16501
   636
wenzelm@10554
   637
in
wenzelm@8096
   638
wenzelm@24684
   639
val cert_term = gen_cert false;
wenzelm@24684
   640
val cert_prop = gen_cert true;
wenzelm@10554
   641
wenzelm@10554
   642
end;
wenzelm@5819
   643
wenzelm@5819
   644
wenzelm@24495
   645
(* type checking/inference *)
wenzelm@22701
   646
wenzelm@24495
   647
fun standard_infer_types ctxt ts =
wenzelm@24495
   648
  let val Mode {pattern, ...} = get_mode ctxt in
wenzelm@24961
   649
    TypeInfer.infer_types (Syntax.pp ctxt) (tsig_of ctxt) (Syntax.check_typs ctxt)
wenzelm@24495
   650
      (try (Consts.the_constraint (consts_of ctxt))) (Variable.def_type ctxt pattern)
wenzelm@27264
   651
      (Variable.names_of ctxt) (Variable.maxidx_of ctxt) ts
wenzelm@24495
   652
    handle TYPE (msg, _, _) => error msg
wenzelm@24495
   653
  end;
wenzelm@24486
   654
wenzelm@25406
   655
local
wenzelm@25406
   656
wenzelm@24518
   657
fun standard_typ_check ctxt =
wenzelm@24518
   658
  map (cert_typ_mode (Type.get_mode ctxt) ctxt) #>
wenzelm@24518
   659
  map (prepare_patternT ctxt);
wenzelm@24518
   660
wenzelm@24769
   661
fun standard_term_check ctxt =
wenzelm@24769
   662
  standard_infer_types ctxt #>
wenzelm@24769
   663
  map (expand_abbrevs ctxt);
wenzelm@24922
   664
wenzelm@24922
   665
fun standard_term_uncheck ctxt =
wenzelm@24922
   666
  map (contract_abbrevs ctxt);
wenzelm@24922
   667
wenzelm@26463
   668
fun add eq what f = Context.>> (what (fn xs => fn ctxt =>
wenzelm@26463
   669
  let val xs' = f ctxt xs in if eq_list eq (xs, xs') then NONE else SOME (xs', ctxt) end));
wenzelm@24767
   670
wenzelm@24518
   671
in
wenzelm@24518
   672
wenzelm@25060
   673
val _ = add (op =) (Syntax.add_typ_check 0 "standard") standard_typ_check;
wenzelm@25060
   674
val _ = add (op aconv) (Syntax.add_term_check 0 "standard") standard_term_check;
wenzelm@25060
   675
val _ = add (op aconv) (Syntax.add_term_check 100 "fixate") prepare_patterns;
wenzelm@24922
   676
wenzelm@25060
   677
val _ = add (op aconv) (Syntax.add_term_uncheck 0 "standard") standard_term_uncheck;
wenzelm@22701
   678
wenzelm@24518
   679
end;
wenzelm@22701
   680
wenzelm@22701
   681
wenzelm@9553
   682
wenzelm@24767
   683
(** inner syntax operations **)
wenzelm@24371
   684
wenzelm@24371
   685
local
wenzelm@24371
   686
wenzelm@27754
   687
fun parse_sort ctxt text =
wenzelm@27754
   688
  let
wenzelm@27821
   689
    val (syms, pos) = Syntax.parse_token Markup.sort text;
wenzelm@27785
   690
    val S = Syntax.standard_parse_sort ctxt (syn_of ctxt)
wenzelm@27785
   691
        (Sign.intern_sort (theory_of ctxt)) (syms, pos)
wenzelm@27754
   692
      handle ERROR msg => cat_error msg  ("Failed to parse sort" ^ Position.str_of pos)
wenzelm@27754
   693
  in S end;
wenzelm@27754
   694
wenzelm@27754
   695
fun parse_typ ctxt text =
wenzelm@24371
   696
  let
wenzelm@24371
   697
    val thy = ProofContext.theory_of ctxt;
wenzelm@27286
   698
    val get_sort = get_sort thy (Variable.def_sort ctxt);
wenzelm@27754
   699
wenzelm@27821
   700
    val (syms, pos) = Syntax.parse_token Markup.typ text;
wenzelm@24371
   701
    val T = Sign.intern_tycons thy
wenzelm@27785
   702
        (Syntax.standard_parse_typ ctxt (syn_of ctxt) get_sort (Sign.intern_sort thy) (syms, pos))
wenzelm@27754
   703
      handle ERROR msg => cat_error msg  ("Failed to parse type" ^ Position.str_of pos);
wenzelm@27754
   704
  in T end;
wenzelm@24371
   705
wenzelm@27754
   706
fun parse_term T ctxt text =
wenzelm@24371
   707
  let
wenzelm@24371
   708
    val thy = theory_of ctxt;
wenzelm@27754
   709
    val {get_sort, map_const, map_free, map_type, map_sort} = term_context ctxt;
wenzelm@27754
   710
wenzelm@25168
   711
    val (T', _) = TypeInfer.paramify_dummies T 0;
wenzelm@27821
   712
    val (markup, kind) = if T' = propT then (Markup.prop, "proposition") else (Markup.term, "term");
wenzelm@27821
   713
    val (syms, pos) = Syntax.parse_token markup text;
wenzelm@27754
   714
wenzelm@25476
   715
    fun check t = (Syntax.check_term ctxt (TypeInfer.constrain T' t); NONE)
wenzelm@25476
   716
      handle ERROR msg => SOME msg;
wenzelm@27785
   717
    val t = Syntax.standard_parse_term (Syntax.pp ctxt) check get_sort map_const map_free
wenzelm@27785
   718
        map_type map_sort ctxt (Sign.is_logtype thy) (syn_of ctxt) T' (syms, pos)
wenzelm@27754
   719
      handle ERROR msg => cat_error msg  ("Failed to parse " ^ kind ^ Position.str_of pos);
wenzelm@27754
   720
  in t end;
wenzelm@24371
   721
wenzelm@24922
   722
wenzelm@24922
   723
fun unparse_sort ctxt S =
wenzelm@24922
   724
  Syntax.standard_unparse_sort ctxt (syn_of ctxt) (Sign.extern_sort (theory_of ctxt) S);
wenzelm@24922
   725
wenzelm@24922
   726
fun unparse_typ ctxt T =
wenzelm@24922
   727
  Syntax.standard_unparse_typ ctxt (syn_of ctxt) (Sign.extern_typ (theory_of ctxt) T);
wenzelm@24922
   728
wenzelm@24922
   729
fun unparse_term ctxt t =
wenzelm@24922
   730
  let
wenzelm@24922
   731
    val thy = theory_of ctxt;
wenzelm@24922
   732
    val syntax = syntax_of ctxt;
wenzelm@24922
   733
    val consts = consts_of ctxt;
wenzelm@24922
   734
  in
wenzelm@24922
   735
    t
wenzelm@24922
   736
    |> Sign.extern_term (Consts.extern_early consts) thy
wenzelm@24922
   737
    |> LocalSyntax.extern_term syntax
wenzelm@24922
   738
    |> Syntax.standard_unparse_term (Consts.extern consts) ctxt (LocalSyntax.syn_of syntax)
wenzelm@26960
   739
        (not (PureThy.old_appl_syntax thy))
wenzelm@24922
   740
  end;
wenzelm@24922
   741
wenzelm@24371
   742
in
wenzelm@24371
   743
wenzelm@24767
   744
val _ = Syntax.install_operations
wenzelm@24767
   745
  {parse_sort = parse_sort,
wenzelm@24767
   746
   parse_typ = parse_typ,
wenzelm@24767
   747
   parse_term = parse_term dummyT,
wenzelm@24767
   748
   parse_prop = parse_term propT,
wenzelm@24922
   749
   unparse_sort = unparse_sort,
wenzelm@24922
   750
   unparse_typ = unparse_typ,
wenzelm@24922
   751
   unparse_term = unparse_term};
wenzelm@24371
   752
wenzelm@24371
   753
end;
wenzelm@24371
   754
wenzelm@24371
   755
wenzelm@24371
   756
wenzelm@21610
   757
(** export results **)
wenzelm@21531
   758
wenzelm@20310
   759
fun common_export is_goal inner outer =
wenzelm@20310
   760
  map (Assumption.export is_goal inner outer) #>
wenzelm@20310
   761
  Variable.export inner outer;
wenzelm@8616
   762
wenzelm@20310
   763
val goal_export = common_export true;
wenzelm@20310
   764
val export = common_export false;
wenzelm@12704
   765
wenzelm@21531
   766
fun export_morphism inner outer =
wenzelm@21531
   767
  Assumption.export_morphism inner outer $>
wenzelm@21531
   768
  Variable.export_morphism inner outer;
wenzelm@21531
   769
wenzelm@21531
   770
wenzelm@15758
   771
wenzelm@5819
   772
(** bindings **)
wenzelm@5819
   773
wenzelm@8096
   774
(* simult_matches *)
wenzelm@8096
   775
wenzelm@19867
   776
fun simult_matches ctxt (t, pats) =
wenzelm@19867
   777
  (case Seq.pull (Unify.matchers (theory_of ctxt) (map (rpair t) pats)) of
wenzelm@19867
   778
    NONE => error "Pattern match failed!"
wenzelm@19867
   779
  | SOME (env, _) => map (apsnd snd) (Envir.alist_of env));
wenzelm@8096
   780
wenzelm@8096
   781
wenzelm@8096
   782
(* add_binds(_i) *)
wenzelm@5819
   783
wenzelm@7925
   784
local
wenzelm@7925
   785
wenzelm@16031
   786
fun gen_bind prep (xi as (x, _), raw_t) ctxt =
wenzelm@24511
   787
  ctxt
wenzelm@24675
   788
  |> Variable.add_binds [(xi, Option.map (prep (set_mode mode_default ctxt)) raw_t)];
wenzelm@5819
   789
wenzelm@10810
   790
in
wenzelm@10810
   791
wenzelm@20330
   792
fun drop_schematic (b as (xi, SOME t)) = if Term.exists_subterm is_Var t then (xi, NONE) else b
wenzelm@10554
   793
  | drop_schematic b = b;
wenzelm@10554
   794
wenzelm@24511
   795
val add_binds = fold (gen_bind Syntax.read_term);
wenzelm@16031
   796
val add_binds_i = fold (gen_bind cert_term);
wenzelm@8616
   797
wenzelm@16458
   798
fun auto_bind f ts ctxt = ctxt |> add_binds_i (map drop_schematic (f (theory_of ctxt) ts));
wenzelm@12147
   799
val auto_bind_goal = auto_bind AutoBind.goal;
wenzelm@12147
   800
val auto_bind_facts = auto_bind AutoBind.facts;
wenzelm@7925
   801
wenzelm@7925
   802
end;
wenzelm@5819
   803
wenzelm@5819
   804
wenzelm@8096
   805
(* match_bind(_i) *)
wenzelm@5819
   806
wenzelm@8096
   807
local
wenzelm@8096
   808
wenzelm@24684
   809
fun gen_bind prep_terms gen raw_binds ctxt =
wenzelm@5819
   810
  let
wenzelm@24684
   811
    fun prep_bind (raw_pats, t) ctxt1 =
wenzelm@24684
   812
      let
wenzelm@24684
   813
        val T = Term.fastype_of t;
wenzelm@24684
   814
        val ctxt2 = Variable.declare_term t ctxt1;
wenzelm@24684
   815
        val pats = prep_terms (set_mode mode_pattern ctxt2) T raw_pats;
wenzelm@24684
   816
        val binds = simult_matches ctxt2 (t, pats);
wenzelm@24684
   817
      in (binds, ctxt2) end;
wenzelm@7670
   818
wenzelm@24686
   819
    val ts = prep_terms ctxt dummyT (map snd raw_binds);
wenzelm@24686
   820
    val (binds, ctxt') = apfst flat (fold_map prep_bind (map fst raw_binds ~~ ts) ctxt);
wenzelm@8616
   821
    val binds' =
wenzelm@19916
   822
      if gen then map #1 binds ~~ Variable.exportT_terms ctxt' ctxt (map #2 binds)
wenzelm@8616
   823
      else binds;
skalberg@15531
   824
    val binds'' = map (apsnd SOME) binds';
wenzelm@18310
   825
    val ctxt'' =
wenzelm@19897
   826
      tap (Variable.warn_extra_tfrees ctxt)
wenzelm@18310
   827
       (if gen then
wenzelm@19897
   828
          ctxt (*sic!*) |> fold Variable.declare_term (map #2 binds') |> add_binds_i binds''
wenzelm@18310
   829
        else ctxt' |> add_binds_i binds'');
wenzelm@18310
   830
  in (ts, ctxt'') end;
wenzelm@8096
   831
wenzelm@8096
   832
in
wenzelm@5935
   833
wenzelm@24684
   834
fun read_terms ctxt T =
wenzelm@24684
   835
  map (Syntax.parse_term ctxt #> TypeInfer.constrain T) #> Syntax.check_terms ctxt;
wenzelm@24684
   836
wenzelm@24684
   837
val match_bind = gen_bind read_terms;
wenzelm@24684
   838
val match_bind_i = gen_bind (fn ctxt => fn _ => map (cert_term ctxt));
wenzelm@8096
   839
wenzelm@8096
   840
end;
wenzelm@5935
   841
wenzelm@5935
   842
wenzelm@10465
   843
(* propositions with patterns *)
wenzelm@5935
   844
wenzelm@10465
   845
local
wenzelm@8096
   846
wenzelm@24684
   847
fun prep_propp mode prep_props (context, args) =
wenzelm@10465
   848
  let
wenzelm@19585
   849
    fun prep (_, raw_pats) (ctxt, prop :: props) =
wenzelm@24684
   850
      let val ctxt' = Variable.declare_term prop ctxt
wenzelm@24684
   851
      in ((prop, prep_props (set_mode mode_pattern ctxt') raw_pats), (ctxt', props)) end;
wenzelm@24684
   852
wenzelm@17860
   853
    val (propp, (context', _)) = (fold_map o fold_map) prep args
wenzelm@24684
   854
      (context, prep_props (set_mode mode context) (maps (map fst) args));
wenzelm@10465
   855
  in (context', propp) end;
wenzelm@5935
   856
wenzelm@24684
   857
fun gen_bind_propp mode parse_prop (ctxt, raw_args) =
wenzelm@8096
   858
  let
wenzelm@24684
   859
    val (ctxt', args) = prep_propp mode parse_prop (ctxt, raw_args);
wenzelm@19585
   860
    val binds = flat (flat (map (map (simult_matches ctxt')) args));
wenzelm@10465
   861
    val propss = map (map #1) args;
wenzelm@8616
   862
wenzelm@10554
   863
    (*generalize result: context evaluated now, binds added later*)
wenzelm@19916
   864
    val gen = Variable.exportT_terms ctxt' ctxt;
skalberg@15531
   865
    fun gen_binds c = c |> add_binds_i (map #1 binds ~~ map SOME (gen (map #2 binds)));
skalberg@15531
   866
  in (ctxt' |> add_binds_i (map (apsnd SOME) binds), (propss, gen_binds)) end;
wenzelm@8096
   867
wenzelm@10465
   868
in
wenzelm@10465
   869
wenzelm@24684
   870
val read_propp           = prep_propp mode_default Syntax.read_props;
wenzelm@24684
   871
val cert_propp           = prep_propp mode_default (map o cert_prop);
wenzelm@24684
   872
val read_propp_schematic = prep_propp mode_schematic Syntax.read_props;
wenzelm@24684
   873
val cert_propp_schematic = prep_propp mode_schematic (map o cert_prop);
wenzelm@10554
   874
wenzelm@24684
   875
val bind_propp             = gen_bind_propp mode_default Syntax.read_props;
wenzelm@24684
   876
val bind_propp_i           = gen_bind_propp mode_default (map o cert_prop);
wenzelm@24684
   877
val bind_propp_schematic   = gen_bind_propp mode_schematic Syntax.read_props;
wenzelm@24684
   878
val bind_propp_schematic_i = gen_bind_propp mode_schematic (map o cert_prop);
wenzelm@6789
   879
wenzelm@10465
   880
end;
wenzelm@10465
   881
wenzelm@6789
   882
wenzelm@5819
   883
wenzelm@5819
   884
(** theorems **)
wenzelm@5819
   885
wenzelm@18042
   886
(* fact_tac *)
wenzelm@18042
   887
wenzelm@27867
   888
fun comp_incr_tac [] _ = no_tac
wenzelm@27867
   889
  | comp_incr_tac (th :: ths) i =
wenzelm@27867
   890
      (fn st => Goal.compose_hhf_tac (Drule.incr_indexes st th) i st) APPEND comp_incr_tac ths i;
wenzelm@18042
   891
wenzelm@21687
   892
fun fact_tac facts = Goal.norm_hhf_tac THEN' comp_incr_tac facts;
wenzelm@18122
   893
wenzelm@27867
   894
fun potential_facts ctxt prop =
wenzelm@27867
   895
  Facts.could_unify (facts_of ctxt) (Term.strip_all_body prop);
wenzelm@27867
   896
wenzelm@27867
   897
fun some_fact_tac ctxt = SUBGOAL (fn (goal, i) => fact_tac (potential_facts ctxt goal) i);
wenzelm@18042
   898
wenzelm@18042
   899
wenzelm@6091
   900
(* get_thm(s) *)
wenzelm@5819
   901
wenzelm@26361
   902
local
wenzelm@26361
   903
wenzelm@26687
   904
fun retrieve_thms pick ctxt (Facts.Fact s) =
wenzelm@16501
   905
      let
wenzelm@27867
   906
        val (_, pos) = Syntax.read_token s;
wenzelm@24511
   907
        val prop = Syntax.read_prop (set_mode mode_default ctxt) s
wenzelm@24511
   908
          |> singleton (Variable.polymorphic ctxt);
wenzelm@27867
   909
wenzelm@27867
   910
        fun prove_fact th =
wenzelm@27867
   911
          Goal.prove ctxt [] [] prop (K (ALLGOALS (fact_tac [th])))
wenzelm@27867
   912
          |> Thm.default_position_of th;
wenzelm@27867
   913
        val res =
wenzelm@27867
   914
          (case get_first (try prove_fact) (potential_facts ctxt prop) of
wenzelm@27867
   915
            SOME res => res
wenzelm@27867
   916
          | NONE => error ("Failed to retrieve literal fact" ^ Position.str_of pos ^ ":\n" ^
wenzelm@27867
   917
              Syntax.string_of_term ctxt prop))
wenzelm@27867
   918
      in pick "" [res] end
wenzelm@26687
   919
  | retrieve_thms pick ctxt xthmref =
wenzelm@18042
   920
      let
wenzelm@18042
   921
        val thy = theory_of ctxt;
wenzelm@26284
   922
        val local_facts = facts_of ctxt;
wenzelm@26673
   923
        val thmref = Facts.map_name_of_ref (Facts.intern local_facts) xthmref;
wenzelm@26336
   924
        val name = Facts.name_of_ref thmref;
wenzelm@27821
   925
        val pos = Facts.pos_of_ref xthmref;
wenzelm@24012
   926
        val thms =
wenzelm@24012
   927
          if name = "" then [Thm.transfer thy Drule.dummy_thm]
wenzelm@24012
   928
          else
wenzelm@26393
   929
            (case Facts.lookup (Context.Proof ctxt) local_facts name of
wenzelm@27821
   930
              SOME (_, ths) => (Position.report (Markup.local_fact name) pos;
wenzelm@27821
   931
                map (Thm.transfer thy) (Facts.select thmref ths))
wenzelm@26687
   932
            | NONE => PureThy.get_fact (Context.Proof ctxt) thy xthmref);
wenzelm@24012
   933
      in pick name thms end;
wenzelm@5819
   934
wenzelm@26361
   935
in
wenzelm@26346
   936
wenzelm@26687
   937
val get_fact = retrieve_thms (K I);
wenzelm@26687
   938
val get_fact_single = retrieve_thms Facts.the_single;
wenzelm@26346
   939
wenzelm@26361
   940
fun get_thms ctxt = get_fact ctxt o Facts.named;
wenzelm@26361
   941
fun get_thm ctxt = get_fact_single ctxt o Facts.named;
wenzelm@26361
   942
wenzelm@26361
   943
end;
wenzelm@5819
   944
wenzelm@5819
   945
wenzelm@13425
   946
(* name space operations *)
wenzelm@12309
   947
haftmann@22352
   948
val add_path        = map_naming o NameSpace.add_path;
wenzelm@19062
   949
val no_base_names   = map_naming NameSpace.no_base_names;
wenzelm@16147
   950
val qualified_names = map_naming NameSpace.qualified_names;
wenzelm@19062
   951
val sticky_prefix   = map_naming o NameSpace.sticky_prefix;
wenzelm@19062
   952
val restore_naming  = map_naming o K o naming_of;
wenzelm@21728
   953
val reset_naming    = map_naming (K local_naming);
wenzelm@12309
   954
wenzelm@13425
   955
wenzelm@26284
   956
(* facts *)
wenzelm@5819
   957
wenzelm@28082
   958
local
wenzelm@28082
   959
wenzelm@26284
   960
fun update_thms _ (bname, NONE) ctxt = ctxt |> map_facts (Facts.del (full_name ctxt bname))
wenzelm@26284
   961
  | update_thms do_props (bname, SOME ths) ctxt = ctxt |> map_facts
wenzelm@26309
   962
      (Facts.add_local do_props (naming_of ctxt) (full_name ctxt bname, ths));
wenzelm@5819
   963
wenzelm@28082
   964
fun gen_note_thmss get k = fold_map (fn ((binding, more_attrs), raw_facts) => fn ctxt =>
wenzelm@5819
   965
  let
wenzelm@28082
   966
    val bname = Name.name_of binding;
wenzelm@28082
   967
    val pos = Name.pos_of binding;
wenzelm@21643
   968
    val name = full_name ctxt bname;
wenzelm@28082
   969
    val _ = Position.report (Markup.local_fact_decl name) pos;
wenzelm@28082
   970
wenzelm@28082
   971
    val facts = PureThy.name_thmss false pos name (map (apfst (get ctxt)) raw_facts);
wenzelm@21443
   972
    fun app (th, attrs) x =
wenzelm@28082
   973
      swap (foldl_map (Thm.proof_attributes (surround (Thm.kind k) (attrs @ more_attrs))) (x, th));
wenzelm@21443
   974
    val (res, ctxt') = fold_map app facts ctxt;
wenzelm@28082
   975
    val thms = PureThy.name_thms false false pos name (flat res);
wenzelm@24388
   976
    val Mode {stmt, ...} = get_mode ctxt;
wenzelm@28082
   977
  in ((name, thms), ctxt' |> update_thms stmt (bname, SOME thms)) end);
wenzelm@12711
   978
wenzelm@12711
   979
in
wenzelm@12711
   980
wenzelm@26346
   981
fun note_thmss k = gen_note_thmss get_fact k;
haftmann@21622
   982
fun note_thmss_i k = gen_note_thmss (K I) k;
ballarin@15696
   983
wenzelm@28082
   984
fun put_thms do_props thms ctxt =
wenzelm@28082
   985
  ctxt |> map_naming (K local_naming) |> update_thms do_props thms |> restore_naming ctxt;
wenzelm@28082
   986
wenzelm@12711
   987
end;
wenzelm@9196
   988
wenzelm@5819
   989
wenzelm@5819
   990
wenzelm@18672
   991
(** parameters **)
wenzelm@17360
   992
wenzelm@8096
   993
(* variables *)
wenzelm@8096
   994
wenzelm@19897
   995
fun declare_var (x, opt_T, mx) ctxt =
wenzelm@22701
   996
  let val T = (case opt_T of SOME T => T | NONE => Syntax.mixfixT mx)
wenzelm@20163
   997
  in ((x, T, mx), ctxt |> Variable.declare_constraints (Free (x, T))) end;
wenzelm@19897
   998
wenzelm@10381
   999
local
wenzelm@10381
  1000
wenzelm@25353
  1001
fun prep_vars prep_typ internal =
wenzelm@28082
  1002
  fold_map (fn (raw_binding, raw_T, raw_mx) => fn ctxt =>
wenzelm@18672
  1003
    let
wenzelm@28082
  1004
      val raw_x = Name.name_of raw_binding;
wenzelm@19371
  1005
      val (x, mx) = Syntax.const_mixfix raw_x raw_mx;
wenzelm@25353
  1006
      val _ = Syntax.is_identifier (no_skolem internal x) orelse
wenzelm@25353
  1007
        error ("Illegal variable name: " ^ quote x);
wenzelm@12504
  1008
wenzelm@18672
  1009
      fun cond_tvars T =
wenzelm@18672
  1010
        if internal then T
wenzelm@18678
  1011
        else Type.no_tvars T handle TYPE (msg, _, _) => error msg;
wenzelm@24277
  1012
      val opt_T = Option.map (cond_tvars o cert_typ ctxt o prep_typ ctxt) raw_T;
wenzelm@28082
  1013
      val var = (Name.map_name (K x) raw_binding, opt_T, mx);
wenzelm@28082
  1014
    in (var, ctxt |> declare_var (x, opt_T, mx) |> #2) end);
wenzelm@8096
  1015
wenzelm@10381
  1016
in
wenzelm@10381
  1017
wenzelm@25353
  1018
val read_vars = prep_vars Syntax.parse_typ false;
wenzelm@25353
  1019
val cert_vars = prep_vars (K I) true;
wenzelm@8096
  1020
wenzelm@10381
  1021
end;
wenzelm@10381
  1022
wenzelm@8096
  1023
wenzelm@19681
  1024
(* authentic constants *)
wenzelm@19663
  1025
wenzelm@25159
  1026
local
wenzelm@25159
  1027
wenzelm@25159
  1028
fun const_ast_tr intern ctxt [Syntax.Variable c] =
wenzelm@19681
  1029
      let
wenzelm@25345
  1030
        val Const (c', _) = read_const_proper ctxt c;
wenzelm@25159
  1031
        val d = if intern then const_syntax_name ctxt c' else c;
wenzelm@25159
  1032
      in Syntax.Constant d end
wenzelm@25159
  1033
  | const_ast_tr _ _ asts = raise Syntax.AST ("const_ast_tr", asts);
wenzelm@25159
  1034
wenzelm@25159
  1035
in
wenzelm@19681
  1036
wenzelm@26463
  1037
val _ = Context.>> (Context.map_theory
wenzelm@19681
  1038
 (Sign.add_syntax
wenzelm@19681
  1039
   [("_context_const", "id => 'a", Delimfix "CONST _"),
wenzelm@25159
  1040
    ("_context_const", "longid => 'a", Delimfix "CONST _"),
wenzelm@25159
  1041
    ("_context_xconst", "id => 'a", Delimfix "XCONST _"),
wenzelm@25159
  1042
    ("_context_xconst", "longid => 'a", Delimfix "XCONST _")] #>
wenzelm@25159
  1043
  Sign.add_advanced_trfuns
wenzelm@26463
  1044
    ([("_context_const", const_ast_tr true), ("_context_xconst", const_ast_tr false)], [], [], [])));
wenzelm@25159
  1045
wenzelm@25159
  1046
end;
wenzelm@19681
  1047
wenzelm@19663
  1048
wenzelm@21744
  1049
(* notation *)
wenzelm@21744
  1050
wenzelm@24949
  1051
local
wenzelm@24949
  1052
wenzelm@24949
  1053
fun const_syntax ctxt (Free (x, T), mx) = SOME (true, (x, T, mx))
wenzelm@24949
  1054
  | const_syntax ctxt (Const (c, _), mx) =
wenzelm@24949
  1055
      Option.map (pair false) (try (Consts.syntax (consts_of ctxt)) (c, mx))
wenzelm@24949
  1056
  | const_syntax _ _ = NONE;
wenzelm@24949
  1057
wenzelm@24949
  1058
in
wenzelm@21744
  1059
wenzelm@24949
  1060
fun notation add mode args ctxt =
wenzelm@24949
  1061
  ctxt |> map_syntax
wenzelm@24949
  1062
    (LocalSyntax.update_modesyntax (theory_of ctxt) add mode (map_filter (const_syntax ctxt) args));
wenzelm@24949
  1063
wenzelm@24949
  1064
fun target_notation add mode args phi =
wenzelm@24982
  1065
  let val args' = filter (fn (t, _) => Type.similar_types (t, Morphism.term phi t)) args;
wenzelm@24949
  1066
  in Context.mapping (Sign.notation add mode args') (notation add mode args') end;
wenzelm@24949
  1067
wenzelm@24949
  1068
end;
wenzelm@21744
  1069
wenzelm@21744
  1070
wenzelm@24767
  1071
(* local constants *)
wenzelm@24767
  1072
wenzelm@24767
  1073
fun add_const_constraint (c, opt_T) ctxt =
wenzelm@24767
  1074
  let
wenzelm@24767
  1075
    fun prepT raw_T =
wenzelm@24767
  1076
      let val T = cert_typ ctxt raw_T
wenzelm@24767
  1077
      in cert_term ctxt (Const (c, T)); T end;
haftmann@25039
  1078
  in ctxt |> (map_consts o apfst) (Consts.constrain (c, Option.map prepT opt_T)) end;
wenzelm@19001
  1079
wenzelm@24778
  1080
fun add_abbrev mode tags (c, raw_t) ctxt =
wenzelm@19001
  1081
  let
wenzelm@24675
  1082
    val t0 = cert_term (ctxt |> set_mode mode_abbrev) raw_t
wenzelm@21681
  1083
      handle ERROR msg => cat_error msg ("in constant abbreviation " ^ quote c);
wenzelm@20008
  1084
    val [t] = Variable.exportT_terms (Variable.declare_term t0 ctxt) ctxt [t0];
wenzelm@21807
  1085
    val ((lhs, rhs), consts') = consts_of ctxt
wenzelm@24961
  1086
      |> Consts.abbreviate (Syntax.pp ctxt) (tsig_of ctxt) (naming_of ctxt) mode tags (c, t);
wenzelm@19001
  1087
  in
wenzelm@19001
  1088
    ctxt
haftmann@25039
  1089
    |> (map_consts o apfst) (K consts')
wenzelm@21803
  1090
    |> Variable.declare_term rhs
wenzelm@21803
  1091
    |> pair (lhs, rhs)
wenzelm@21704
  1092
  end;
wenzelm@19001
  1093
wenzelm@25052
  1094
fun revert_abbrev mode c = (map_consts o apfst) (Consts.revert_abbrev mode c);
wenzelm@25052
  1095
wenzelm@19001
  1096
wenzelm@18672
  1097
(* fixes *)
wenzelm@5819
  1098
wenzelm@8096
  1099
local
wenzelm@8096
  1100
wenzelm@19001
  1101
fun prep_mixfix (x, T, mx) =
wenzelm@19019
  1102
  if mx <> NoSyn andalso mx <> Structure andalso
wenzelm@20086
  1103
      (can Name.dest_internal x orelse can Name.dest_skolem x) then
wenzelm@19001
  1104
    error ("Illegal mixfix syntax for internal/skolem constant " ^ quote x)
wenzelm@19001
  1105
  else (true, (x, T, mx));
wenzelm@19001
  1106
wenzelm@18844
  1107
fun gen_fixes prep raw_vars ctxt =
wenzelm@8096
  1108
  let
wenzelm@22712
  1109
    val (vars, _) = prep raw_vars ctxt;
wenzelm@28082
  1110
    val (xs', ctxt') = Variable.add_fixes (map (Name.name_of o #1) vars) ctxt;
wenzelm@28082
  1111
    val ctxt'' =
wenzelm@28082
  1112
      ctxt'
wenzelm@28082
  1113
      |> fold_map declare_var (map2 (fn x' => fn (_, T, mx) => (x', T, mx)) xs' vars)
wenzelm@28082
  1114
      |-> (map_syntax o LocalSyntax.add_syntax (theory_of ctxt) o map prep_mixfix);
wenzelm@28082
  1115
    val _ = (vars ~~ xs') |> List.app (fn ((binding, _, _), x') =>
wenzelm@28082
  1116
      Position.report (Markup.fixed_decl x') (Name.pos_of binding));
wenzelm@28082
  1117
  in (xs', ctxt'') end;
wenzelm@5819
  1118
wenzelm@8096
  1119
in
wenzelm@7679
  1120
wenzelm@18844
  1121
val add_fixes = gen_fixes read_vars;
wenzelm@18844
  1122
val add_fixes_i = gen_fixes cert_vars;
wenzelm@8096
  1123
wenzelm@8096
  1124
end;
wenzelm@5819
  1125
wenzelm@18672
  1126
wenzelm@18672
  1127
(* fixes vs. frees *)
wenzelm@12016
  1128
wenzelm@18672
  1129
fun auto_fixes (arg as (ctxt, (propss, x))) =
wenzelm@21370
  1130
  ((fold o fold) Variable.auto_fixes propss ctxt, (propss, x));
wenzelm@18672
  1131
wenzelm@18672
  1132
fun bind_fixes xs ctxt =
wenzelm@9291
  1133
  let
wenzelm@28082
  1134
    val (_, ctxt') = ctxt |> add_fixes_i (map (fn x => (Name.binding x, NONE, NoSyn)) xs);
wenzelm@9291
  1135
    fun bind (t as Free (x, T)) =
wenzelm@18340
  1136
          if member (op =) xs x then
skalberg@15531
  1137
            (case lookup_skolem ctxt' x of SOME x' => Free (x', T) | NONE => t)
wenzelm@9291
  1138
          else t
wenzelm@9291
  1139
      | bind (t $ u) = bind t $ bind u
wenzelm@9291
  1140
      | bind (Abs (x, T, t)) = Abs (x, T, bind t)
wenzelm@9291
  1141
      | bind a = a;
wenzelm@18672
  1142
  in (bind, ctxt') end;
wenzelm@18672
  1143
wenzelm@9291
  1144
wenzelm@9291
  1145
wenzelm@18672
  1146
(** assumptions **)
wenzelm@18187
  1147
wenzelm@20209
  1148
local
wenzelm@20209
  1149
wenzelm@20209
  1150
fun gen_assms prepp exp args ctxt =
wenzelm@20209
  1151
  let
wenzelm@20234
  1152
    val cert = Thm.cterm_of (theory_of ctxt);
wenzelm@20209
  1153
    val (propss, ctxt1) = swap (prepp (ctxt, map snd args));
wenzelm@20234
  1154
    val _ = Variable.warn_extra_tfrees ctxt ctxt1;
wenzelm@20234
  1155
    val (premss, ctxt2) = fold_burrow (Assumption.add_assms exp o map cert) propss ctxt1;
wenzelm@20234
  1156
  in
wenzelm@20234
  1157
    ctxt2
wenzelm@20234
  1158
    |> auto_bind_facts (flat propss)
wenzelm@21443
  1159
    |> note_thmss_i Thm.assumptionK (map fst args ~~ map (map (fn th => ([th], []))) premss)
wenzelm@20234
  1160
  end;
wenzelm@20209
  1161
wenzelm@20209
  1162
in
wenzelm@20209
  1163
wenzelm@20209
  1164
val add_assms = gen_assms (apsnd #1 o bind_propp);
wenzelm@20209
  1165
val add_assms_i = gen_assms (apsnd #1 o bind_propp_i);
wenzelm@20209
  1166
wenzelm@20209
  1167
end;
wenzelm@20209
  1168
wenzelm@20209
  1169
wenzelm@5819
  1170
wenzelm@8373
  1171
(** cases **)
wenzelm@8373
  1172
wenzelm@16147
  1173
local
wenzelm@16147
  1174
wenzelm@16668
  1175
fun rem_case name = remove (fn (x: string, (y, _)) => x = y) name;
wenzelm@16147
  1176
wenzelm@18476
  1177
fun add_case _ ("", _) cases = cases
wenzelm@18476
  1178
  | add_case _ (name, NONE) cases = rem_case name cases
wenzelm@18476
  1179
  | add_case is_proper (name, SOME c) cases = (name, (c, is_proper)) :: rem_case name cases;
wenzelm@16147
  1180
wenzelm@18678
  1181
fun prep_case name fxs c =
wenzelm@18609
  1182
  let
wenzelm@18609
  1183
    fun replace (opt_x :: xs) ((y, T) :: ys) = (the_default y opt_x, T) :: replace xs ys
wenzelm@18609
  1184
      | replace [] ys = ys
wenzelm@18678
  1185
      | replace (_ :: _) [] = error ("Too many parameters for case " ^ quote name);
wenzelm@18609
  1186
    val RuleCases.Case {fixes, assumes, binds, cases} = c;
wenzelm@18609
  1187
    val fixes' = replace fxs fixes;
wenzelm@18609
  1188
    val binds' = map drop_schematic binds;
wenzelm@18609
  1189
  in
wenzelm@18609
  1190
    if null (fold (Term.add_tvarsT o snd) fixes []) andalso
wenzelm@18609
  1191
      null (fold (fold Term.add_vars o snd) assumes []) then
wenzelm@18609
  1192
        RuleCases.Case {fixes = fixes', assumes = assumes, binds = binds', cases = cases}
wenzelm@18678
  1193
    else error ("Illegal schematic variable(s) in case " ^ quote name)
wenzelm@18609
  1194
  end;
wenzelm@18609
  1195
wenzelm@18672
  1196
fun fix (x, T) ctxt =
wenzelm@18672
  1197
  let
wenzelm@18672
  1198
    val (bind, ctxt') = bind_fixes [x] ctxt;
wenzelm@18672
  1199
    val t = bind (Free (x, T));
wenzelm@20163
  1200
  in (t, ctxt' |> Variable.declare_constraints t) end;
wenzelm@18672
  1201
wenzelm@16147
  1202
in
wenzelm@16147
  1203
wenzelm@18672
  1204
fun add_cases is_proper = map_cases o fold (add_case is_proper);
wenzelm@18609
  1205
wenzelm@18609
  1206
fun case_result c ctxt =
wenzelm@18609
  1207
  let
wenzelm@18609
  1208
    val RuleCases.Case {fixes, ...} = c;
wenzelm@18672
  1209
    val (ts, ctxt') = ctxt |> fold_map fix fixes;
wenzelm@18672
  1210
    val RuleCases.Case {assumes, binds, cases, ...} = RuleCases.apply ts c;
wenzelm@18609
  1211
  in
wenzelm@18609
  1212
    ctxt'
wenzelm@18699
  1213
    |> add_binds_i (map drop_schematic binds)
wenzelm@18609
  1214
    |> add_cases true (map (apsnd SOME) cases)
wenzelm@18609
  1215
    |> pair (assumes, (binds, cases))
wenzelm@18609
  1216
  end;
wenzelm@18609
  1217
wenzelm@18609
  1218
val apply_case = apfst fst oo case_result;
wenzelm@18609
  1219
wenzelm@16540
  1220
fun get_case ctxt name xs =
wenzelm@17184
  1221
  (case AList.lookup (op =) (cases_of ctxt) name of
wenzelm@18678
  1222
    NONE => error ("Unknown case: " ^ quote name)
wenzelm@18678
  1223
  | SOME (c, _) => prep_case name xs c);
wenzelm@8373
  1224
wenzelm@16147
  1225
end;
wenzelm@8373
  1226
wenzelm@8373
  1227
wenzelm@8373
  1228
wenzelm@10810
  1229
(** print context information **)
wenzelm@10810
  1230
wenzelm@20310
  1231
val debug = ref false;
wenzelm@20310
  1232
wenzelm@10810
  1233
val verbose = ref false;
wenzelm@10810
  1234
fun verb f x = if ! verbose then f (x ()) else [];
wenzelm@10810
  1235
wenzelm@10810
  1236
fun setmp_verbose f x = Library.setmp verbose true f x;
wenzelm@10810
  1237
wenzelm@10810
  1238
wenzelm@12072
  1239
(* local syntax *)
wenzelm@12072
  1240
wenzelm@12093
  1241
val print_syntax = Syntax.print_syntax o syn_of;
wenzelm@12072
  1242
wenzelm@12072
  1243
wenzelm@21728
  1244
(* abbreviations *)
wenzelm@18971
  1245
wenzelm@21728
  1246
fun pretty_abbrevs show_globals ctxt =
wenzelm@18971
  1247
  let
wenzelm@25052
  1248
    val ((space, consts), (_, globals)) =
wenzelm@19033
  1249
      pairself (#constants o Consts.dest) (#consts (rep_context ctxt));
wenzelm@21803
  1250
    fun add_abbr (_, (_, NONE)) = I
wenzelm@25406
  1251
      | add_abbr (c, (T, SOME t)) =
wenzelm@21728
  1252
          if not show_globals andalso Symtab.defined globals c then I
wenzelm@21728
  1253
          else cons (c, Logic.mk_equals (Const (c, T), t));
wenzelm@21803
  1254
    val abbrevs = NameSpace.extern_table (space, Symtab.make (Symtab.fold add_abbr consts []));
wenzelm@18971
  1255
  in
wenzelm@18971
  1256
    if null abbrevs andalso not (! verbose) then []
wenzelm@21728
  1257
    else [Pretty.big_list "abbreviations:" (map (pretty_term_abbrev ctxt o #2) abbrevs)]
wenzelm@18971
  1258
  end;
wenzelm@18971
  1259
wenzelm@21728
  1260
val print_abbrevs = Pretty.writeln o Pretty.chunks o pretty_abbrevs true;
wenzelm@21728
  1261
wenzelm@18971
  1262
wenzelm@10810
  1263
(* term bindings *)
wenzelm@10810
  1264
wenzelm@16540
  1265
fun pretty_binds ctxt =
wenzelm@10810
  1266
  let
wenzelm@19897
  1267
    val binds = Variable.binds_of ctxt;
wenzelm@21728
  1268
    fun prt_bind (xi, (T, t)) = pretty_term_abbrev ctxt (Logic.mk_equals (Var (xi, T), t));
wenzelm@10810
  1269
  in
wenzelm@15758
  1270
    if Vartab.is_empty binds andalso not (! verbose) then []
wenzelm@15758
  1271
    else [Pretty.big_list "term bindings:" (map prt_bind (Vartab.dest binds))]
wenzelm@10810
  1272
  end;
wenzelm@10810
  1273
wenzelm@10810
  1274
val print_binds = Pretty.writeln o Pretty.chunks o pretty_binds;
wenzelm@10810
  1275
wenzelm@10810
  1276
wenzelm@10810
  1277
(* local theorems *)
wenzelm@10810
  1278
wenzelm@16540
  1279
fun pretty_lthms ctxt =
wenzelm@20012
  1280
  let
wenzelm@26284
  1281
    val local_facts = facts_of ctxt;
wenzelm@26284
  1282
    val props = Facts.props local_facts;
wenzelm@26673
  1283
    val facts =
wenzelm@27173
  1284
      (if null props then [] else [("unnamed", props)]) @
wenzelm@28212
  1285
      Facts.dest_static [] local_facts;
wenzelm@20012
  1286
  in
wenzelm@20012
  1287
    if null facts andalso not (! verbose) then []
wenzelm@28212
  1288
    else [Pretty.big_list "facts:" (map #1 (sort_wrt (#1 o #2) (map (`(pretty_fact ctxt)) facts)))]
wenzelm@20012
  1289
  end;
wenzelm@10810
  1290
wenzelm@12057
  1291
val print_lthms = Pretty.writeln o Pretty.chunks o pretty_lthms;
wenzelm@10810
  1292
wenzelm@10810
  1293
wenzelm@10810
  1294
(* local contexts *)
wenzelm@10810
  1295
wenzelm@26722
  1296
local
wenzelm@26722
  1297
wenzelm@26722
  1298
fun pretty_case (name, (fixes, ((asms, (lets, cs)), ctxt))) =
wenzelm@10810
  1299
  let
wenzelm@24922
  1300
    val prt_term = Syntax.pretty_term ctxt;
wenzelm@12057
  1301
wenzelm@10810
  1302
    fun prt_let (xi, t) = Pretty.block
wenzelm@10818
  1303
      [Pretty.quote (prt_term (Var (xi, Term.fastype_of t))), Pretty.str " =", Pretty.brk 1,
wenzelm@10810
  1304
        Pretty.quote (prt_term t)];
wenzelm@10810
  1305
wenzelm@13425
  1306
    fun prt_asm (a, ts) = Pretty.block (Pretty.breaks
wenzelm@13425
  1307
      ((if a = "" then [] else [Pretty.str (a ^ ":")]) @ map (Pretty.quote o prt_term) ts));
wenzelm@13425
  1308
wenzelm@10810
  1309
    fun prt_sect _ _ _ [] = []
wenzelm@10810
  1310
      | prt_sect s sep prt xs = [Pretty.block (Pretty.breaks (Pretty.str s ::
wenzelm@19482
  1311
            flat (Library.separate sep (map (Library.single o prt) xs))))];
wenzelm@26722
  1312
  in
wenzelm@26722
  1313
    Pretty.block (Pretty.fbreaks
wenzelm@10810
  1314
      (Pretty.str (name ^ ":") ::
wenzelm@11915
  1315
        prt_sect "fix" [] (Pretty.str o fst) fixes @
wenzelm@10810
  1316
        prt_sect "let" [Pretty.str "and"] prt_let
wenzelm@19482
  1317
          (map_filter (fn (xi, SOME t) => SOME (xi, t) | _ => NONE) lets) @
wenzelm@13425
  1318
        (if forall (null o #2) asms then []
wenzelm@18609
  1319
          else prt_sect "assume" [Pretty.str "and"] prt_asm asms) @
wenzelm@26722
  1320
        prt_sect "subcases:" [] (Pretty.str o fst) cs))
wenzelm@26722
  1321
  end;
wenzelm@16540
  1322
wenzelm@26722
  1323
in
wenzelm@26722
  1324
wenzelm@26722
  1325
fun pretty_cases ctxt =
wenzelm@26722
  1326
  let
wenzelm@18476
  1327
    fun add_case (_, (_, false)) = I
wenzelm@18609
  1328
      | add_case (name, (c as RuleCases.Case {fixes, ...}, true)) =
wenzelm@26722
  1329
          cons (name, (fixes, case_result c ctxt));
wenzelm@18476
  1330
    val cases = fold add_case (cases_of ctxt) [];
wenzelm@10810
  1331
  in
wenzelm@10810
  1332
    if null cases andalso not (! verbose) then []
wenzelm@26722
  1333
    else [Pretty.big_list "cases:" (map pretty_case cases)]
wenzelm@10810
  1334
  end;
wenzelm@10810
  1335
wenzelm@10810
  1336
val print_cases = Pretty.writeln o Pretty.chunks o pretty_cases;
wenzelm@10810
  1337
wenzelm@26722
  1338
end;
wenzelm@26722
  1339
wenzelm@10810
  1340
wenzelm@12057
  1341
(* core context *)
wenzelm@10810
  1342
wenzelm@20367
  1343
val prems_limit = ref ~1;
wenzelm@10810
  1344
wenzelm@18672
  1345
fun pretty_ctxt ctxt =
wenzelm@20310
  1346
  if ! prems_limit < 0 andalso not (! debug) then []
wenzelm@20310
  1347
  else
wenzelm@20310
  1348
    let
wenzelm@24922
  1349
      val prt_term = Syntax.pretty_term ctxt;
wenzelm@12057
  1350
wenzelm@20310
  1351
      (*structures*)
wenzelm@20310
  1352
      val structs = LocalSyntax.structs_of (syntax_of ctxt);
wenzelm@20310
  1353
      val prt_structs = if null structs then []
wenzelm@20310
  1354
        else [Pretty.block (Pretty.str "structures:" :: Pretty.brk 1 ::
wenzelm@20310
  1355
          Pretty.commas (map Pretty.str structs))];
wenzelm@12093
  1356
wenzelm@20310
  1357
      (*fixes*)
wenzelm@20310
  1358
      fun prt_fix (x, x') =
wenzelm@20310
  1359
        if x = x' then Pretty.str x
wenzelm@20310
  1360
        else Pretty.block [Pretty.str x, Pretty.str " =", Pretty.brk 1, prt_term (Syntax.free x')];
wenzelm@20310
  1361
      val fixes =
wenzelm@20310
  1362
        rev (filter_out ((can Name.dest_internal orf member (op =) structs) o #1)
wenzelm@20310
  1363
          (Variable.fixes_of ctxt));
wenzelm@20310
  1364
      val prt_fixes = if null fixes then []
wenzelm@20310
  1365
        else [Pretty.block (Pretty.str "fixed variables:" :: Pretty.brk 1 ::
wenzelm@20310
  1366
          Pretty.commas (map prt_fix fixes))];
wenzelm@12057
  1367
wenzelm@20310
  1368
      (*prems*)
wenzelm@20310
  1369
      val prems = Assumption.prems_of ctxt;
wenzelm@20310
  1370
      val len = length prems;
wenzelm@20367
  1371
      val suppressed = len - ! prems_limit;
wenzelm@20310
  1372
      val prt_prems = if null prems then []
wenzelm@20367
  1373
        else [Pretty.big_list "prems:" ((if suppressed <= 0 then [] else [Pretty.str "..."]) @
wenzelm@20367
  1374
          map (pretty_thm ctxt) (Library.drop (suppressed, prems)))];
wenzelm@20310
  1375
    in prt_structs @ prt_fixes @ prt_prems end;
wenzelm@10810
  1376
wenzelm@10810
  1377
wenzelm@10810
  1378
(* main context *)
wenzelm@10810
  1379
wenzelm@16540
  1380
fun pretty_context ctxt =
wenzelm@10810
  1381
  let
wenzelm@24922
  1382
    val prt_term = Syntax.pretty_term ctxt;
wenzelm@24922
  1383
    val prt_typ = Syntax.pretty_typ ctxt;
wenzelm@24922
  1384
    val prt_sort = Syntax.pretty_sort ctxt;
wenzelm@10810
  1385
wenzelm@10810
  1386
    (*theory*)
wenzelm@12057
  1387
    val pretty_thy = Pretty.block
wenzelm@17384
  1388
      [Pretty.str "theory:", Pretty.brk 1, Context.pretty_thy (theory_of ctxt)];
wenzelm@10810
  1389
wenzelm@10810
  1390
    (*defaults*)
wenzelm@10810
  1391
    fun prt_atom prt prtT (x, X) = Pretty.block
wenzelm@10810
  1392
      [prt x, Pretty.str " ::", Pretty.brk 1, prtT X];
wenzelm@10810
  1393
wenzelm@10810
  1394
    fun prt_var (x, ~1) = prt_term (Syntax.free x)
wenzelm@10810
  1395
      | prt_var xi = prt_term (Syntax.var xi);
wenzelm@10810
  1396
wenzelm@10810
  1397
    fun prt_varT (x, ~1) = prt_typ (TFree (x, []))
wenzelm@10810
  1398
      | prt_varT xi = prt_typ (TVar (xi, []));
wenzelm@10810
  1399
wenzelm@10810
  1400
    val prt_defT = prt_atom prt_var prt_typ;
wenzelm@10810
  1401
    val prt_defS = prt_atom prt_varT prt_sort;
wenzelm@16540
  1402
wenzelm@20163
  1403
    val (types, sorts) = Variable.constraints_of ctxt;
wenzelm@10810
  1404
  in
wenzelm@18609
  1405
    verb single (K pretty_thy) @
wenzelm@18672
  1406
    pretty_ctxt ctxt @
wenzelm@21728
  1407
    verb (pretty_abbrevs false) (K ctxt) @
wenzelm@10810
  1408
    verb pretty_binds (K ctxt) @
wenzelm@12057
  1409
    verb pretty_lthms (K ctxt) @
wenzelm@10810
  1410
    verb pretty_cases (K ctxt) @
wenzelm@18609
  1411
    verb single (fn () => Pretty.big_list "type constraints:" (map prt_defT (Vartab.dest types))) @
wenzelm@20163
  1412
    verb single (fn () => Pretty.big_list "default sorts:" (map prt_defS (Vartab.dest sorts)))
wenzelm@10810
  1413
  end;
wenzelm@10810
  1414
wenzelm@27314
  1415
wenzelm@27314
  1416
(* query meta data *)
wenzelm@27314
  1417
wenzelm@27314
  1418
val query_type = Type.the_tags o tsig_of;
wenzelm@27314
  1419
wenzelm@27314
  1420
fun query_const ctxt name =
wenzelm@27314
  1421
  Consts.the_tags (consts_of ctxt) name handle TYPE (msg, _, _) => error msg;
wenzelm@27314
  1422
wenzelm@27314
  1423
fun query_class ctxt name = query_const ctxt (Logic.const_of_class name);
wenzelm@27314
  1424
wenzelm@5819
  1425
end;