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