src/Pure/Isar/theory_target.ML
author wenzelm
Sun Oct 14 00:18:11 2007 +0200 (2007-10-14)
changeset 25028 e0f74efc210f
parent 25022 bb0dcb603a13
child 25040 4e54c5ae6852
permissions -rw-r--r--
tuned various Class interfaces;
tuned;
     1 (*  Title:      Pure/Isar/theory_target.ML
     2     ID:         $Id$
     3     Author:     Makarius
     4 
     5 Common theory/locale/class targets.
     6 *)
     7 
     8 signature THEORY_TARGET =
     9 sig
    10   val peek: local_theory -> {target: string, is_locale: bool, is_class: bool}
    11   val begin: string -> Proof.context -> local_theory
    12   val init: string option -> theory -> local_theory
    13   val init_cmd: xstring option -> theory -> local_theory
    14 end;
    15 
    16 structure TheoryTarget: THEORY_TARGET =
    17 struct
    18 
    19 (* context data *)
    20 
    21 datatype target = Target of {target: string, is_locale: bool, is_class: bool};
    22 
    23 fun make_target target is_locale is_class =
    24   Target {target = target, is_locale = is_locale, is_class = is_class};
    25 
    26 structure Data = ProofDataFun
    27 (
    28   type T = target;
    29   fun init _ = make_target "" false false;
    30 );
    31 
    32 val peek = (fn Target args => args) o Data.get;
    33 
    34 
    35 (* pretty *)
    36 
    37 fun pretty (Target {target, is_locale, is_class}) ctxt =
    38   let
    39     val thy = ProofContext.theory_of ctxt;
    40     val target_name = (if is_class then "class " else "locale ") ^ Locale.extern thy target;
    41 
    42     val fixes = map (fn (x, T) => (x, SOME T, NoSyn)) (#1 (ProofContext.inferred_fixes ctxt));
    43     val assumes = map (fn A => (("", []), [(A, [])])) (map Thm.term_of (Assumption.assms_of ctxt));
    44     val elems =
    45       (if null fixes then [] else [Element.Fixes fixes]) @
    46       (if null assumes then [] else [Element.Assumes assumes]);
    47   in
    48     Pretty.block [Pretty.str "theory", Pretty.brk 1, Pretty.str (Context.theory_name thy)] ::
    49      (if target = "" then []
    50       else if null elems then [Pretty.str target_name]
    51       else [Pretty.big_list (target_name ^ " =")
    52         (map (Pretty.chunks o Element.pretty_ctxt ctxt) elems)])
    53   end;
    54 
    55 
    56 (* target declarations *)
    57 
    58 fun target_decl add (Target {target, ...}) d lthy =
    59   let
    60     val d' = Morphism.transform (LocalTheory.target_morphism lthy) d;
    61     val d0 = Morphism.form d';
    62   in
    63     if target = "" then
    64       lthy
    65       |> LocalTheory.theory (Context.theory_map d0)
    66       |> LocalTheory.target (Context.proof_map d0)
    67     else
    68       lthy
    69       |> LocalTheory.target (add target d')
    70   end;
    71 
    72 val type_syntax = target_decl Locale.add_type_syntax;
    73 val term_syntax = target_decl Locale.add_term_syntax;
    74 val declaration = target_decl Locale.add_declaration;
    75 
    76 fun target_naming (Target {target, ...}) lthy =
    77   (if target = "" then Sign.naming_of (ProofContext.theory_of lthy)
    78    else ProofContext.naming_of (LocalTheory.target_of lthy))
    79   |> NameSpace.qualified_names;
    80 
    81 
    82 
    83 (* notes *)
    84 
    85 fun import_export_proof ctxt (name, raw_th) =
    86   let
    87     val thy = ProofContext.theory_of ctxt;
    88     val thy_ctxt = ProofContext.init thy;
    89     val certT = Thm.ctyp_of thy;
    90     val cert = Thm.cterm_of thy;
    91 
    92     (*export assumes/defines*)
    93     val th = Goal.norm_result raw_th;
    94     val (defs, th') = LocalDefs.export ctxt thy_ctxt th;
    95     val concl_conv = MetaSimplifier.rewrite true defs (Thm.cprop_of th);
    96     val assms = map (MetaSimplifier.rewrite_rule defs o Thm.assume) (Assumption.assms_of ctxt);
    97     val nprems = Thm.nprems_of th' - Thm.nprems_of th;
    98 
    99     (*export fixes*)
   100     val tfrees = map TFree (Thm.fold_terms Term.add_tfrees th' []);
   101     val frees = map Free (Thm.fold_terms Term.add_frees th' []);
   102     val (th'' :: vs) = (th' :: map (Drule.mk_term o cert) (map Logic.mk_type tfrees @ frees))
   103       |> Variable.export ctxt thy_ctxt
   104       |> Drule.zero_var_indexes_list;
   105 
   106     (*thm definition*)
   107     val result = th''
   108       |> PureThy.name_thm true true ""
   109       |> Goal.close_result
   110       |> fold PureThy.tag_rule (ContextPosition.properties_of ctxt)
   111       |> PureThy.name_thm true true name;
   112 
   113     (*import fixes*)
   114     val (tvars, vars) =
   115       chop (length tfrees) (map (Thm.term_of o Drule.dest_term) vs)
   116       |>> map Logic.dest_type;
   117 
   118     val instT = map_filter (fn (TVar v, T) => SOME (v, T) | _ => NONE) (tvars ~~ tfrees);
   119     val inst = filter (is_Var o fst) (vars ~~ frees);
   120     val cinstT = map (pairself certT o apfst TVar) instT;
   121     val cinst = map (pairself (cert o Term.map_types (TermSubst.instantiateT instT))) inst;
   122     val result' = Thm.instantiate (cinstT, cinst) result;
   123 
   124     (*import assumes/defines*)
   125     val assm_tac = FIRST' (map (fn assm => Tactic.compose_tac (false, assm, 0)) assms);
   126     val result'' =
   127       (case SINGLE (Seq.INTERVAL assm_tac 1 nprems) result' of
   128         NONE => raise THM ("Failed to re-import result", 0, [result'])
   129       | SOME res => LocalDefs.trans_props ctxt [res, Thm.symmetric concl_conv])
   130       |> Goal.norm_result
   131       |> PureThy.name_thm false false name;
   132 
   133   in (result'', result) end;
   134 
   135 fun notes (Target {target, is_locale, ...}) kind facts lthy =
   136   let
   137     val thy = ProofContext.theory_of lthy;
   138     val full = LocalTheory.full_name lthy;
   139 
   140     val facts' = facts
   141       |> map (fn (a, bs) => (a, PureThy.burrow_fact (PureThy.name_multi (full (fst a))) bs))
   142       |> PureThy.map_facts (import_export_proof lthy);
   143     val local_facts = PureThy.map_facts #1 facts'
   144       |> Attrib.map_facts (Attrib.attribute_i thy);
   145     val target_facts = PureThy.map_facts #1 facts'
   146       |> is_locale ? Element.facts_map (Element.morph_ctxt (LocalTheory.target_morphism lthy));
   147     val global_facts = PureThy.map_facts #2 facts'
   148       |> Attrib.map_facts (if is_locale then K I else Attrib.attribute_i thy);
   149   in
   150     lthy |> LocalTheory.theory
   151       (Sign.qualified_names
   152         #> PureThy.note_thmss_i kind global_facts #> snd
   153         #> Sign.restore_naming thy)
   154 
   155     |> is_locale ? LocalTheory.target (Locale.add_thmss target kind target_facts)
   156 
   157     |> ProofContext.qualified_names
   158     |> ProofContext.note_thmss_i kind local_facts
   159     ||> ProofContext.restore_naming lthy
   160   end;
   161 
   162 
   163 (* consts *)
   164 
   165 fun target_abbrev prmode ((c, mx), rhs) phi =
   166   let
   167     val c' = Morphism.name phi c;
   168     val rhs' = Morphism.term phi rhs;
   169     val arg' = (c', rhs');
   170     val eq_heads =
   171       (case pairself Term.head_of (rhs, rhs') of
   172         (Const (a, _), Const (a', _)) => a = a'
   173       | _ => false);
   174   in
   175     eq_heads ? (Context.mapping_result
   176         (Sign.add_abbrev Syntax.internalM [] arg')
   177         (ProofContext.add_abbrev Syntax.internalM [] arg')
   178       #-> (fn (lhs, _) =>
   179         Type.similar_types (rhs, rhs') ?
   180           Morphism.form (ProofContext.target_notation true prmode [(lhs, mx)])))
   181   end;
   182 
   183 fun internal_abbrev ta prmode ((c, mx), t) lthy = lthy
   184   (* FIXME really permissive *)
   185   |> term_syntax ta (perhaps o try o target_abbrev prmode ((c, mx), t))
   186   |> ProofContext.add_abbrev Syntax.internalM (ContextPosition.properties_of lthy) (c, t)
   187   |> snd;
   188 
   189 fun declare_consts (ta as Target {target, is_locale, is_class}) depends decls lthy =
   190   let
   191     val thy = ProofContext.theory_of lthy;
   192     val xs = filter depends (#1 (ProofContext.inferred_fixes (LocalTheory.target_of lthy)));
   193 
   194     fun const ((c, T), mx) thy =
   195       let
   196         val U = map #2 xs ---> T;
   197         val (mx1, mx2) = Class.fork_mixfix is_locale is_class mx;
   198         val mx3 = if is_locale then NoSyn else mx1;
   199         val (const, thy') = Sign.declare_const (ContextPosition.properties_of lthy) (c, U, mx3) thy;
   200         val t = Term.list_comb (const, map Free xs);
   201       in (((c, mx2), t), thy') end;
   202     fun const_class ((c, _), mx) (_, t) =
   203       LocalTheory.raw_theory_result (Class.add_const_in_class target ((c, mx), t))
   204       #-> Class.remove_constraint target;
   205 
   206     val (abbrs, lthy') = lthy
   207       |> LocalTheory.theory_result (fold_map const decls)
   208   in
   209     lthy'
   210     |> is_class ? fold2 const_class decls abbrs
   211     |> is_locale ? fold (internal_abbrev ta Syntax.mode_default) abbrs
   212     |> fold_map (apfst (apsnd snd) oo LocalDefs.add_def) abbrs
   213   end;
   214 
   215 
   216 (* abbrev *)
   217 
   218 fun abbrev (ta as Target {target, is_locale, is_class}) prmode ((raw_c, mx), raw_t) lthy =
   219   let
   220     val thy = ProofContext.theory_of lthy;
   221     val thy_ctxt = ProofContext.init thy;
   222     val target_ctxt = LocalTheory.target_of lthy;
   223     val target_morphism = LocalTheory.target_morphism lthy;
   224 
   225     val c = Morphism.name target_morphism raw_c;
   226     val t = Morphism.term target_morphism raw_t;
   227     val xs = map Free (Variable.add_fixed target_ctxt t []);
   228     val u = fold_rev lambda xs t;
   229     val U = Term.fastype_of u;
   230 
   231     val u' = singleton (Variable.export_terms (Variable.declare_term u target_ctxt) thy_ctxt) u;
   232     val (mx1, mx2) = Class.fork_mixfix is_locale is_class mx;
   233     val mx3 = if is_locale then NoSyn else mx1;
   234     fun add_abbrev_in_class abbr =
   235       LocalTheory.raw_theory_result (Class.add_abbrev_in_class target prmode abbr)
   236       #-> Class.remove_constraint target;
   237   in
   238     lthy
   239     |> LocalTheory.theory_result
   240         (Sign.add_abbrev (#1 prmode) (ContextPosition.properties_of lthy) (c, u'))
   241     |-> (fn (lhs, rhs) =>
   242           LocalTheory.theory (Sign.notation true prmode [(lhs, mx3)])
   243           #> is_locale ? internal_abbrev ta prmode ((c, mx2), Term.list_comb (lhs, xs))
   244           #> is_class ? add_abbrev_in_class ((c, mx1), Term.list_comb (lhs, xs)))
   245     |> LocalDefs.add_def ((c, NoSyn), raw_t)
   246   end;
   247 
   248 
   249 (* define *)
   250 
   251 fun define (ta as Target {target, is_locale, is_class})
   252     kind ((c, mx), ((name, atts), rhs)) lthy =
   253   let
   254     val thy = ProofContext.theory_of lthy;
   255     val thy_ctxt = ProofContext.init thy;
   256 
   257     val name' = Thm.def_name_optional c name;
   258     val (rhs', rhs_conv) =
   259       LocalDefs.export_cterm lthy thy_ctxt (Thm.cterm_of thy rhs) |>> Thm.term_of;
   260     val xs = Variable.add_fixed (LocalTheory.target_of lthy) rhs' [];
   261     val T = Term.fastype_of rhs;
   262 
   263     (*consts*)
   264     val ([(lhs, local_def)], lthy2) = lthy
   265       |> declare_consts ta (member (op =) xs) [((c, T), mx)];
   266     val (_, lhs') = Logic.dest_equals (Thm.prop_of local_def);
   267 
   268     (*def*)
   269     val (global_def, lthy3) = lthy2
   270       |> LocalTheory.theory_result (Thm.add_def false (name', Logic.mk_equals (lhs', rhs')));
   271     val def = LocalDefs.trans_terms lthy3
   272       [(*c == global.c xs*)     local_def,
   273        (*global.c xs == rhs'*)  global_def,
   274        (*rhs' == rhs*)          Thm.symmetric rhs_conv];
   275 
   276     (*notes*)
   277     val ([(res_name, [res])], lthy4) = lthy3
   278       |> notes ta kind [((name', atts), [([def], [])])];
   279   in ((lhs, (res_name, res)), lthy4) end;
   280 
   281 
   282 (* axioms *)
   283 
   284 fun axioms ta kind (vars, specs) lthy =
   285   let
   286     val thy_ctxt = ProofContext.init (ProofContext.theory_of lthy);
   287     val expanded_props = map (Assumption.export_term lthy thy_ctxt) (maps snd specs);
   288     val xs = fold Term.add_frees expanded_props [];
   289 
   290     (*consts*)
   291     val (consts, lthy') = declare_consts ta (member (op =) xs) vars lthy;
   292     val global_consts = map (Term.dest_Const o Term.head_of o Thm.term_of o Thm.rhs_of o #2) consts;
   293 
   294     (*axioms*)
   295     val hyps = map Thm.term_of (Assumption.assms_of lthy');
   296     fun axiom ((name, atts), props) thy = thy
   297       |> fold_map (Thm.add_axiom hyps) (PureThy.name_multi name props)
   298       |-> (fn ths => pair ((name, atts), [(ths, [])]));
   299   in
   300     lthy'
   301     |> fold Variable.declare_term expanded_props
   302     |> LocalTheory.theory (fold (fn c => Theory.add_deps "" c []) global_consts)
   303     |> LocalTheory.theory_result (fold_map axiom specs)
   304     |-> notes ta kind
   305     |>> pair (map #1 consts)
   306   end;
   307 
   308 
   309 (* init and exit *)
   310 
   311 fun begin target ctxt =
   312   let
   313     val thy = ProofContext.theory_of ctxt;
   314     val is_locale = target <> "";
   315     val is_class = Class.is_class thy target;
   316     val ta = Target {target = target, is_locale = is_locale, is_class = is_class};
   317   in
   318     ctxt
   319     |> Data.put ta
   320     |> is_class ? Class.init target
   321     |> LocalTheory.init (NameSpace.base target)
   322      {pretty = pretty ta,
   323       axioms = axioms ta,
   324       abbrev = abbrev ta,
   325       define = define ta,
   326       notes = notes ta,
   327       type_syntax = type_syntax ta,
   328       term_syntax = term_syntax ta,
   329       declaration = declaration ta,
   330       target_naming = target_naming ta,
   331       reinit = fn _ =>
   332         begin target o (if is_locale then Locale.init target else ProofContext.init),
   333       exit = LocalTheory.target_of}
   334   end;
   335 
   336 fun init NONE thy = begin "" (ProofContext.init thy)
   337   | init (SOME target) thy = begin target (Locale.init target thy);
   338 
   339 fun init_cmd (SOME "-") thy = init NONE thy
   340   | init_cmd target thy = init (Option.map (Locale.intern thy) target) thy;
   341 
   342 end;