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