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