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