wenzelm@20894: (*  Title:      Pure/Isar/theory_target.ML
wenzelm@20894:     ID:         $Id$
wenzelm@20894:     Author:     Makarius
wenzelm@20894: 
wenzelm@24935: Common theory/locale/class targets.
wenzelm@20894: *)
wenzelm@20894: 
wenzelm@20894: signature THEORY_TARGET =
wenzelm@20894: sig
wenzelm@25012:   val peek: local_theory -> {target: string, is_locale: bool, is_class: bool}
wenzelm@24935:   val begin: string -> Proof.context -> local_theory
wenzelm@24935:   val init: string option -> theory -> local_theory
wenzelm@24935:   val init_cmd: xstring option -> theory -> local_theory
wenzelm@20894: end;
wenzelm@20894: 
wenzelm@20894: structure TheoryTarget: THEORY_TARGET =
wenzelm@20894: struct
wenzelm@20894: 
wenzelm@24987: 
wenzelm@20894: (** locale targets **)
wenzelm@20894: 
wenzelm@21006: (* context data *)
wenzelm@21006: 
wenzelm@25012: datatype target = Target of {target: string, is_locale: bool, is_class: bool};
wenzelm@25012: 
wenzelm@25012: fun make_target target is_locale is_class =
wenzelm@25012:   Target {target = target, is_locale = is_locale, is_class = is_class};
wenzelm@25012: 
wenzelm@21006: structure Data = ProofDataFun
wenzelm@21006: (
wenzelm@25012:   type T = target;
wenzelm@25012:   fun init _ = make_target "" false false;
wenzelm@21006: );
wenzelm@21006: 
wenzelm@25012: val peek = (fn Target args => args) o Data.get;
wenzelm@21006: 
wenzelm@21006: 
wenzelm@20894: (* pretty *)
wenzelm@20894: 
wenzelm@25012: fun pretty (Target {target, is_locale, is_class}) ctxt =
wenzelm@20894:   let
wenzelm@20894:     val thy = ProofContext.theory_of ctxt;
wenzelm@25012:     val target_name = (if is_class then "class " else "locale ") ^ Locale.extern thy target;
wenzelm@24939: 
wenzelm@20894:     val fixes = map (fn (x, T) => (x, SOME T, NoSyn)) (#1 (ProofContext.inferred_fixes ctxt));
wenzelm@21585:     val assumes = map (fn A => (("", []), [(A, [])])) (map Thm.term_of (Assumption.assms_of ctxt));
wenzelm@20894:     val elems =
wenzelm@20894:       (if null fixes then [] else [Element.Fixes fixes]) @
wenzelm@20894:       (if null assumes then [] else [Element.Assumes assumes]);
wenzelm@20894:   in
wenzelm@24939:     Pretty.block [Pretty.str "theory", Pretty.brk 1, Pretty.str (Context.theory_name thy)] ::
wenzelm@25012:      (if target = "" then []
wenzelm@25012:       else if null elems then [Pretty.str target_name]
wenzelm@25012:       else [Pretty.big_list (target_name ^ " =")
wenzelm@24939:         (map (Pretty.chunks o Element.pretty_ctxt ctxt) elems)])
wenzelm@20894:   end;
wenzelm@20894: 
wenzelm@20894: 
haftmann@24838: (* target declarations *)
haftmann@24838: 
wenzelm@25012: fun target_decl add (Target {target, ...}) d lthy =
haftmann@24838:   let
wenzelm@24935:     val d' = Morphism.transform (LocalTheory.target_morphism lthy) d;
haftmann@24838:     val d0 = Morphism.form d';
haftmann@24838:   in
wenzelm@25012:     if target = "" then
haftmann@24838:       lthy
haftmann@24838:       |> LocalTheory.theory (Context.theory_map d0)
haftmann@24838:       |> LocalTheory.target (Context.proof_map d0)
haftmann@24838:     else
haftmann@24838:       lthy
wenzelm@25012:       |> LocalTheory.target (add target d')
haftmann@24838:   end;
haftmann@24838: 
haftmann@24838: val type_syntax = target_decl Locale.add_type_syntax;
haftmann@24838: val term_syntax = target_decl Locale.add_term_syntax;
haftmann@24838: val declaration = target_decl Locale.add_declaration;
haftmann@24838: 
wenzelm@25012: fun target_naming (Target {target, ...}) lthy =
wenzelm@25012:   (if target = "" then Sign.naming_of (ProofContext.theory_of lthy)
haftmann@24838:    else ProofContext.naming_of (LocalTheory.target_of lthy))
haftmann@24838:   |> NameSpace.qualified_names;
haftmann@24838: 
haftmann@24838: 
wenzelm@21611: 
wenzelm@20894: (* notes *)
wenzelm@20894: 
wenzelm@21611: fun import_export_proof ctxt (name, raw_th) =
wenzelm@21594:   let
wenzelm@21611:     val thy = ProofContext.theory_of ctxt;
wenzelm@21611:     val thy_ctxt = ProofContext.init thy;
wenzelm@21611:     val certT = Thm.ctyp_of thy;
wenzelm@21611:     val cert = Thm.cterm_of thy;
wenzelm@21594: 
wenzelm@21611:     (*export assumes/defines*)
wenzelm@21611:     val th = Goal.norm_result raw_th;
wenzelm@21611:     val (defs, th') = LocalDefs.export ctxt thy_ctxt th;
wenzelm@21708:     val concl_conv = MetaSimplifier.rewrite true defs (Thm.cprop_of th);
wenzelm@21708:     val assms = map (MetaSimplifier.rewrite_rule defs o Thm.assume) (Assumption.assms_of ctxt);
wenzelm@21611:     val nprems = Thm.nprems_of th' - Thm.nprems_of th;
wenzelm@21611: 
wenzelm@21611:     (*export fixes*)
wenzelm@22692:     val tfrees = map TFree (Thm.fold_terms Term.add_tfrees th' []);
wenzelm@22692:     val frees = map Free (Thm.fold_terms Term.add_frees th' []);
wenzelm@21611:     val (th'' :: vs) = (th' :: map (Drule.mk_term o cert) (map Logic.mk_type tfrees @ frees))
wenzelm@21611:       |> Variable.export ctxt thy_ctxt
wenzelm@21611:       |> Drule.zero_var_indexes_list;
wenzelm@21611: 
wenzelm@21611:     (*thm definition*)
wenzelm@21644:     val result = th''
wenzelm@21644:       |> PureThy.name_thm true true ""
wenzelm@21644:       |> Goal.close_result
wenzelm@24779:       |> fold PureThy.tag_rule (ContextPosition.properties_of ctxt)
wenzelm@21644:       |> PureThy.name_thm true true name;
wenzelm@21611: 
wenzelm@21611:     (*import fixes*)
wenzelm@21611:     val (tvars, vars) =
wenzelm@21611:       chop (length tfrees) (map (Thm.term_of o Drule.dest_term) vs)
wenzelm@21611:       |>> map Logic.dest_type;
wenzelm@21611: 
wenzelm@21611:     val instT = map_filter (fn (TVar v, T) => SOME (v, T) | _ => NONE) (tvars ~~ tfrees);
wenzelm@21611:     val inst = filter (is_Var o fst) (vars ~~ frees);
wenzelm@21611:     val cinstT = map (pairself certT o apfst TVar) instT;
wenzelm@21611:     val cinst = map (pairself (cert o Term.map_types (TermSubst.instantiateT instT))) inst;
wenzelm@21611:     val result' = Thm.instantiate (cinstT, cinst) result;
wenzelm@21611: 
wenzelm@21611:     (*import assumes/defines*)
wenzelm@21594:     val assm_tac = FIRST' (map (fn assm => Tactic.compose_tac (false, assm, 0)) assms);
wenzelm@21611:     val result'' =
wenzelm@21611:       (case SINGLE (Seq.INTERVAL assm_tac 1 nprems) result' of
wenzelm@21611:         NONE => raise THM ("Failed to re-import result", 0, [result'])
wenzelm@21845:       | SOME res => LocalDefs.trans_props ctxt [res, Thm.symmetric concl_conv])
wenzelm@21644:       |> Goal.norm_result
wenzelm@21644:       |> PureThy.name_thm false false name;
wenzelm@21611: 
wenzelm@21611:   in (result'', result) end;
wenzelm@21611: 
wenzelm@25012: fun local_notes (Target {target, is_locale, ...}) kind facts lthy =
wenzelm@21585:   let
wenzelm@21594:     val thy = ProofContext.theory_of lthy;
wenzelm@21615:     val full = LocalTheory.full_name lthy;
wenzelm@21585: 
wenzelm@21594:     val facts' = facts
wenzelm@21615:       |> map (fn (a, bs) => (a, PureThy.burrow_fact (PureThy.name_multi (full (fst a))) bs))
wenzelm@21615:       |> PureThy.map_facts (import_export_proof lthy);
wenzelm@21611:     val local_facts = PureThy.map_facts #1 facts'
wenzelm@21611:       |> Attrib.map_facts (Attrib.attribute_i thy);
wenzelm@21611:     val target_facts = PureThy.map_facts #1 facts'
wenzelm@25012:       |> is_locale ? Element.facts_map (Element.morph_ctxt (LocalTheory.target_morphism lthy));
wenzelm@21611:     val global_facts = PureThy.map_facts #2 facts'
wenzelm@25012:       |> Attrib.map_facts (if is_locale then K I else Attrib.attribute_i thy);
wenzelm@21594:   in
wenzelm@21611:     lthy |> LocalTheory.theory
wenzelm@21611:       (Sign.qualified_names
wenzelm@21611:         #> PureThy.note_thmss_i kind global_facts #> snd
wenzelm@21611:         #> Sign.restore_naming thy)
wenzelm@21585: 
wenzelm@25012:     |> is_locale ? LocalTheory.target (Locale.add_thmss target kind target_facts)
wenzelm@21594: 
wenzelm@20894:     |> ProofContext.qualified_names
wenzelm@21611:     |> ProofContext.note_thmss_i kind local_facts
wenzelm@20894:     ||> ProofContext.restore_naming lthy
wenzelm@20894:   end;
wenzelm@20894: 
wenzelm@20894: 
wenzelm@24939: (* consts *)
wenzelm@24939: 
wenzelm@24939: fun target_abbrev prmode ((c, mx), rhs) phi =
wenzelm@24939:   let
wenzelm@24939:     val c' = Morphism.name phi c;
wenzelm@24939:     val rhs' = Morphism.term phi rhs;
wenzelm@24939:     val arg' = (c', rhs');
wenzelm@24939:     val eq_heads =
wenzelm@24939:       (case pairself Term.head_of (rhs, rhs') of
wenzelm@24939:         (Const (a, _), Const (a', _)) => a = a'
wenzelm@24939:       | _ => false);
wenzelm@24939:   in
wenzelm@24939:     eq_heads ? (Context.mapping_result
wenzelm@24939:       (Sign.add_abbrev Syntax.internalM [] arg') (ProofContext.add_abbrev Syntax.internalM [] arg')
wenzelm@24939:     #-> (fn (lhs, _) =>
wenzelm@24983:       Type.similar_types (rhs, rhs') ?
wenzelm@24949:         Morphism.form (ProofContext.target_notation true prmode [(lhs, mx)])))
wenzelm@24939:   end;
wenzelm@24939: 
wenzelm@25012: fun internal_abbrev ta prmode ((c, mx), t) lthy = lthy
wenzelm@24939:   (* FIXME really permissive *)
wenzelm@25012:   |> term_syntax ta (perhaps o try o target_abbrev prmode ((c, mx), t))
wenzelm@24939:   |> ProofContext.add_abbrev Syntax.internalM (ContextPosition.properties_of lthy) (c, t)
wenzelm@24939:   |> snd;
wenzelm@24939: 
wenzelm@25012: fun declare_consts (ta as Target {target, is_locale, is_class}) depends decls lthy =
wenzelm@24939:   let
wenzelm@24939:     val thy = ProofContext.theory_of lthy;
wenzelm@24939:     val xs = filter depends (#1 (ProofContext.inferred_fixes (LocalTheory.target_of lthy)));
wenzelm@24939: 
wenzelm@24939:     fun const ((c, T), mx) thy =
wenzelm@24939:       let
wenzelm@24939:         val U = map #2 xs ---> T;
wenzelm@25012:         val (mx1, mx2) = Class.fork_mixfix is_locale is_class mx;
wenzelm@25012:         val mx3 = if is_locale then NoSyn else mx1;
wenzelm@24959:         val (const, thy') = Sign.declare_const (ContextPosition.properties_of lthy) (c, U, mx3) thy;
wenzelm@24959:         val t = Term.list_comb (const, map Free xs);
wenzelm@24939:       in (((c, mx2), t), thy') end;
wenzelm@24939:     fun const_class (SOME class) ((c, _), mx) (_, t) =
wenzelm@24939:           LocalTheory.raw_theory_result (Class.add_const_in_class class ((c, t), mx))
haftmann@25002:           #-> Class.remove_constraint class
wenzelm@24939:       | const_class NONE _ _ = I;
wenzelm@24939: 
wenzelm@24939:     val (abbrs, lthy') = lthy
wenzelm@24939:       |> LocalTheory.theory_result (fold_map const decls)
wenzelm@24939:     val defs = map (apsnd (pair ("", []))) abbrs;
wenzelm@24939: 
wenzelm@24939:   in
wenzelm@24939:     lthy'
wenzelm@25012:     |> fold2 (const_class (if is_class then SOME target else NONE)) decls abbrs
wenzelm@25012:     |> is_locale ? fold (internal_abbrev ta Syntax.mode_default) abbrs
wenzelm@24939:     |> LocalDefs.add_defs defs
wenzelm@24939:     |>> map (apsnd snd)
wenzelm@24939:   end;
wenzelm@24939: 
wenzelm@24939: 
wenzelm@24939: (* abbrev *)
wenzelm@24939: 
wenzelm@24939: fun occ_params ctxt ts =
wenzelm@24939:   #1 (ProofContext.inferred_fixes ctxt)
wenzelm@24939:   |> filter (member (op =) (fold (Variable.add_fixed ctxt) ts []));
wenzelm@24939: 
wenzelm@24939: fun local_abbrev (x, rhs) =
wenzelm@24939:   Variable.add_fixes [x] #-> (fn [x'] =>
wenzelm@24939:     let
wenzelm@24939:       val T = Term.fastype_of rhs;
wenzelm@24939:       val lhs = Free (x', T);
wenzelm@24939:     in
wenzelm@24939:       Variable.declare_term lhs #>
wenzelm@24939:       Variable.declare_term rhs #>
wenzelm@24939:       Assumption.add_assms (K (K (I, Envir.expand_term_frees [((x', T), rhs)]))) [] #> snd #>
wenzelm@24939:       pair (lhs, rhs)
wenzelm@24939:     end);
wenzelm@24939: 
wenzelm@25012: fun abbrev (ta as Target {target, is_locale, is_class}) prmode ((raw_c, mx), raw_t) lthy =
wenzelm@24939:   let
wenzelm@24939:     val thy = ProofContext.theory_of lthy;
wenzelm@24939: 
wenzelm@24939:     val thy_ctxt = ProofContext.init thy;
wenzelm@25012:     val target_ctxt = LocalTheory.target_of lthy;
wenzelm@24939:     val target_morphism = LocalTheory.target_morphism lthy;
wenzelm@24939: 
wenzelm@24939:     val c = Morphism.name target_morphism raw_c;
wenzelm@24939:     val t = Morphism.term target_morphism raw_t;
wenzelm@25012:     val xs = map Free (occ_params target_ctxt [t]);
wenzelm@24939:     val u = fold_rev Term.lambda xs t;
wenzelm@24939:     val U = Term.fastype_of u;
wenzelm@25012:     val u' = singleton (Variable.export_terms (Variable.declare_term u target_ctxt) thy_ctxt) u;
wenzelm@25012:     val (mx1, mx2) = Class.fork_mixfix is_locale is_class mx;
wenzelm@25012:     val mx3 = if is_locale then NoSyn else mx1;
wenzelm@25012:     fun add_abbrev_in_class abbr =
wenzelm@25012:       LocalTheory.raw_theory_result (Class.add_abbrev_in_class target prmode abbr)
wenzelm@25012:       #-> Class.remove_constraint target;
wenzelm@24939:   in
wenzelm@24939:     lthy
wenzelm@24939:     |> LocalTheory.theory_result
wenzelm@24939:         (Sign.add_abbrev (#1 prmode) (ContextPosition.properties_of lthy) (c, u'))
wenzelm@24949:     |-> (fn (lhs as Const (full_c, _), rhs) =>
wenzelm@24949:           LocalTheory.theory (Sign.notation true prmode [(lhs, mx3)])
wenzelm@25012:           #> is_locale ? internal_abbrev ta prmode ((c, mx2), Term.list_comb (Const (full_c, U), xs))
wenzelm@25012:           #> is_class ? add_abbrev_in_class ((c, Term.list_comb (Const (full_c, U), xs)), mx1)
wenzelm@24949:           #> local_abbrev (c, rhs))
wenzelm@24939:   end;
wenzelm@24939: 
wenzelm@24939: 
wenzelm@24939: (* defs *)
wenzelm@24939: 
wenzelm@25012: fun local_def (ta as Target {target, is_locale, is_class})
wenzelm@25012:     kind ((c, mx), ((name, atts), rhs)) lthy =
wenzelm@24939:   let
wenzelm@24987:     val thy = ProofContext.theory_of lthy;
wenzelm@24939:     val thy_ctxt = ProofContext.init thy;
wenzelm@24939: 
wenzelm@24987:     val (rhs', rhs_conv) =
wenzelm@24987:       LocalDefs.export_cterm lthy thy_ctxt (Thm.cterm_of thy rhs) |>> Thm.term_of;
wenzelm@24987:     val xs = Variable.add_fixed (LocalTheory.target_of lthy) rhs' [];
wenzelm@24939:     val T = Term.fastype_of rhs;
wenzelm@24939: 
wenzelm@24939:     (*consts*)
wenzelm@24987:     val ([(lhs, lhs_def)], lthy2) = lthy
wenzelm@25012:       |> declare_consts ta (member (op =) xs) [((c, T), mx)];
wenzelm@24939:     val (_, lhs') = Logic.dest_equals (Thm.prop_of lhs_def);
wenzelm@24939: 
wenzelm@24939:     (*def*)
wenzelm@24939:     val name' = Thm.def_name_optional c name;
wenzelm@24939:     val (def, lthy3) = lthy2
wenzelm@24983:       |> LocalTheory.theory_result (Thm.add_def false (name', Logic.mk_equals (lhs', rhs')));
wenzelm@24939:     val eq = LocalDefs.trans_terms lthy3
wenzelm@25012:       [(*c == global.c xs*) lhs_def,
wenzelm@24939:        (*lhs' == rhs'*)  def,
wenzelm@24939:        (*rhs' == rhs*)   Thm.symmetric rhs_conv];
wenzelm@24939: 
wenzelm@24939:     (*notes*)
wenzelm@24939:     val ([(res_name, [res])], lthy4) = lthy3
wenzelm@25012:       |> local_notes ta kind [((name', atts), [([eq], [])])];
wenzelm@24939:   in ((lhs, (res_name, res)), lthy4) end;
wenzelm@24939: 
wenzelm@24939: 
wenzelm@24939: (* axioms *)
wenzelm@24939: 
wenzelm@25012: fun local_axioms ta kind (vars, specs) lthy =
wenzelm@24939:   let
wenzelm@24989:     val spec_frees = member (op =) (fold (fold Term.add_frees o snd) specs []);
wenzelm@25012:     val (consts, lthy') = declare_consts ta spec_frees vars lthy;
wenzelm@24989:     val heads = map (Term.head_of o Thm.term_of o Thm.rhs_of o #2) consts;
wenzelm@24989: 
wenzelm@24989:     val hyps = map Thm.term_of (Assumption.assms_of lthy');
wenzelm@24939:     fun axiom ((name, atts), props) thy = thy
wenzelm@24983:       |> fold_map (Thm.add_axiom hyps) (PureThy.name_multi name props)
wenzelm@24939:       |-> (fn ths => pair ((name, atts), [(ths, [])]));
wenzelm@24939:   in
wenzelm@24987:     lthy'
wenzelm@24987:     |> LocalTheory.theory (Theory.add_finals_i false heads)
wenzelm@24939:     |> fold (fold Variable.declare_term o snd) specs
wenzelm@24939:     |> LocalTheory.theory_result (fold_map axiom specs)
wenzelm@25012:     |-> local_notes ta kind
wenzelm@24987:     |>> pair (map #1 consts)
wenzelm@24939:   end;
wenzelm@24939: 
wenzelm@24939: 
wenzelm@20894: (* init and exit *)
wenzelm@20894: 
wenzelm@25012: fun begin target ctxt =
haftmann@22353:   let
haftmann@22353:     val thy = ProofContext.theory_of ctxt;
wenzelm@25012:     val is_locale = target <> "";
wenzelm@25012:     val is_class = is_some (Class.class_of_locale thy target);
wenzelm@25012:     val ta = Target {target = target, is_locale = is_locale, is_class = is_class};
haftmann@22353:   in
haftmann@22353:     ctxt
wenzelm@25012:     |> Data.put ta
wenzelm@25012:     |> is_class ? Class.init target
wenzelm@25012:     |> LocalTheory.init (NameSpace.base target)
wenzelm@25012:      {pretty = pretty ta,
wenzelm@25012:       axioms = local_axioms ta,
wenzelm@25012:       abbrev = abbrev ta,
wenzelm@25012:       def = local_def ta,
wenzelm@25012:       notes = local_notes ta,
wenzelm@25012:       type_syntax = type_syntax ta,
wenzelm@25012:       term_syntax = term_syntax ta,
wenzelm@25012:       declaration = declaration ta,
wenzelm@25012:       target_naming = target_naming ta,
wenzelm@21804:       reinit = fn _ =>
wenzelm@25012:         (if is_locale then Locale.init target else ProofContext.init)
wenzelm@25012:         #> begin target,
wenzelm@24935:       exit = LocalTheory.target_of}
wenzelm@21747:   end;
wenzelm@20894: 
wenzelm@24935: fun init NONE thy = begin "" (ProofContext.init thy)
wenzelm@25012:   | init (SOME target) thy = begin target (Locale.init target thy);
wenzelm@20894: 
wenzelm@24935: fun init_cmd (SOME "-") thy = init NONE thy
wenzelm@25012:   | init_cmd target thy = init (Option.map (Locale.intern thy) target) thy;
wenzelm@20894: 
wenzelm@20894: end;