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@21006:   val peek: local_theory -> string option
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@20894: (** locale targets **)
wenzelm@20894: 
wenzelm@21006: (* context data *)
wenzelm@21006: 
wenzelm@21006: structure Data = ProofDataFun
wenzelm@21006: (
wenzelm@21006:   type T = string option;
wenzelm@21006:   fun init _ = NONE;
wenzelm@21006: );
wenzelm@21006: 
wenzelm@21006: val peek = Data.get;
wenzelm@21006: 
wenzelm@21006: 
wenzelm@20894: (* pretty *)
wenzelm@20894: 
wenzelm@20894: fun pretty loc ctxt =
wenzelm@20894:   let
wenzelm@20894:     val thy = ProofContext.theory_of ctxt;
wenzelm@24939:     val loc_kind = if is_some (Class.class_of_locale thy loc) then "class" else "locale";
wenzelm@24939:     val loc_name = Locale.extern thy loc;
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@24939:      (if loc = "" then []
wenzelm@24939:       else if null elems then [Pretty.str (loc_kind ^ " " ^ loc_name)]
wenzelm@24939:       else [Pretty.big_list (loc_kind ^ " " ^ loc_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: 
haftmann@24838: fun target_decl add loc 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
haftmann@24838:     if loc = "" 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
haftmann@24838:       |> LocalTheory.target (add loc 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: 
haftmann@24838: fun target_naming loc lthy =
haftmann@24838:   (if loc = "" 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@24939: fun local_notes loc kind facts lthy =
wenzelm@21585:   let
wenzelm@21594:     val is_loc = loc <> "";
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@21611:       |> is_loc ? Element.facts_map (Element.morph_ctxt (LocalTheory.target_morphism lthy));
wenzelm@21611:     val global_facts = PureThy.map_facts #2 facts'
wenzelm@21594:       |> Attrib.map_facts (if is_loc 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@21611:     |> is_loc ? LocalTheory.target (Locale.add_thmss loc 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@24939: fun internal_abbrev loc prmode ((c, mx), t) lthy = lthy
wenzelm@24939:   (* FIXME really permissive *)
wenzelm@24939:   |> term_syntax loc (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@24939: fun declare_consts loc depends decls lthy =
wenzelm@24939:   let
wenzelm@24939:     val thy = ProofContext.theory_of lthy;
wenzelm@24939:     val is_loc = loc <> "";
wenzelm@24939:     val some_class = Class.class_of_locale thy loc;
wenzelm@24939: 
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@24939:         val (mx1, mx2) = Class.fork_mixfix is_loc some_class mx;
wenzelm@24939:         val mx3 = if is_loc 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))
wenzelm@24939:           #-> Class.remove_constraint [class]
wenzelm@24939:       | const_class NONE _ _ = I;
wenzelm@24939:     fun hide_abbrev (SOME class) abbrs thy =
wenzelm@24939:           let
wenzelm@24939:             val raw_cs = map (fst o fst) abbrs;
wenzelm@24939:             val prfx = (Logic.const_of_class o NameSpace.base) class;
wenzelm@24939:             fun mk_name c =
wenzelm@24939:               let
wenzelm@24939:                 val n1 = Sign.full_name thy c;
wenzelm@24939:                 val n2 = NameSpace.qualifier n1;
wenzelm@24939:                 val n3 = NameSpace.base n1;
wenzelm@24939:               in NameSpace.implode [n2, prfx, prfx, n3] end;
wenzelm@24939:             val cs = map mk_name raw_cs;
wenzelm@24939:           in
wenzelm@24939:             Sign.hide_consts_i true cs thy
wenzelm@24939:           end
wenzelm@24939:       | hide_abbrev NONE _ thy = thy;
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@24939:     |> fold2 (const_class some_class) decls abbrs
wenzelm@24959:     |> is_loc ? fold (internal_abbrev loc Syntax.mode_default) abbrs
wenzelm@24939:     |> LocalTheory.raw_theory (hide_abbrev some_class abbrs)
wenzelm@24939:         (*FIXME abbreviations should never occur*)
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@24939: fun abbrev loc prmode ((raw_c, mx), raw_t) lthy =
wenzelm@24939:   let
wenzelm@24939:     val thy = ProofContext.theory_of lthy;
wenzelm@24939:     val is_loc = loc <> "";
wenzelm@24939:     val some_class = Class.class_of_locale thy loc;
wenzelm@24939: 
wenzelm@24939:     val thy_ctxt = ProofContext.init thy;
wenzelm@24939:     val target = 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@24939:     val xs = map Free (occ_params target [t]);
wenzelm@24939:     val u = fold_rev Term.lambda xs t;
wenzelm@24939:     val U = Term.fastype_of u;
wenzelm@24939:     val u' = singleton (Variable.export_terms (Variable.declare_term u target) thy_ctxt) u;
wenzelm@24939:     val (mx1, mx2) = Class.fork_mixfix is_loc some_class mx;
wenzelm@24939:     val mx3 = if is_loc then NoSyn else mx1;
wenzelm@24939:     fun add_abbrev_in_class (SOME class) abbr =
wenzelm@24939:           LocalTheory.raw_theory_result (Class.add_abbrev_in_class class prmode abbr)
wenzelm@24939:           #-> (fn c => Class.remove_constraint [class] c)
wenzelm@24939:       | add_abbrev_in_class NONE _ = I;
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@24949:           #> is_loc ? internal_abbrev loc prmode ((c, mx2), Term.list_comb (Const (full_c, U), xs))
wenzelm@24949:           #> add_abbrev_in_class some_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@24939: local
wenzelm@24939: 
wenzelm@24939: fun expand_term ctxt t =
wenzelm@24939:   let
wenzelm@24939:     val thy = ProofContext.theory_of ctxt;
wenzelm@24939:     val thy_ctxt = ProofContext.init thy;
wenzelm@24939:     val ct = Thm.cterm_of thy t;
wenzelm@24939:     val (defs, ct') = LocalDefs.export ctxt thy_ctxt (Drule.mk_term ct) ||> Drule.dest_term;
wenzelm@24939:   in (Thm.term_of ct', MetaSimplifier.rewrite true defs ct) end;
wenzelm@24939: 
wenzelm@24939: in
wenzelm@24939: 
wenzelm@24939: fun local_def loc kind ((c, mx), ((name, atts), rhs)) lthy1 =
wenzelm@24939:   let
wenzelm@24939:     val (rhs', rhs_conv) = expand_term lthy1 rhs;
wenzelm@24939:     val xs = Variable.add_fixed (LocalTheory.target_of lthy1) rhs' [];
wenzelm@24939:     val T = Term.fastype_of rhs;
wenzelm@24939: 
wenzelm@24939:     (*consts*)
wenzelm@24939:     val ([(lhs, lhs_def)], lthy2) = lthy1
wenzelm@24939:       |> declare_consts loc (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@24939:       [(*c == loc.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@24939:       |> local_notes loc kind [((name', atts), [([eq], [])])];
wenzelm@24939:   in ((lhs, (res_name, res)), lthy4) end;
wenzelm@24939: 
wenzelm@24939: end;
wenzelm@24939: 
wenzelm@24939: 
wenzelm@24939: (* axioms *)
wenzelm@24939: 
wenzelm@24939: fun axioms loc kind specs lthy =
wenzelm@24939:   let
wenzelm@24939:     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@24939:     lthy
wenzelm@24939:     |> fold (fold Variable.declare_term o snd) specs
wenzelm@24939:     |> LocalTheory.theory_result (fold_map axiom specs)
wenzelm@24939:     |-> local_notes loc kind
wenzelm@24939:   end;
wenzelm@24939: 
wenzelm@24939: 
wenzelm@20894: (* init and exit *)
wenzelm@20894: 
haftmann@22353: fun begin loc ctxt =
haftmann@22353:   let
haftmann@22353:     val thy = ProofContext.theory_of ctxt;
haftmann@22353:     val is_loc = loc <> "";
haftmann@22353:   in
haftmann@22353:     ctxt
haftmann@22353:     |> Data.put (if is_loc then SOME loc else NONE)
wenzelm@24939:     |> fold Class.init (the_list (Class.class_of_locale thy loc))
haftmann@24748:     |> LocalTheory.init (NameSpace.base loc)
wenzelm@21747:      {pretty = pretty loc,
wenzelm@24939:       consts = declare_consts loc,
wenzelm@24939:       axioms = axioms loc,
wenzelm@24939:       abbrev = abbrev loc,
wenzelm@24939:       def = local_def loc,
wenzelm@24939:       notes = local_notes loc,
wenzelm@21747:       type_syntax = type_syntax loc,
wenzelm@21747:       term_syntax = term_syntax loc,
wenzelm@21747:       declaration = declaration loc,
wenzelm@22203:       target_naming = target_naming loc,
wenzelm@21804:       reinit = fn _ =>
haftmann@24657:         (if is_loc then Locale.init loc else ProofContext.init)
haftmann@24657:         #> begin loc,
wenzelm@24935:       exit = LocalTheory.target_of}
wenzelm@21747:   end;
wenzelm@20894: 
wenzelm@24935: fun init NONE thy = begin "" (ProofContext.init thy)
wenzelm@24935:   | init (SOME loc) thy = begin loc (Locale.init loc thy);
wenzelm@20894: 
wenzelm@24935: fun init_cmd (SOME "-") thy = init NONE thy
wenzelm@24935:   | init_cmd loc thy = init (Option.map (Locale.intern thy) loc) thy;
wenzelm@20894: 
wenzelm@20894: end;