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