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