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