author  wenzelm 
Thu, 11 Oct 2007 19:10:25 +0200  
changeset 24983  f2f4ba67cef1 
parent 24959  119793c84647 
child 24987  50b07326da38 
permissions  rwrr 
20894  1 
(* Title: Pure/Isar/theory_target.ML 
2 
ID: $Id$ 

3 
Author: Makarius 

4 

24935
a033971c63a0
removed LocalTheory.defs/target_morphism operations;
wenzelm
parents:
24914
diff
changeset

5 
Common theory/locale/class targets. 
20894  6 
*) 
7 

8 
signature THEORY_TARGET = 

9 
sig 

21006  10 
val peek: local_theory > string option 
24935
a033971c63a0
removed LocalTheory.defs/target_morphism operations;
wenzelm
parents:
24914
diff
changeset

11 
val begin: string > Proof.context > local_theory 
a033971c63a0
removed LocalTheory.defs/target_morphism operations;
wenzelm
parents:
24914
diff
changeset

12 
val init: string option > theory > local_theory 
a033971c63a0
removed LocalTheory.defs/target_morphism operations;
wenzelm
parents:
24914
diff
changeset

13 
val init_cmd: xstring option > theory > local_theory 
20894  14 
end; 
15 

16 
structure TheoryTarget: THEORY_TARGET = 

17 
struct 

18 

19 
(** locale targets **) 

20 

21006  21 
(* context data *) 
22 

23 
structure Data = ProofDataFun 

24 
( 

25 
type T = string option; 

26 
fun init _ = NONE; 

27 
); 

28 

29 
val peek = Data.get; 

30 

31 

20894  32 
(* pretty *) 
33 

34 
fun pretty loc ctxt = 

35 
let 

36 
val thy = ProofContext.theory_of ctxt; 

24939  37 
val loc_kind = if is_some (Class.class_of_locale thy loc) then "class" else "locale"; 
38 
val loc_name = Locale.extern thy loc; 

39 

20894  40 
val fixes = map (fn (x, T) => (x, SOME T, NoSyn)) (#1 (ProofContext.inferred_fixes ctxt)); 
21585  41 
val assumes = map (fn A => (("", []), [(A, [])])) (map Thm.term_of (Assumption.assms_of ctxt)); 
20894  42 
val elems = 
43 
(if null fixes then [] else [Element.Fixes fixes]) @ 

44 
(if null assumes then [] else [Element.Assumes assumes]); 

45 
in 

24939  46 
Pretty.block [Pretty.str "theory", Pretty.brk 1, Pretty.str (Context.theory_name thy)] :: 
47 
(if loc = "" then [] 

48 
else if null elems then [Pretty.str (loc_kind ^ " " ^ loc_name)] 

49 
else [Pretty.big_list (loc_kind ^ " " ^ loc_name ^ " =") 

50 
(map (Pretty.chunks o Element.pretty_ctxt ctxt) elems)]) 

20894  51 
end; 
52 

53 

24838  54 
(* target declarations *) 
55 

56 
fun target_decl add loc d lthy = 

57 
let 

24935
a033971c63a0
removed LocalTheory.defs/target_morphism operations;
wenzelm
parents:
24914
diff
changeset

58 
val d' = Morphism.transform (LocalTheory.target_morphism lthy) d; 
24838  59 
val d0 = Morphism.form d'; 
60 
in 

61 
if loc = "" then 

62 
lthy 

63 
> LocalTheory.theory (Context.theory_map d0) 

64 
> LocalTheory.target (Context.proof_map d0) 

65 
else 

66 
lthy 

67 
> LocalTheory.target (add loc d') 

68 
end; 

69 

70 
val type_syntax = target_decl Locale.add_type_syntax; 

71 
val term_syntax = target_decl Locale.add_term_syntax; 

72 
val declaration = target_decl Locale.add_declaration; 

73 

74 
fun target_naming loc lthy = 

75 
(if loc = "" then Sign.naming_of (ProofContext.theory_of lthy) 

76 
else ProofContext.naming_of (LocalTheory.target_of lthy)) 

77 
> NameSpace.qualified_names; 

78 

79 

21611
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

80 

20894  81 
(* notes *) 
82 

21611
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

83 
fun import_export_proof ctxt (name, raw_th) = 
21594
2859c94d67d4
reworked notes: towards proper import/export of proof terms;
wenzelm
parents:
21585
diff
changeset

84 
let 
21611
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

85 
val thy = ProofContext.theory_of ctxt; 
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

86 
val thy_ctxt = ProofContext.init thy; 
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

87 
val certT = Thm.ctyp_of thy; 
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

88 
val cert = Thm.cterm_of thy; 
21594
2859c94d67d4
reworked notes: towards proper import/export of proof terms;
wenzelm
parents:
21585
diff
changeset

89 

21611
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

90 
(*export assumes/defines*) 
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

91 
val th = Goal.norm_result raw_th; 
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

92 
val (defs, th') = LocalDefs.export ctxt thy_ctxt th; 
21708  93 
val concl_conv = MetaSimplifier.rewrite true defs (Thm.cprop_of th); 
94 
val assms = map (MetaSimplifier.rewrite_rule defs o Thm.assume) (Assumption.assms_of ctxt); 

21611
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

95 
val nprems = Thm.nprems_of th'  Thm.nprems_of th; 
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

96 

fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

97 
(*export fixes*) 
22692  98 
val tfrees = map TFree (Thm.fold_terms Term.add_tfrees th' []); 
99 
val frees = map Free (Thm.fold_terms Term.add_frees th' []); 

21611
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

100 
val (th'' :: vs) = (th' :: map (Drule.mk_term o cert) (map Logic.mk_type tfrees @ frees)) 
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

101 
> Variable.export ctxt thy_ctxt 
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

102 
> Drule.zero_var_indexes_list; 
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

103 

fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

104 
(*thm definition*) 
21644  105 
val result = th'' 
106 
> PureThy.name_thm true true "" 

107 
> Goal.close_result 

24779  108 
> fold PureThy.tag_rule (ContextPosition.properties_of ctxt) 
21644  109 
> PureThy.name_thm true true name; 
21611
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

110 

fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

111 
(*import fixes*) 
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

112 
val (tvars, vars) = 
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

113 
chop (length tfrees) (map (Thm.term_of o Drule.dest_term) vs) 
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

114 
>> map Logic.dest_type; 
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

115 

fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

116 
val instT = map_filter (fn (TVar v, T) => SOME (v, T)  _ => NONE) (tvars ~~ tfrees); 
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

117 
val inst = filter (is_Var o fst) (vars ~~ frees); 
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

118 
val cinstT = map (pairself certT o apfst TVar) instT; 
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

119 
val cinst = map (pairself (cert o Term.map_types (TermSubst.instantiateT instT))) inst; 
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

120 
val result' = Thm.instantiate (cinstT, cinst) result; 
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

121 

fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

122 
(*import assumes/defines*) 
21594
2859c94d67d4
reworked notes: towards proper import/export of proof terms;
wenzelm
parents:
21585
diff
changeset

123 
val assm_tac = FIRST' (map (fn assm => Tactic.compose_tac (false, assm, 0)) assms); 
21611
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

124 
val result'' = 
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

125 
(case SINGLE (Seq.INTERVAL assm_tac 1 nprems) result' of 
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

126 
NONE => raise THM ("Failed to reimport result", 0, [result']) 
21845  127 
 SOME res => LocalDefs.trans_props ctxt [res, Thm.symmetric concl_conv]) 
21644  128 
> Goal.norm_result 
129 
> PureThy.name_thm false false name; 

21611
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

130 

fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

131 
in (result'', result) end; 
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

132 

24939  133 
fun local_notes loc kind facts lthy = 
21585  134 
let 
21594
2859c94d67d4
reworked notes: towards proper import/export of proof terms;
wenzelm
parents:
21585
diff
changeset

135 
val is_loc = loc <> ""; 
2859c94d67d4
reworked notes: towards proper import/export of proof terms;
wenzelm
parents:
21585
diff
changeset

136 
val thy = ProofContext.theory_of lthy; 
21615
1bd558879c44
notes: proper naming of thm proof, activated import_export_proof;
wenzelm
parents:
21613
diff
changeset

137 
val full = LocalTheory.full_name lthy; 
21585  138 

21594
2859c94d67d4
reworked notes: towards proper import/export of proof terms;
wenzelm
parents:
21585
diff
changeset

139 
val facts' = facts 
21615
1bd558879c44
notes: proper naming of thm proof, activated import_export_proof;
wenzelm
parents:
21613
diff
changeset

140 
> map (fn (a, bs) => (a, PureThy.burrow_fact (PureThy.name_multi (full (fst a))) bs)) 
1bd558879c44
notes: proper naming of thm proof, activated import_export_proof;
wenzelm
parents:
21613
diff
changeset

141 
> PureThy.map_facts (import_export_proof lthy); 
21611
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

142 
val local_facts = PureThy.map_facts #1 facts' 
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

143 
> Attrib.map_facts (Attrib.attribute_i thy); 
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

144 
val target_facts = PureThy.map_facts #1 facts' 
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

145 
> is_loc ? Element.facts_map (Element.morph_ctxt (LocalTheory.target_morphism lthy)); 
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

146 
val global_facts = PureThy.map_facts #2 facts' 
21594
2859c94d67d4
reworked notes: towards proper import/export of proof terms;
wenzelm
parents:
21585
diff
changeset

147 
> Attrib.map_facts (if is_loc then K I else Attrib.attribute_i thy); 
2859c94d67d4
reworked notes: towards proper import/export of proof terms;
wenzelm
parents:
21585
diff
changeset

148 
in 
21611
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

149 
lthy > LocalTheory.theory 
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

150 
(Sign.qualified_names 
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

151 
#> PureThy.note_thmss_i kind global_facts #> snd 
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

152 
#> Sign.restore_naming thy) 
21585  153 

21611
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

154 
> is_loc ? LocalTheory.target (Locale.add_thmss loc kind target_facts) 
21594
2859c94d67d4
reworked notes: towards proper import/export of proof terms;
wenzelm
parents:
21585
diff
changeset

155 

20894  156 
> ProofContext.qualified_names 
21611
fc95ff1fe738
notes: proper import/export of proofs (still inactive);
wenzelm
parents:
21594
diff
changeset

157 
> ProofContext.note_thmss_i kind local_facts 
20894  158 
> ProofContext.restore_naming lthy 
159 
end; 

160 

161 

24939  162 
(* consts *) 
163 

164 
fun target_abbrev prmode ((c, mx), rhs) phi = 

165 
let 

166 
val c' = Morphism.name phi c; 

167 
val rhs' = Morphism.term phi rhs; 

168 
val arg' = (c', rhs'); 

169 
val eq_heads = 

170 
(case pairself Term.head_of (rhs, rhs') of 

171 
(Const (a, _), Const (a', _)) => a = a' 

172 
 _ => false); 

173 
in 

174 
eq_heads ? (Context.mapping_result 

175 
(Sign.add_abbrev Syntax.internalM [] arg') (ProofContext.add_abbrev Syntax.internalM [] arg') 

176 
#> (fn (lhs, _) => 

24983  177 
Type.similar_types (rhs, rhs') ? 
24949  178 
Morphism.form (ProofContext.target_notation true prmode [(lhs, mx)]))) 
24939  179 
end; 
180 

181 
fun internal_abbrev loc prmode ((c, mx), t) lthy = lthy 

182 
(* FIXME really permissive *) 

183 
> term_syntax loc (perhaps o try o target_abbrev prmode ((c, mx), t)) 

184 
> ProofContext.add_abbrev Syntax.internalM (ContextPosition.properties_of lthy) (c, t) 

185 
> snd; 

186 

187 
fun declare_consts loc depends decls lthy = 

188 
let 

189 
val thy = ProofContext.theory_of lthy; 

190 
val is_loc = loc <> ""; 

191 
val some_class = Class.class_of_locale thy loc; 

192 

193 
val xs = filter depends (#1 (ProofContext.inferred_fixes (LocalTheory.target_of lthy))); 

194 

195 
fun const ((c, T), mx) thy = 

196 
let 

197 
val U = map #2 xs > T; 

198 
val (mx1, mx2) = Class.fork_mixfix is_loc some_class mx; 

199 
val mx3 = if is_loc then NoSyn else mx1; 

24959
119793c84647
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset

200 
val (const, thy') = Sign.declare_const (ContextPosition.properties_of lthy) (c, U, mx3) thy; 
119793c84647
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset

201 
val t = Term.list_comb (const, map Free xs); 
24939  202 
in (((c, mx2), t), thy') end; 
203 
fun const_class (SOME class) ((c, _), mx) (_, t) = 

204 
LocalTheory.raw_theory_result (Class.add_const_in_class class ((c, t), mx)) 

205 
#> Class.remove_constraint [class] 

206 
 const_class NONE _ _ = I; 

207 
fun hide_abbrev (SOME class) abbrs thy = 

208 
let 

209 
val raw_cs = map (fst o fst) abbrs; 

210 
val prfx = (Logic.const_of_class o NameSpace.base) class; 

211 
fun mk_name c = 

212 
let 

213 
val n1 = Sign.full_name thy c; 

214 
val n2 = NameSpace.qualifier n1; 

215 
val n3 = NameSpace.base n1; 

216 
in NameSpace.implode [n2, prfx, prfx, n3] end; 

217 
val cs = map mk_name raw_cs; 

218 
in 

219 
Sign.hide_consts_i true cs thy 

220 
end 

221 
 hide_abbrev NONE _ thy = thy; 

222 

223 
val (abbrs, lthy') = lthy 

224 
> LocalTheory.theory_result (fold_map const decls) 

225 
val defs = map (apsnd (pair ("", []))) abbrs; 

226 

227 
in 

228 
lthy' 

229 
> fold2 (const_class some_class) decls abbrs 

24959
119793c84647
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24949
diff
changeset

230 
> is_loc ? fold (internal_abbrev loc Syntax.mode_default) abbrs 
24939  231 
> LocalTheory.raw_theory (hide_abbrev some_class abbrs) 
232 
(*FIXME abbreviations should never occur*) 

233 
> LocalDefs.add_defs defs 

234 
>> map (apsnd snd) 

235 
end; 

236 

237 

238 
(* abbrev *) 

239 

240 
fun occ_params ctxt ts = 

241 
#1 (ProofContext.inferred_fixes ctxt) 

242 
> filter (member (op =) (fold (Variable.add_fixed ctxt) ts [])); 

243 

244 
fun local_abbrev (x, rhs) = 

245 
Variable.add_fixes [x] #> (fn [x'] => 

246 
let 

247 
val T = Term.fastype_of rhs; 

248 
val lhs = Free (x', T); 

249 
in 

250 
Variable.declare_term lhs #> 

251 
Variable.declare_term rhs #> 

252 
Assumption.add_assms (K (K (I, Envir.expand_term_frees [((x', T), rhs)]))) [] #> snd #> 

253 
pair (lhs, rhs) 

254 
end); 

255 

256 
fun abbrev loc prmode ((raw_c, mx), raw_t) lthy = 

257 
let 

258 
val thy = ProofContext.theory_of lthy; 

259 
val is_loc = loc <> ""; 

260 
val some_class = Class.class_of_locale thy loc; 

261 

262 
val thy_ctxt = ProofContext.init thy; 

263 
val target = LocalTheory.target_of lthy; 

264 
val target_morphism = LocalTheory.target_morphism lthy; 

265 

266 
val c = Morphism.name target_morphism raw_c; 

267 
val t = Morphism.term target_morphism raw_t; 

268 
val xs = map Free (occ_params target [t]); 

269 
val u = fold_rev Term.lambda xs t; 

270 
val U = Term.fastype_of u; 

271 
val u' = singleton (Variable.export_terms (Variable.declare_term u target) thy_ctxt) u; 

272 
val (mx1, mx2) = Class.fork_mixfix is_loc some_class mx; 

273 
val mx3 = if is_loc then NoSyn else mx1; 

274 
fun add_abbrev_in_class (SOME class) abbr = 

275 
LocalTheory.raw_theory_result (Class.add_abbrev_in_class class prmode abbr) 

276 
#> (fn c => Class.remove_constraint [class] c) 

277 
 add_abbrev_in_class NONE _ = I; 

278 
in 

279 
lthy 

280 
> LocalTheory.theory_result 

281 
(Sign.add_abbrev (#1 prmode) (ContextPosition.properties_of lthy) (c, u')) 

24949  282 
> (fn (lhs as Const (full_c, _), rhs) => 
283 
LocalTheory.theory (Sign.notation true prmode [(lhs, mx3)]) 

284 
#> is_loc ? internal_abbrev loc prmode ((c, mx2), Term.list_comb (Const (full_c, U), xs)) 

285 
#> add_abbrev_in_class some_class ((c, Term.list_comb (Const (full_c, U), xs)), mx1) 

286 
#> local_abbrev (c, rhs)) 

24939  287 
end; 
288 

289 

290 
(* defs *) 

291 

292 
local 

293 

294 
fun expand_term ctxt t = 

295 
let 

296 
val thy = ProofContext.theory_of ctxt; 

297 
val thy_ctxt = ProofContext.init thy; 

298 
val ct = Thm.cterm_of thy t; 

299 
val (defs, ct') = LocalDefs.export ctxt thy_ctxt (Drule.mk_term ct) > Drule.dest_term; 

300 
in (Thm.term_of ct', MetaSimplifier.rewrite true defs ct) end; 

301 

302 
in 

303 

304 
fun local_def loc kind ((c, mx), ((name, atts), rhs)) lthy1 = 

305 
let 

306 
val (rhs', rhs_conv) = expand_term lthy1 rhs; 

307 
val xs = Variable.add_fixed (LocalTheory.target_of lthy1) rhs' []; 

308 
val T = Term.fastype_of rhs; 

309 

310 
(*consts*) 

311 
val ([(lhs, lhs_def)], lthy2) = lthy1 

312 
> declare_consts loc (member (op =) xs) [((c, T), mx)]; 

313 
val (_, lhs') = Logic.dest_equals (Thm.prop_of lhs_def); 

314 

315 
(*def*) 

316 
val name' = Thm.def_name_optional c name; 

317 
val (def, lthy3) = lthy2 

24983  318 
> LocalTheory.theory_result (Thm.add_def false (name', Logic.mk_equals (lhs', rhs'))); 
24939  319 
val eq = LocalDefs.trans_terms lthy3 
320 
[(*c == loc.c xs*) lhs_def, 

321 
(*lhs' == rhs'*) def, 

322 
(*rhs' == rhs*) Thm.symmetric rhs_conv]; 

323 

324 
(*notes*) 

325 
val ([(res_name, [res])], lthy4) = lthy3 

326 
> local_notes loc kind [((name', atts), [([eq], [])])]; 

327 
in ((lhs, (res_name, res)), lthy4) end; 

328 

329 
end; 

330 

331 

332 
(* axioms *) 

333 

334 
fun axioms loc kind specs lthy = 

335 
let 

336 
val hyps = map Thm.term_of (Assumption.assms_of lthy); 

337 
fun axiom ((name, atts), props) thy = thy 

24983  338 
> fold_map (Thm.add_axiom hyps) (PureThy.name_multi name props) 
24939  339 
> (fn ths => pair ((name, atts), [(ths, [])])); 
340 
in 

341 
lthy 

342 
> fold (fold Variable.declare_term o snd) specs 

343 
> LocalTheory.theory_result (fold_map axiom specs) 

344 
> local_notes loc kind 

345 
end; 

346 

347 

20894  348 
(* init and exit *) 
349 

22353  350 
fun begin loc ctxt = 
351 
let 

352 
val thy = ProofContext.theory_of ctxt; 

353 
val is_loc = loc <> ""; 

354 
in 

355 
ctxt 

356 
> Data.put (if is_loc then SOME loc else NONE) 

24939  357 
> fold Class.init (the_list (Class.class_of_locale thy loc)) 
24748  358 
> LocalTheory.init (NameSpace.base loc) 
21747  359 
{pretty = pretty loc, 
24939  360 
consts = declare_consts loc, 
361 
axioms = axioms loc, 

362 
abbrev = abbrev loc, 

363 
def = local_def loc, 

364 
notes = local_notes loc, 

21747  365 
type_syntax = type_syntax loc, 
366 
term_syntax = term_syntax loc, 

367 
declaration = declaration loc, 

22203  368 
target_naming = target_naming loc, 
21804  369 
reinit = fn _ => 
24657  370 
(if is_loc then Locale.init loc else ProofContext.init) 
371 
#> begin loc, 

24935
a033971c63a0
removed LocalTheory.defs/target_morphism operations;
wenzelm
parents:
24914
diff
changeset

372 
exit = LocalTheory.target_of} 
21747  373 
end; 
20894  374 

24935
a033971c63a0
removed LocalTheory.defs/target_morphism operations;
wenzelm
parents:
24914
diff
changeset

375 
fun init NONE thy = begin "" (ProofContext.init thy) 
a033971c63a0
removed LocalTheory.defs/target_morphism operations;
wenzelm
parents:
24914
diff
changeset

376 
 init (SOME loc) thy = begin loc (Locale.init loc thy); 
20894  377 

24935
a033971c63a0
removed LocalTheory.defs/target_morphism operations;
wenzelm
parents:
24914
diff
changeset

378 
fun init_cmd (SOME "") thy = init NONE thy 
a033971c63a0
removed LocalTheory.defs/target_morphism operations;
wenzelm
parents:
24914
diff
changeset

379 
 init_cmd loc thy = init (Option.map (Locale.intern thy) loc) thy; 
20894  380 

381 
end; 