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