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