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