src/Pure/Isar/theory_target.ML
author wenzelm
Sat Dec 13 17:46:13 2008 +0100 (2008-12-13)
changeset 29102 2e1011dcd577
parent 29006 abe0f11cfa4e
child 29252 ea97aa6aeba2
permissions -rw-r--r--
removed Ids;
     1 (*  Title:      Pure/Isar/theory_target.ML
     2     Author:     Makarius
     3 
     4 Common theory/locale/class/instantiation/overloading targets.
     5 *)
     6 
     7 signature THEORY_TARGET =
     8 sig
     9   val peek: local_theory -> {target: string, is_locale: bool,
    10     is_class: bool, instantiation: string list * (string * sort) list * sort,
    11     overloading: (string * (string * typ) * bool) list}
    12   val init: string option -> theory -> local_theory
    13   val begin: string -> Proof.context -> local_theory
    14   val context: xstring -> theory -> local_theory
    15   val instantiation: string list * (string * sort) list * sort -> theory -> local_theory
    16   val overloading: (string * (string * typ) * bool) list -> theory -> local_theory
    17   val overloading_cmd: (string * string * bool) list -> theory -> local_theory
    18 end;
    19 
    20 structure TheoryTarget: THEORY_TARGET =
    21 struct
    22 
    23 (* new locales *)
    24 
    25 fun locale_extern x = if !new_locales then NewLocale.extern x else Locale.extern x;
    26 fun locale_add_type_syntax x = if !new_locales then NewLocale.add_type_syntax x else Locale.add_type_syntax x;
    27 fun locale_add_term_syntax x = if !new_locales then NewLocale.add_term_syntax x else Locale.add_term_syntax x;
    28 fun locale_add_declaration x = if !new_locales then NewLocale.add_declaration x else Locale.add_declaration x;
    29 fun locale_add_thmss x = if !new_locales then NewLocale.add_thmss x else Locale.add_thmss x;
    30 fun locale_init x = if !new_locales then NewLocale.init x else Locale.init x;
    31 fun locale_intern x = if !new_locales then NewLocale.intern x else Locale.intern x;
    32 
    33 (* context data *)
    34 
    35 datatype target = Target of {target: string, is_locale: bool,
    36   is_class: bool, instantiation: string list * (string * sort) list * sort,
    37   overloading: (string * (string * typ) * bool) list};
    38 
    39 fun make_target target is_locale is_class instantiation overloading =
    40   Target {target = target, is_locale = is_locale,
    41     is_class = is_class, instantiation = instantiation, overloading = overloading};
    42 
    43 val global_target = make_target "" false false ([], [], []) [];
    44 
    45 structure Data = ProofDataFun
    46 (
    47   type T = target;
    48   fun init _ = global_target;
    49 );
    50 
    51 val peek = (fn Target args => args) o Data.get;
    52 
    53 
    54 (* pretty *)
    55 
    56 fun pretty_thy ctxt target is_locale is_class =
    57   let
    58     val thy = ProofContext.theory_of ctxt;
    59     val target_name = (if is_class then "class " else "locale ") ^ locale_extern thy target;
    60     val fixes = map (fn (x, T) => (Binding.name x, SOME T, NoSyn))
    61       (#1 (ProofContext.inferred_fixes ctxt));
    62     val assumes = map (fn A => (Attrib.empty_binding, [(Thm.term_of A, [])]))
    63       (Assumption.assms_of ctxt);
    64     val elems =
    65       (if null fixes then [] else [Element.Fixes fixes]) @
    66       (if null assumes then [] else [Element.Assumes assumes]);
    67   in
    68     if target = "" then []
    69     else if null elems then [Pretty.str target_name]
    70     else [Pretty.big_list (target_name ^ " =")
    71       (map (Pretty.chunks o Element.pretty_ctxt ctxt) elems)]
    72   end;
    73 
    74 fun pretty (Target {target, is_locale, is_class, instantiation, overloading}) ctxt =
    75   Pretty.block [Pretty.str "theory", Pretty.brk 1,
    76       Pretty.str (Context.theory_name (ProofContext.theory_of ctxt))] ::
    77     (if not (null overloading) then [Overloading.pretty ctxt]
    78      else if not (null (#1 instantiation)) then [Class.pretty_instantiation ctxt]
    79      else pretty_thy ctxt target is_locale is_class);
    80 
    81 
    82 (* target declarations *)
    83 
    84 fun target_decl add (Target {target, is_class, ...}) d lthy =
    85   let
    86     val d' = Morphism.transform (LocalTheory.target_morphism lthy) d;
    87     val d0 = Morphism.form d';
    88   in
    89     if target = "" then
    90       lthy
    91       |> LocalTheory.theory (Context.theory_map d0)
    92       |> LocalTheory.target (Context.proof_map d0)
    93     else
    94       lthy
    95       |> LocalTheory.target (add target d')
    96   end;
    97 
    98 val type_syntax = target_decl locale_add_type_syntax;
    99 val term_syntax = target_decl locale_add_term_syntax;
   100 val declaration = target_decl locale_add_declaration;
   101 
   102 fun class_target (Target {target, ...}) f =
   103   LocalTheory.raw_theory f #>
   104   LocalTheory.target (Class.refresh_syntax target);
   105 
   106 
   107 (* notes *)
   108 
   109 fun import_export_proof ctxt (name, raw_th) =
   110   let
   111     val thy = ProofContext.theory_of ctxt;
   112     val thy_ctxt = ProofContext.init thy;
   113     val certT = Thm.ctyp_of thy;
   114     val cert = Thm.cterm_of thy;
   115 
   116     (*export assumes/defines*)
   117     val th = Goal.norm_result raw_th;
   118     val (defs, th') = LocalDefs.export ctxt thy_ctxt th;
   119     val concl_conv = MetaSimplifier.rewrite true defs (Thm.cprop_of th);
   120     val assms = map (MetaSimplifier.rewrite_rule defs o Thm.assume) (Assumption.assms_of ctxt);
   121     val nprems = Thm.nprems_of th' - Thm.nprems_of th;
   122 
   123     (*export fixes*)
   124     val tfrees = map TFree (Thm.fold_terms Term.add_tfrees th' []);
   125     val frees = map Free (Thm.fold_terms Term.add_frees th' []);
   126     val (th'' :: vs) = (th' :: map (Drule.mk_term o cert) (map Logic.mk_type tfrees @ frees))
   127       |> Variable.export ctxt thy_ctxt
   128       |> Drule.zero_var_indexes_list;
   129 
   130     (*thm definition*)
   131     val result = PureThy.name_thm true true Position.none name th'';
   132 
   133     (*import fixes*)
   134     val (tvars, vars) =
   135       chop (length tfrees) (map (Thm.term_of o Drule.dest_term) vs)
   136       |>> map Logic.dest_type;
   137 
   138     val instT = map_filter (fn (TVar v, T) => SOME (v, T) | _ => NONE) (tvars ~~ tfrees);
   139     val inst = filter (is_Var o fst) (vars ~~ frees);
   140     val cinstT = map (pairself certT o apfst TVar) instT;
   141     val cinst = map (pairself (cert o Term.map_types (TermSubst.instantiateT instT))) inst;
   142     val result' = Thm.instantiate (cinstT, cinst) result;
   143 
   144     (*import assumes/defines*)
   145     val assm_tac = FIRST' (map (fn assm => Tactic.compose_tac (false, assm, 0)) assms);
   146     val result'' =
   147       (case SINGLE (Seq.INTERVAL assm_tac 1 nprems) result' of
   148         NONE => raise THM ("Failed to re-import result", 0, [result'])
   149       | SOME res => LocalDefs.trans_props ctxt [res, Thm.symmetric concl_conv])
   150       |> Goal.norm_result
   151       |> PureThy.name_thm false false Position.none name;
   152 
   153   in (result'', result) end;
   154 
   155 fun note_local kind facts ctxt =
   156   ctxt
   157   |> ProofContext.qualified_names
   158   |> ProofContext.note_thmss_i kind facts
   159   ||> ProofContext.restore_naming ctxt;
   160 
   161 fun notes (Target {target, is_locale, is_class, ...}) kind facts lthy =
   162   let
   163     val thy = ProofContext.theory_of lthy;
   164     val facts' = facts
   165       |> map (fn (a, bs) => (a, PureThy.burrow_fact (PureThy.name_multi
   166           (LocalTheory.full_name lthy (fst a))) bs))
   167       |> PureThy.map_facts (import_export_proof lthy);
   168     val local_facts = PureThy.map_facts #1 facts'
   169       |> Attrib.map_facts (Attrib.attribute_i thy);
   170     val target_facts = PureThy.map_facts #1 facts'
   171       |> is_locale ? Element.facts_map (Element.morph_ctxt (LocalTheory.target_morphism lthy));
   172     val global_facts = PureThy.map_facts #2 facts'
   173       |> Attrib.map_facts (if is_locale then K I else Attrib.attribute_i thy);
   174   in
   175     lthy |> LocalTheory.theory
   176       (Sign.qualified_names
   177         #> PureThy.note_thmss_grouped kind (LocalTheory.group_of lthy) global_facts #> snd
   178         #> Sign.restore_naming thy)
   179     |> not is_locale ? LocalTheory.target (note_local kind global_facts #> snd)
   180     |> is_locale ? LocalTheory.target (locale_add_thmss target kind target_facts)
   181     |> note_local kind local_facts
   182   end;
   183 
   184 
   185 (* declare_const *)
   186 
   187 fun fork_mixfix (Target {is_locale, is_class, ...}) mx =
   188   if not is_locale then (NoSyn, NoSyn, mx)
   189   else if not is_class then (NoSyn, mx, NoSyn)
   190   else (mx, NoSyn, NoSyn);
   191 
   192 fun locale_const (Target {target, is_class, ...}) (prmode as (mode, _)) tags ((b, mx), rhs) phi =
   193   let
   194     val b' = Morphism.binding phi b;
   195     val rhs' = Morphism.term phi rhs;
   196     val legacy_arg = (b', Term.close_schematic_term (Logic.legacy_varify rhs'));
   197     val arg = (b', Term.close_schematic_term rhs');
   198     val similar_body = Type.similar_types (rhs, rhs');
   199     (* FIXME workaround based on educated guess *)
   200     val (prefix', _) = Binding.dest b';
   201     val class_global = Binding.base_name b = Binding.base_name b'
   202       andalso not (null prefix')
   203       andalso (fst o snd o split_last) prefix' = Class.class_prefix target;
   204   in
   205     not (is_class andalso (similar_body orelse class_global)) ?
   206       (Context.mapping_result
   207         (fn thy => thy |> 
   208           Sign.no_base_names
   209           |> Sign.add_abbrev PrintMode.internal tags legacy_arg
   210           ||> Sign.restore_naming thy)
   211         (ProofContext.add_abbrev PrintMode.internal tags arg)
   212       #-> (fn (lhs' as Const (d, _), _) =>
   213           similar_body ?
   214             (Context.mapping (Sign.revert_abbrev mode d) (ProofContext.revert_abbrev mode d) #>
   215              Morphism.form (ProofContext.target_notation true prmode [(lhs', mx)]))))
   216   end;
   217 
   218 fun declare_const (ta as Target {target, is_locale, is_class, ...}) depends ((b, T), mx) lthy =
   219   let
   220     val c = Binding.base_name b;
   221     val tags = LocalTheory.group_position_of lthy;
   222     val xs = filter depends (#1 (ProofContext.inferred_fixes (LocalTheory.target_of lthy)));
   223     val U = map #2 xs ---> T;
   224     val (mx1, mx2, mx3) = fork_mixfix ta mx;
   225     fun syntax_error c = error ("Illegal mixfix syntax for overloaded constant " ^ quote c);
   226     val declare_const =
   227       (case Class.instantiation_param lthy c of
   228         SOME c' =>
   229           if mx3 <> NoSyn then syntax_error c'
   230           else LocalTheory.theory_result (AxClass.declare_overloaded (c', U))
   231             ##> Class.confirm_declaration c
   232         | NONE =>
   233             (case Overloading.operation lthy c of
   234               SOME (c', _) =>
   235                 if mx3 <> NoSyn then syntax_error c'
   236                 else LocalTheory.theory_result (Overloading.declare (c', U))
   237                   ##> Overloading.confirm c
   238             | NONE => LocalTheory.theory_result (Sign.declare_const tags ((b, U), mx3))));
   239     val (const, lthy') = lthy |> declare_const;
   240     val t = Term.list_comb (const, map Free xs);
   241   in
   242     lthy'
   243     |> is_locale ? term_syntax ta (locale_const ta Syntax.mode_default tags ((b, mx2), t))
   244     |> is_class ? class_target ta (Class.declare target tags ((c, mx1), t))
   245     |> LocalDefs.add_def ((b, NoSyn), t)
   246   end;
   247 
   248 
   249 (* abbrev *)
   250 
   251 fun abbrev (ta as Target {target, is_locale, is_class, ...}) prmode ((b, mx), t) lthy =
   252   let
   253     val c = Binding.base_name b;
   254     val tags = LocalTheory.group_position_of lthy;
   255     val thy_ctxt = ProofContext.init (ProofContext.theory_of lthy);
   256     val target_ctxt = LocalTheory.target_of lthy;
   257 
   258     val (mx1, mx2, mx3) = fork_mixfix ta mx;
   259     val t' = Assumption.export_term lthy target_ctxt t;
   260     val xs = map Free (rev (Variable.add_fixed target_ctxt t' []));
   261     val u = fold_rev lambda xs t';
   262     val global_rhs =
   263       singleton (Variable.export_terms (Variable.declare_term u target_ctxt) thy_ctxt) u;
   264   in
   265     lthy |>
   266      (if is_locale then
   267         LocalTheory.theory_result (Sign.add_abbrev PrintMode.internal tags (b, global_rhs))
   268         #-> (fn (lhs, _) =>
   269           let val lhs' = Term.list_comb (Logic.unvarify lhs, xs) in
   270             term_syntax ta (locale_const ta prmode tags ((b, mx2), lhs')) #>
   271             is_class ? class_target ta (Class.abbrev target prmode tags ((c, mx1), t'))
   272           end)
   273       else
   274         LocalTheory.theory
   275           (Sign.add_abbrev (#1 prmode) tags (b, global_rhs) #-> (fn (lhs, _) =>
   276            Sign.notation true prmode [(lhs, mx3)])))
   277     |> ProofContext.add_abbrev PrintMode.internal tags (b, t) |> snd
   278     |> LocalDefs.fixed_abbrev ((b, NoSyn), t)
   279   end;
   280 
   281 
   282 (* define *)
   283 
   284 fun define (ta as Target {target, is_locale, is_class, ...})
   285     kind ((b, mx), ((name, atts), rhs)) lthy =
   286   let
   287     val thy = ProofContext.theory_of lthy;
   288     val thy_ctxt = ProofContext.init thy;
   289 
   290     val c = Binding.base_name b;
   291     val name' = Binding.map_base (Thm.def_name_optional c) name;
   292     val (rhs', rhs_conv) =
   293       LocalDefs.export_cterm lthy thy_ctxt (Thm.cterm_of thy rhs) |>> Thm.term_of;
   294     val xs = Variable.add_fixed (LocalTheory.target_of lthy) rhs' [];
   295     val T = Term.fastype_of rhs;
   296 
   297     (*const*)
   298     val ((lhs, local_def), lthy2) = lthy |> declare_const ta (member (op =) xs) ((b, T), mx);
   299     val (_, lhs') = Logic.dest_equals (Thm.prop_of local_def);
   300 
   301     (*def*)
   302     val define_const =
   303       (case Overloading.operation lthy c of
   304         SOME (_, checked) =>
   305           (fn name => fn (Const (c, _), rhs) => Overloading.define checked name (c, rhs))
   306       | NONE =>
   307           if is_none (Class.instantiation_param lthy c)
   308           then (fn name => fn eq => Thm.add_def false false (name, Logic.mk_equals eq))
   309           else (fn name => fn (Const (c, _), rhs) => AxClass.define_overloaded name (c, rhs)));
   310     val (global_def, lthy3) = lthy2
   311       |> LocalTheory.theory_result (define_const (Binding.base_name name') (lhs', rhs'));
   312     val def = LocalDefs.trans_terms lthy3
   313       [(*c == global.c xs*)     local_def,
   314        (*global.c xs == rhs'*)  global_def,
   315        (*rhs' == rhs*)          Thm.symmetric rhs_conv];
   316 
   317     (*note*)
   318     val ([(res_name, [res])], lthy4) = lthy3
   319       |> notes ta kind [((name', atts), [([def], [])])];
   320   in ((lhs, (res_name, res)), lthy4) end;
   321 
   322 
   323 (* init *)
   324 
   325 local
   326 
   327 fun init_target _ NONE = global_target
   328   | init_target thy (SOME target) =
   329       make_target target true (Class.is_class thy target) ([], [], []) [];
   330 
   331 fun init_ctxt (Target {target, is_locale, is_class, instantiation, overloading}) =
   332   if not (null (#1 instantiation)) then Class.init_instantiation instantiation
   333   else if not (null overloading) then Overloading.init overloading
   334   else if not is_locale then ProofContext.init
   335   else if not is_class then locale_init target
   336   else Class.init target;
   337 
   338 fun init_lthy (ta as Target {target, instantiation, overloading, ...}) =
   339   Data.put ta #>
   340   LocalTheory.init (NameSpace.base target)
   341    {pretty = pretty ta,
   342     abbrev = abbrev ta,
   343     define = define ta,
   344     notes = notes ta,
   345     type_syntax = type_syntax ta,
   346     term_syntax = term_syntax ta,
   347     declaration = declaration ta,
   348     reinit = fn lthy => init_lthy_ctxt ta (ProofContext.theory_of lthy),
   349     exit = LocalTheory.target_of o
   350       (if not (null (#1 instantiation)) then Class.conclude_instantiation
   351        else if not (null overloading) then Overloading.conclude
   352        else I)}
   353 and init_lthy_ctxt ta = init_lthy ta o init_ctxt ta;
   354 
   355 fun gen_overloading prep_const raw_ops thy =
   356   let
   357     val ctxt = ProofContext.init thy;
   358     val ops = raw_ops |> map (fn (name, const, checked) =>
   359       (name, Term.dest_Const (prep_const ctxt const), checked));
   360   in thy |> init_lthy_ctxt (make_target "" false false ([], [], []) ops) end;
   361 
   362 in
   363 
   364 fun init target thy = init_lthy_ctxt (init_target thy target) thy;
   365 fun begin target ctxt = init_lthy (init_target (ProofContext.theory_of ctxt) (SOME target)) ctxt;
   366 
   367 fun context "-" thy = init NONE thy
   368   | context target thy = init (SOME (locale_intern thy target)) thy;
   369 
   370 fun instantiation arities = init_lthy_ctxt (make_target "" false false arities []);
   371 
   372 val overloading = gen_overloading (fn ctxt => Syntax.check_term ctxt o Const);
   373 val overloading_cmd = gen_overloading Syntax.read_term;
   374 
   375 end;
   376 
   377 end;
   378