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