Sublocale command.
1 (* Title: Pure/Isar/expression.ML
3 Author: Clemens Ballarin, TU Muenchen
5 New locale development --- experimental.
10 datatype 'term map = Positional of 'term option list | Named of (string * 'term) list;
11 type 'term expr = (string * (string * 'term map)) list;
12 type expression = string expr * (Name.binding * string option * mixfix) list;
13 type expression_i = term expr * (Name.binding * typ option * mixfix) list;
15 (* Processing of locale statements *)
16 val read_statement: Element.context list -> (string * string list) list list ->
17 Proof.context -> (term * term list) list list * Proof.context;
18 val cert_statement: Element.context_i list -> (term * term list) list list ->
19 Proof.context -> (term * term list) list list * Proof.context;
21 (* Declaring locales *)
22 val add_locale: string -> bstring -> expression -> Element.context list -> theory ->
23 string * Proof.context
24 val add_locale_i: string -> bstring -> expression_i -> Element.context_i list -> theory ->
25 string * Proof.context
28 val sublocale: (thm list list -> Proof.context -> Proof.context) ->
29 string -> expression -> theory -> Proof.state;
30 val sublocale_i: (thm list list -> Proof.context -> Proof.context) ->
31 string -> expression_i -> theory -> Proof.state;
33 (* Debugging and development *)
34 val parse_expression: OuterParse.token list -> expression * OuterParse.token list
38 structure Expression : EXPRESSION =
41 datatype ctxt = datatype Element.ctxt;
47 Positional of 'term option list |
48 Named of (string * 'term) list;
50 type 'term expr = (string * (string * 'term map)) list;
52 type expression = string expr * (Name.binding * string option * mixfix) list;
53 type expression_i = term expr * (Name.binding * typ option * mixfix) list;
56 (** Parsing and printing **)
60 structure P = OuterParse;
62 val loc_keyword = P.$$$ "fixes" || P.$$$ "constrains" || P.$$$ "assumes" ||
63 P.$$$ "defines" || P.$$$ "notes";
64 fun plus1_unless test scan =
65 scan ::: Scan.repeat (P.$$$ "+" |-- Scan.unless test (P.!!! scan));
67 val prefix = P.name --| P.$$$ ":";
68 val named = P.name -- (P.$$$ "=" |-- P.term);
69 val position = P.maybe P.term;
70 val instance = P.$$$ "where" |-- P.and_list1 named >> Named ||
71 Scan.repeat1 position >> Positional;
75 val parse_expression =
77 fun expr2 x = P.xname x;
78 fun expr1 x = (Scan.optional prefix "" -- expr2 --
79 Scan.optional instance (Named []) >> (fn ((p, l), i) => (l, (p, i)))) x;
80 fun expr0 x = (plus1_unless loc_keyword expr1) x;
81 in expr0 -- P.for_fixes end;
85 fun pretty_expr thy expr =
87 fun pretty_pos NONE = Pretty.str "_"
88 | pretty_pos (SOME x) = Pretty.str x;
89 fun pretty_named (x, y) = [Pretty.str x, Pretty.brk 1, Pretty.str "=",
90 Pretty.brk 1, Pretty.str y] |> Pretty.block;
91 fun pretty_ren (Positional ps) = take_suffix is_none ps |> snd |>
92 map pretty_pos |> Pretty.breaks
93 | pretty_ren (Named []) = []
94 | pretty_ren (Named ps) = Pretty.str "where" :: Pretty.brk 1 ::
95 (ps |> map pretty_named |> Pretty.separate "and");
96 fun pretty_rename (loc, ("", ren)) =
97 Pretty.block (Pretty.str (NewLocale.extern thy loc) :: Pretty.brk 1 :: pretty_ren ren)
98 | pretty_rename (loc, (prfx, ren)) =
99 Pretty.block (Pretty.str prfx :: Pretty.brk 1 :: Pretty.str (NewLocale.extern thy loc) ::
100 Pretty.brk 1 :: pretty_ren ren);
101 in Pretty.separate "+" (map pretty_rename expr) |> Pretty.block end;
103 fun err_in_expr thy msg expr =
106 if null expr then msg
107 else msg ^ "\n" ^ Pretty.string_of (Pretty.block
108 [Pretty.str "The above error(s) occurred in expression:", Pretty.brk 1,
109 pretty_expr thy expr])
110 in error err_msg end;
113 (** Internalise locale names in expr **)
115 fun intern thy instances = map (apfst (NewLocale.intern thy)) instances;
118 (** Parameters of expression.
120 Sanity check of instantiations and extraction of implicit parameters.
121 The latter only occurs iff strict = false.
122 Positional instantiations are extended to match full length of parameter list
123 of instantiated locale. **)
125 fun parameters_of thy strict (expr, fixed) =
127 fun reject_dups message xs =
128 let val dups = duplicates (op =) xs
130 if null dups then () else error (message ^ commas dups)
133 fun match_bind (n, b) = (n = Name.name_of b);
134 fun bind_eq (b1, b2) = (Name.name_of b1 = Name.name_of b2);
135 (* FIXME: cannot compare bindings for equality. *)
138 (NewLocale.params_of thy loc |> map (fn (p, _, mx) => (p, mx)), loc);
139 fun params_inst (expr as (loc, (prfx, Positional insts))) =
141 val (ps, loc') = params_loc loc;
142 val d = length ps - length insts;
144 if d < 0 then error ("More arguments than parameters in instantiation of locale " ^
145 quote (NewLocale.extern thy loc))
146 else insts @ replicate d NONE;
147 val ps' = (ps ~~ insts') |>
148 map_filter (fn (p, NONE) => SOME p | (_, SOME _) => NONE);
149 in (ps', (loc', (prfx, Positional insts'))) end
150 | params_inst (expr as (loc, (prfx, Named insts))) =
152 val _ = reject_dups "Duplicate instantiation of the following parameter(s): "
155 val (ps, loc') = params_loc loc;
156 val ps' = fold (fn (p, _) => fn ps =>
157 if AList.defined match_bind ps p then AList.delete match_bind p ps
158 else error (quote p ^" not a parameter of instantiated expression.")) insts ps;
159 in (ps', (loc', (prfx, Named insts))) end;
162 val (is', ps') = fold_map (fn i => fn ps =>
164 val (ps', i') = params_inst i;
165 val ps'' = AList.join bind_eq (fn p => fn (mx1, mx2) =>
166 (* FIXME: should check for bindings being the same.
167 Instead we check for equal name and syntax. *)
168 if mx1 = mx2 then mx1
169 else error ("Conflicting syntax for parameter" ^ quote (Name.display p) ^
170 " in expression.")) (ps, ps')
171 in (i', ps'') end) is []
174 val (implicit, expr') = params_expr expr;
176 val implicit' = map (#1 #> Name.name_of) implicit;
177 val fixed' = map (#1 #> Name.name_of) fixed;
178 val _ = reject_dups "Duplicate fixed parameter(s): " fixed';
179 val implicit'' = if strict then []
180 else let val _ = reject_dups
181 "Parameter(s) declared simultaneously in expression and for clause: " (implicit' @ fixed')
182 in map (fn (b, mx) => (b, NONE, mx)) implicit end;
184 in (expr', implicit'' @ fixed) end;
187 (** Read instantiation **)
189 (* Parse positional or named instantiation *)
193 fun prep_inst parse_term parms (Positional insts) ctxt =
194 (insts ~~ parms) |> map (fn
195 (NONE, p) => Syntax.parse_term ctxt p |
196 (SOME t, _) => parse_term ctxt t)
197 | prep_inst parse_term parms (Named insts) ctxt =
198 parms |> map (fn p => case AList.lookup (op =) insts p of
199 SOME t => parse_term ctxt t |
200 NONE => Syntax.parse_term ctxt p);
204 fun parse_inst x = prep_inst Syntax.parse_term x;
205 fun make_inst x = prep_inst (K I) x;
210 (* Instantiation morphism *)
212 fun inst_morph (parm_names, parm_types) (prfx, insts') ctxt =
215 val type_parm_names = fold Term.add_tfreesT parm_types [] |> map fst;
217 (* type inference and contexts *)
218 val parm_types' = map (TypeInfer.paramify_vars o Logic.varifyT) parm_types;
219 val type_parms = fold Term.add_tvarsT parm_types' [] |> map (Logic.mk_type o TVar);
220 val arg = type_parms @ map2 TypeInfer.constrain parm_types' insts';
221 val res = Syntax.check_terms ctxt arg;
222 val ctxt' = ctxt |> fold Variable.auto_fixes res;
225 val (type_parms'', res') = chop (length type_parms) res;
226 val insts'' = (parm_names ~~ res') |> map_filter
227 (fn (inst as (x, Free (y, _))) => if x = y then NONE else SOME inst |
229 val instT = Symtab.make (type_parm_names ~~ map Logic.dest_type type_parms'');
230 val inst = Symtab.make insts'';
232 (Element.inst_morphism (ProofContext.theory_of ctxt) (instT, inst) $>
233 Morphism.name_morphism (Name.qualified prfx), ctxt')
237 (*** Locale processing ***)
241 fun parse_elem prep_typ prep_term ctxt elem =
242 Element.map_ctxt {name = I, var = I, typ = prep_typ ctxt,
243 term = prep_term ctxt, fact = I, attrib = I} elem;
245 fun parse_concl prep_term ctxt concl =
246 (map o map) (fn (t, ps) =>
247 (prep_term ctxt, map (prep_term ctxt) ps)) concl;
250 (** Simultaneous type inference: instantiations + elements + conclusion **)
254 fun mk_type T = (Logic.mk_type T, []);
255 fun mk_term t = (t, []);
256 fun mk_propp (p, pats) = (Syntax.type_constraint propT p, pats);
258 fun dest_type (T, []) = Logic.dest_type T;
259 fun dest_term (t, []) = t;
260 fun dest_propp (p, pats) = (p, pats);
262 fun extract_inst (_, (_, ts)) = map mk_term ts;
263 fun restore_inst ((l, (p, _)), cs) = (l, (p, map dest_term cs));
265 fun extract_elem (Fixes fixes) = map (#2 #> the_list #> map mk_type) fixes
266 | extract_elem (Constrains csts) = map (#2 #> single #> map mk_type) csts
267 | extract_elem (Assumes asms) = map (#2 #> map mk_propp) asms
268 | extract_elem (Defines defs) = map (fn (_, (t, ps)) => [mk_propp (t, ps)]) defs
269 | extract_elem (Notes _) = [];
271 fun restore_elem (Fixes fixes, css) =
272 (fixes ~~ css) |> map (fn ((x, _, mx), cs) =>
273 (x, cs |> map dest_type |> try hd, mx)) |> Fixes
274 | restore_elem (Constrains csts, css) =
275 (csts ~~ css) |> map (fn ((x, _), cs) =>
276 (x, cs |> map dest_type |> hd)) |> Constrains
277 | restore_elem (Assumes asms, css) =
278 (asms ~~ css) |> map (fn ((b, _), cs) => (b, map dest_propp cs)) |> Assumes
279 | restore_elem (Defines defs, css) =
280 (defs ~~ css) |> map (fn ((b, _), [c]) => (b, dest_propp c)) |> Defines
281 | restore_elem (Notes notes, _) = Notes notes;
283 fun check cs context =
285 fun prep (_, pats) (ctxt, t :: ts) =
286 let val ctxt' = Variable.auto_fixes t ctxt
288 ((t, Syntax.check_props (ProofContext.set_mode ProofContext.mode_pattern ctxt') pats),
291 val (cs', (context', _)) = fold_map prep cs
292 (context, Syntax.check_terms
293 (ProofContext.set_mode ProofContext.mode_schematic context) (map fst cs));
294 in (cs', context') end;
298 fun check_autofix insts elems concl ctxt =
300 val inst_cs = map extract_inst insts;
301 val elem_css = map extract_elem elems;
302 val concl_cs = (map o map) mk_propp concl;
304 val (inst_cs' :: css', ctxt') =
305 (fold_burrow o fold_burrow) check (inst_cs :: elem_css @ [concl_cs]) ctxt;
306 (* Re-check to resolve bindings, elements and conclusion only *)
307 val (css'', _) = (fold_burrow o fold_burrow) check css' ctxt';
308 val (elem_css'', [concl_cs'']) = chop (length elem_css) css'';
310 (map restore_inst (insts ~~ inst_cs'), map restore_elem (elems ~~ elem_css''),
317 (** Prepare locale elements **)
319 fun declare_elem prep_vars (Fixes fixes) ctxt =
320 let val (vars, _) = prep_vars fixes ctxt
321 in ctxt |> ProofContext.add_fixes_i vars |> snd end
322 | declare_elem prep_vars (Constrains csts) ctxt =
323 ctxt |> prep_vars (map (fn (x, T) => (Name.binding x, SOME T, NoSyn)) csts) |> snd
324 | declare_elem _ (Assumes _) ctxt = ctxt
325 | declare_elem _ (Defines _) ctxt = ctxt
326 | declare_elem _ (Notes _) ctxt = ctxt;
328 (** Finish locale elements, extract specification text **)
330 val norm_term = Envir.beta_norm oo Term.subst_atomic;
332 fun abstract_thm thy eq =
333 Thm.assume (Thm.cterm_of thy eq) |> Drule.gen_all |> Drule.abs_def;
335 fun bind_def ctxt eq (xs, env, ths) =
337 val ((y, T), b) = LocalDefs.abs_def eq;
338 val b' = norm_term env b;
339 val th = abstract_thm (ProofContext.theory_of ctxt) eq;
340 fun err msg = error (msg ^ ": " ^ quote y);
342 exists (fn (x, _) => x = y) xs andalso
343 err "Attempt to define previously specified variable";
344 exists (fn (Free (y', _), _) => y = y' | _ => false) env andalso
345 err "Attempt to redefine variable";
346 (Term.add_frees b' xs, (Free (y, T), b') :: env, th :: ths)
349 fun eval_text _ _ (Fixes _) text = text
350 | eval_text _ _ (Constrains _) text = text
351 | eval_text _ is_ext (Assumes asms)
352 (((exts, exts'), (ints, ints')), (xs, env, defs)) =
354 val ts = maps (map #1 o #2) asms;
355 val ts' = map (norm_term env) ts;
357 if is_ext then ((exts @ ts, exts' @ ts'), (ints, ints'))
358 else ((exts, exts'), (ints @ ts, ints' @ ts'));
359 in (spec', (fold Term.add_frees ts' xs, env, defs)) end
360 | eval_text ctxt _ (Defines defs) (spec, binds) =
361 (spec, fold (bind_def ctxt o #1 o #2) defs binds)
362 | eval_text _ _ (Notes _) text = text;
364 fun closeup _ _ false elem = elem
365 | closeup ctxt parms true elem =
370 Term.fold_aterms (fn Free (x, T) =>
371 if AList.defined (op =) parms x then I else insert (op =) (x, T) | _ => I) t [];
372 in Term.list_all_free (rev rev_frees, t) end;
375 | no_binds _ = error "Illegal term bindings in context element";
378 Assumes asms => Assumes (asms |> map (fn (a, propps) =>
379 (a, map (fn (t, ps) => (close_frees t, no_binds ps)) propps)))
380 | Defines defs => Defines (defs |> map (fn (a, (t, ps)) =>
381 (a, (close_frees (#2 (LocalDefs.cert_def ctxt t)), no_binds ps))))
385 fun finish_primitive parms _ (Fixes fixes) = Fixes (map (fn (binding, _, mx) =>
386 let val x = Name.name_of binding
387 in (binding, AList.lookup (op =) parms x, mx) end) fixes)
388 | finish_primitive _ _ (Constrains _) = Constrains []
389 | finish_primitive _ close (Assumes asms) = close (Assumes asms)
390 | finish_primitive _ close (Defines defs) = close (Defines defs)
391 | finish_primitive _ _ (Notes facts) = Notes facts;
393 fun finish_inst ctxt parms do_close (loc, (prfx, inst)) text =
395 val thy = ProofContext.theory_of ctxt;
396 val (parm_names, parm_types) = NewLocale.params_of thy loc |>
397 map (fn (b, SOME T, _) => (Name.name_of b, T)) |> split_list;
398 val (asm, defs) = NewLocale.specification_of thy loc;
399 val (morph, _) = inst_morph (parm_names, parm_types) (prfx, inst) ctxt;
400 val asm' = Option.map (Morphism.term morph) asm;
401 val defs' = map (Morphism.term morph) defs;
404 then eval_text ctxt false (Assumes [(Attrib.no_binding, [(the asm', [])])])
407 then eval_text ctxt false (Defines (map (fn def => (Attrib.no_binding, (def, []))) defs'))
409 (* FIXME clone from new_locale.ML *)
410 in ((loc, morph), text') end;
412 fun finish_elem ctxt parms do_close elem text =
414 val elem' = finish_primitive parms (closeup ctxt parms do_close) elem;
415 val text' = eval_text ctxt true elem' text;
416 in (elem', text') end
418 fun finish ctxt parms do_close insts elems text =
420 val (deps, text') = fold_map (finish_inst ctxt parms do_close) insts text;
421 val (elems', text'') = fold_map (finish_elem ctxt parms do_close) elems text';
422 in (deps, elems', text'') end;
425 (** Process full context statement: instantiations + elements + conclusion **)
427 (* Interleave incremental parsing and type inference over entire parsed stretch. *)
431 fun prep_full_context_statement parse_typ parse_prop parse_inst prep_vars prep_expr
432 strict do_close context raw_import raw_elems raw_concl =
434 val thy = ProofContext.theory_of context;
436 val (raw_insts, fixed) = parameters_of thy strict (apfst (prep_expr thy) raw_import);
438 fun prep_inst (loc, (prfx, inst)) (i, marked, insts, ctxt) =
440 val (parm_names, parm_types) = NewLocale.params_of thy loc |>
441 map (fn (b, SOME T, _) => (Name.name_of b, T)) |> split_list;
442 val inst' = parse_inst parm_names inst ctxt;
443 val parm_types' = map (TypeInfer.paramify_vars o
444 Term.map_type_tvar (fn ((x, _), S) => TVar ((x, i), S)) o Logic.varifyT) parm_types;
445 val inst'' = map2 TypeInfer.constrain parm_types' inst';
446 val insts' = insts @ [(loc, (prfx, inst''))];
447 val (insts'', _, _, ctxt') = check_autofix insts' [] [] ctxt;
448 val inst''' = insts'' |> List.last |> snd |> snd;
449 val (morph, _) = inst_morph (parm_names, parm_types) (prfx, inst''') ctxt;
450 val (marked', ctxt'') = NewLocale.activate_declarations thy (loc, morph) (marked, ctxt);
451 in (i+1, marked', insts', ctxt'') end;
453 fun prep_elem raw_elem (insts, elems, ctxt) =
455 val ctxt' = declare_elem prep_vars raw_elem ctxt;
456 val elems' = elems @ [parse_elem parse_typ parse_prop ctxt' raw_elem];
457 (* FIXME term bindings *)
458 val (_, _, _, ctxt'') = check_autofix insts elems' [] ctxt';
459 in (insts, elems', ctxt') end;
461 fun prep_concl raw_concl (insts, elems, ctxt) =
463 val concl = (map o map) (fn (t, ps) =>
464 (parse_prop ctxt t, map (parse_prop ctxt) ps)) raw_concl;
465 in check_autofix insts elems concl ctxt end;
467 val fors = prep_vars fixed context |> fst;
468 val ctxt = context |> ProofContext.add_fixes_i fors |> snd;
469 val (_, _, insts', ctxt') = fold prep_inst raw_insts (0, NewLocale.empty, [], ctxt);
470 val (_, elems'', ctxt'') = fold prep_elem raw_elems (insts', [], ctxt');
471 val (insts, elems, concl, ctxt) = prep_concl raw_concl (insts', elems'', ctxt'');
473 (* Retrieve parameter types *)
474 val xs = fold (fn Fixes fixes => (fn ps => ps @ map (Name.name_of o #1) fixes) |
475 _ => fn ps => ps) (Fixes fors :: elems) [];
476 val (Ts, ctxt') = fold_map ProofContext.inferred_param xs ctxt;
477 val parms = xs ~~ Ts; (* params from expression and elements *)
479 val Fixes fors' = finish_primitive parms I (Fixes fors);
480 val (deps, elems', text) = finish ctxt' parms do_close insts elems ((([], []), ([], [])), ([], [], []));
481 (* text has the following structure:
482 (((exts, exts'), (ints, ints')), (xs, env, defs))
484 exts: external assumptions (terms in assumes elements)
485 exts': dito, normalised wrt. env
486 ints: internal assumptions (terms in assumptions from insts)
487 ints': dito, normalised wrt. env
488 xs: the free variables in exts' and ints' and rhss of definitions,
489 this includes parameters except defined parameters
490 env: list of term pairs encoding substitutions, where the first term
491 is a free variable; substitutions represent defines elements and
492 the rhs is normalised wrt. the previous env
493 defs: theorems representing the substitutions from defines elements
494 (thms are normalised wrt. env).
495 elems is an updated version of raw_elems:
496 - type info added to Fixes and modified in Constrains
497 - axiom and definition statement replaced by corresponding one
498 from proppss in Assumes and Defines
502 in ((parms, fors', deps, elems', concl), text) end
506 fun read_full_context_statement x =
507 prep_full_context_statement Syntax.parse_typ Syntax.parse_prop parse_inst
508 ProofContext.read_vars intern x;
509 fun cert_full_context_statement x =
510 prep_full_context_statement (K I) (K I) make_inst ProofContext.cert_vars (K I) x;
515 (* full context statements: import + elements + conclusion *)
519 fun prep_context_statement prep_full_context_statement activate_elems
520 strict do_close imprt elements raw_concl context =
522 val thy = ProofContext.theory_of context;
524 val ((parms, fixed, deps, elems, concl), (spec, (_, _, defs))) =
525 prep_full_context_statement strict do_close context imprt elements raw_concl;
527 val (_, ctxt0) = ProofContext.add_fixes_i fixed context;
528 val (_, ctxt) = fold (NewLocale.activate_facts thy) deps (NewLocale.empty, ctxt0);
529 val ((elems', _), ctxt') = activate_elems elems (ProofContext.set_stmt true ctxt);
531 (((fixed, deps), (ctxt', elems'), (parms, spec, defs)), concl)
534 fun prep_statement prep_ctxt elems concl ctxt =
536 val (((_, (ctxt', _), _)), concl) = prep_ctxt true false ([], []) elems concl ctxt
537 in (concl, ctxt') end;
541 fun read_statement body concl ctxt =
542 prep_statement (prep_context_statement read_full_context_statement Element.activate) body concl ctxt;
543 fun cert_statement body concl ctxt =
544 prep_statement (prep_context_statement cert_full_context_statement Element.activate_i) body concl ctxt;
546 fun read_context strict imprt body ctxt =
547 #1 (prep_context_statement read_full_context_statement Element.activate strict true imprt body [] ctxt);
548 fun cert_context strict imprt body ctxt =
549 #1 (prep_context_statement cert_full_context_statement Element.activate_i strict true imprt body [] ctxt);
554 (*** Locale declarations ***)
558 (* introN: name of theorems for introduction rules of locale and
560 axiomsN: name of theorem set with destruct rules for locale predicates,
561 also name suffix of delta predicates. *)
563 val introN = "intro";
564 val axiomsN = "axioms";
566 fun atomize_spec thy ts =
568 val t = Logic.mk_conjunction_balanced ts;
569 val body = ObjectLogic.atomize_term thy t;
570 val bodyT = Term.fastype_of body;
572 if bodyT = propT then (t, propT, Thm.reflexive (Thm.cterm_of thy t))
573 else (body, bodyT, ObjectLogic.atomize (Thm.cterm_of thy t))
576 (* achieve plain syntax for locale predicates (without "PROP") *)
578 fun aprop_tr' n c = (Syntax.constN ^ c, fn ctxt => fn args =>
579 if length args = n then
580 Syntax.const "_aprop" $
581 Term.list_comb (Syntax.free (Consts.extern (ProofContext.consts_of ctxt) c), args)
584 (* CB: define one predicate including its intro rule and axioms
585 - bname: predicate name
586 - parms: locale parameters
587 - defs: thms representing substitutions from defines elements
588 - ts: terms representing locale assumptions (not normalised wrt. defs)
589 - norm_ts: terms representing locale assumptions (normalised wrt. defs)
593 fun def_pred bname parms defs ts norm_ts thy =
595 val name = Sign.full_name thy bname;
597 val (body, bodyT, body_eq) = atomize_spec thy norm_ts;
598 val env = Term.add_term_free_names (body, []);
599 val xs = filter (member (op =) env o #1) parms;
601 val extraTs = (Term.term_tfrees body \\ fold Term.add_tfreesT Ts [])
602 |> Library.sort_wrt #1 |> map TFree;
603 val predT = map Term.itselfT extraTs ---> Ts ---> bodyT;
605 val args = map Logic.mk_type extraTs @ map Free xs;
606 val head = Term.list_comb (Const (name, predT), args);
607 val statement = ObjectLogic.ensure_propT thy head;
609 val ([pred_def], defs_thy) =
611 |> bodyT = propT ? Sign.add_advanced_trfuns ([], [], [aprop_tr' (length args) name], [])
612 |> Sign.declare_const [] ((Name.binding bname, predT), NoSyn) |> snd
613 |> PureThy.add_defs false
614 [((Thm.def_name bname, Logic.mk_equals (head, body)), [Thm.kind_internal])];
615 val defs_ctxt = ProofContext.init defs_thy |> Variable.declare_term head;
617 val cert = Thm.cterm_of defs_thy;
619 val intro = Goal.prove_global defs_thy [] norm_ts statement (fn _ =>
620 MetaSimplifier.rewrite_goals_tac [pred_def] THEN
621 Tactic.compose_tac (false, body_eq RS Drule.equal_elim_rule1, 1) 1 THEN
622 Tactic.compose_tac (false,
623 Conjunction.intr_balanced (map (Thm.assume o cert) norm_ts), 0) 1);
626 (Drule.equal_elim_rule2 OF [body_eq,
627 MetaSimplifier.rewrite_rule [pred_def] (Thm.assume (cert statement))])
628 |> Conjunction.elim_balanced (length ts);
629 val axioms = ts ~~ conjuncts |> map (fn (t, ax) =>
630 Element.prove_witness defs_ctxt t
631 (MetaSimplifier.rewrite_goals_tac defs THEN
632 Tactic.compose_tac (false, ax, 0) 1));
633 in ((statement, intro, axioms), defs_thy) end;
637 (* CB: main predicate definition function *)
639 fun define_preds pname (parms, ((exts, exts'), (ints, ints')), defs) thy =
641 val (a_pred, a_intro, a_axioms, thy'') =
642 if null exts then (NONE, NONE, [], thy)
645 val aname = if null ints then pname else pname ^ "_" ^ axiomsN;
646 val ((statement, intro, axioms), thy') =
648 |> def_pred aname parms defs exts exts';
651 |> Sign.add_path aname
652 |> Sign.no_base_names
653 |> PureThy.note_thmss Thm.internalK [((Name.binding introN, []), [([intro], [])])]
654 ||> Sign.restore_naming thy';
655 in (SOME statement, SOME intro, axioms, thy'') end;
656 val (b_pred, b_intro, b_axioms, thy'''') =
657 if null ints then (NONE, NONE, [], thy'')
660 val ((statement, intro, axioms), thy''') =
662 |> def_pred pname parms defs (ints @ the_list a_pred) (ints' @ the_list a_pred);
665 |> Sign.add_path pname
666 |> Sign.no_base_names
667 |> PureThy.note_thmss Thm.internalK
668 [((Name.binding introN, []), [([intro], [])]),
669 ((Name.binding axiomsN, []),
670 [(map (Drule.standard o Element.conclude_witness) axioms, [])])]
671 ||> Sign.restore_naming thy''';
672 in (SOME statement, SOME intro, axioms, thy'''') end;
673 in ((a_pred, a_intro, a_axioms), (b_pred, b_intro, b_axioms), thy'''') end;
680 fun assumes_to_notes (Assumes asms) axms =
681 fold_map (fn (a, spec) => fn axs =>
682 let val (ps, qs) = chop (length spec) axs
683 in ((a, [(ps, [])]), qs) end) asms axms
684 |> apfst (curry Notes Thm.assumptionK)
685 | assumes_to_notes e axms = (e, axms);
687 fun defines_to_notes thy (Defines defs) defns =
689 val defs' = map (fn (_, (def, _)) => def) defs
690 val notes = map (fn (a, (def, _)) =>
691 (a, [([assume (cterm_of thy def)], [])])) defs
693 (Notes (Thm.definitionK, notes), defns @ defs')
695 | defines_to_notes _ e defns = (e, defns);
697 fun gen_add_locale prep_context
698 bname predicate_name raw_imprt raw_body thy =
700 val thy_ctxt = ProofContext.init thy;
701 val name = Sign.full_name thy bname;
702 val _ = NewLocale.test_locale thy name andalso
703 error ("Duplicate definition of locale " ^ quote name);
705 val ((fixed, deps), (_, body_elems), text as (parms, ((_, exts'), _), defs)) =
706 prep_context false raw_imprt raw_body thy_ctxt;
707 val ((a_statement, a_intro, a_axioms), (b_statement, b_intro, b_axioms), thy') =
708 define_preds predicate_name text thy;
710 val extraTs = fold Term.add_tfrees exts' [] \\ fold Term.add_tfreesT (map snd parms) [];
711 val _ = if null extraTs then ()
712 else warning ("Additional type variable(s) in locale specification " ^ quote bname);
714 val satisfy = Element.satisfy_morphism b_axioms;
716 (body_elems |> map_filter (fn Fixes fixes => SOME fixes | _ => NONE) |> flat);
717 val (body_elems', defns) = fold_map (defines_to_notes thy) body_elems [];
719 val notes = body_elems' |>
720 (fn elems => fold_map assumes_to_notes elems (map Element.conclude_witness a_axioms)) |>
721 fst |> map (Element.morph_ctxt satisfy) |>
722 map_filter (fn Notes notes => SOME notes | _ => NONE);
724 val deps' = map (fn (l, morph) => (l, morph $> satisfy)) deps;
726 val loc_ctxt = thy' |>
727 NewLocale.register_locale name (extraTs, params)
728 (if is_some b_statement then b_statement else a_statement, map prop_of defs) ([], [])
729 (map (fn n => (n, stamp ())) notes |> rev) (map (fn d => (d, stamp ())) deps' |> rev) |>
731 in (name, loc_ctxt) end;
735 val add_locale = gen_add_locale read_context;
736 val add_locale_i = gen_add_locale cert_context;
741 (*** Interpretation ***)
743 (** Witnesses and goals **)
745 fun prep_propp propss = propss |> map (map (rpair [] o Element.mark_witness));
747 fun prep_result propps thmss =
748 ListPair.map (fn (props, thms) => map2 Element.make_witness props thms) (propps, thmss);
751 (** Interpretation between locales: declaring sublocale relationships **)
755 fun store_dep target ((name, morph), thms) =
756 NewLocale.add_dependency target (name, morph $> Element.satisfy_morphism thms);
758 fun gen_sublocale prep_expr
759 after_qed target expression thy =
761 val target_ctxt = NewLocale.init target thy;
762 val target' = NewLocale.intern thy target;
764 val ((_, fixed, deps, _, _), _) = prep_expr true true target_ctxt expression [] [];
765 val (_, goal_ctxt) = ProofContext.add_fixes_i fixed target_ctxt;
767 (* proof obligations from deps *)
768 fun props_of (name, morph) =
770 val (asm, defs) = NewLocale.specification_of thy name;
772 (case asm of NONE => defs | SOME asm => asm :: defs) |> map (Morphism.term morph)
775 val propss = map props_of deps;
777 fun after_qed' results =
778 fold (store_dep target') (deps ~~ prep_result propss results) #>
783 Proof.theorem_i NONE after_qed' (prep_propp propss) |>
784 Element.refine_witness |> Seq.hd
789 fun sublocale x = gen_sublocale read_full_context_statement x;
790 fun sublocale_i x = gen_sublocale cert_full_context_statement x;