ballarin@28697
|
1 |
(* Title: Pure/Isar/expression.ML
|
ballarin@28697
|
2 |
Author: Clemens Ballarin, TU Muenchen
|
ballarin@28697
|
3 |
|
haftmann@29360
|
4 |
Locale expressions.
|
ballarin@28697
|
5 |
*)
|
ballarin@28697
|
6 |
|
ballarin@28697
|
7 |
signature EXPRESSION =
|
ballarin@28697
|
8 |
sig
|
haftmann@29501
|
9 |
(* Locale expressions *)
|
haftmann@29501
|
10 |
datatype 'term map = Positional of 'term option list | Named of (string * 'term) list
|
haftmann@29501
|
11 |
type 'term expr = (string * ((string * bool) * 'term map)) list
|
haftmann@29578
|
12 |
type expression_i = term expr * (binding * typ option * mixfix) list
|
haftmann@29578
|
13 |
type expression = string expr * (binding * string option * mixfix) list
|
ballarin@28697
|
14 |
|
ballarin@28898
|
15 |
(* Processing of context statements *)
|
haftmann@29439
|
16 |
val cert_statement: Element.context_i list -> (term * term list) list list ->
|
haftmann@29501
|
17 |
Proof.context -> (term * term list) list list * Proof.context
|
ballarin@28879
|
18 |
val read_statement: Element.context list -> (string * string list) list list ->
|
haftmann@29501
|
19 |
Proof.context -> (term * term list) list list * Proof.context
|
ballarin@28879
|
20 |
|
ballarin@28795
|
21 |
(* Declaring locales *)
|
haftmann@29702
|
22 |
val cert_declaration: expression_i -> (Proof.context -> Proof.context) -> Element.context_i list ->
|
haftmann@29702
|
23 |
Proof.context -> ((binding * typ option * mixfix) list * (string * morphism) list
|
haftmann@29501
|
24 |
* Element.context_i list) * ((string * typ) list * Proof.context)
|
haftmann@29702
|
25 |
val cert_read_declaration: expression_i -> (Proof.context -> Proof.context) -> Element.context list ->
|
haftmann@29702
|
26 |
Proof.context -> ((binding * typ option * mixfix) list * (string * morphism) list
|
haftmann@29501
|
27 |
* Element.context_i list) * ((string * typ) list * Proof.context)
|
haftmann@29501
|
28 |
(*FIXME*)
|
haftmann@29702
|
29 |
val read_declaration: expression -> (Proof.context -> Proof.context) -> Element.context list ->
|
haftmann@29702
|
30 |
Proof.context -> ((binding * typ option * mixfix) list * (string * morphism) list
|
haftmann@29501
|
31 |
* Element.context_i list) * ((string * typ) list * Proof.context)
|
haftmann@29389
|
32 |
val add_locale: bstring -> bstring -> expression_i -> Element.context_i list ->
|
haftmann@29501
|
33 |
theory -> string * local_theory
|
haftmann@29389
|
34 |
val add_locale_cmd: bstring -> bstring -> expression -> Element.context list ->
|
haftmann@29501
|
35 |
theory -> string * local_theory
|
ballarin@28885
|
36 |
|
ballarin@28895
|
37 |
(* Interpretation *)
|
haftmann@29439
|
38 |
val cert_goal_expression: expression_i -> Proof.context ->
|
haftmann@29501
|
39 |
(term list list * (string * morphism) list * morphism) * Proof.context
|
haftmann@29496
|
40 |
val read_goal_expression: expression -> Proof.context ->
|
haftmann@29501
|
41 |
(term list list * (string * morphism) list * morphism) * Proof.context
|
haftmann@29501
|
42 |
val sublocale: string -> expression_i -> theory -> Proof.state
|
haftmann@29501
|
43 |
val sublocale_cmd: string -> expression -> theory -> Proof.state
|
haftmann@29362
|
44 |
val interpretation: expression_i -> (Attrib.binding * term) list ->
|
haftmann@29501
|
45 |
theory -> Proof.state
|
haftmann@29358
|
46 |
val interpretation_cmd: expression -> (Attrib.binding * string) list ->
|
haftmann@29501
|
47 |
theory -> Proof.state
|
haftmann@29501
|
48 |
val interpret: expression_i -> bool -> Proof.state -> Proof.state
|
haftmann@29501
|
49 |
val interpret_cmd: expression -> bool -> Proof.state -> Proof.state
|
ballarin@28697
|
50 |
end;
|
ballarin@28697
|
51 |
|
ballarin@28697
|
52 |
|
ballarin@28885
|
53 |
structure Expression : EXPRESSION =
|
ballarin@28697
|
54 |
struct
|
ballarin@28697
|
55 |
|
ballarin@28795
|
56 |
datatype ctxt = datatype Element.ctxt;
|
ballarin@28795
|
57 |
|
ballarin@28795
|
58 |
|
ballarin@28795
|
59 |
(*** Expressions ***)
|
ballarin@28697
|
60 |
|
ballarin@28872
|
61 |
datatype 'term map =
|
ballarin@28872
|
62 |
Positional of 'term option list |
|
ballarin@28872
|
63 |
Named of (string * 'term) list;
|
ballarin@28697
|
64 |
|
ballarin@29214
|
65 |
type 'term expr = (string * ((string * bool) * 'term map)) list;
|
ballarin@28697
|
66 |
|
haftmann@29578
|
67 |
type expression = string expr * (binding * string option * mixfix) list;
|
haftmann@29578
|
68 |
type expression_i = term expr * (binding * typ option * mixfix) list;
|
ballarin@28795
|
69 |
|
ballarin@28697
|
70 |
|
ballarin@28859
|
71 |
(** Internalise locale names in expr **)
|
ballarin@28697
|
72 |
|
haftmann@29360
|
73 |
fun intern thy instances = map (apfst (Locale.intern thy)) instances;
|
ballarin@28697
|
74 |
|
ballarin@28795
|
75 |
|
ballarin@28859
|
76 |
(** Parameters of expression.
|
ballarin@28697
|
77 |
|
ballarin@28895
|
78 |
Sanity check of instantiations and extraction of implicit parameters.
|
ballarin@28895
|
79 |
The latter only occurs iff strict = false.
|
ballarin@28895
|
80 |
Positional instantiations are extended to match full length of parameter list
|
ballarin@28895
|
81 |
of instantiated locale. **)
|
ballarin@28895
|
82 |
|
ballarin@28895
|
83 |
fun parameters_of thy strict (expr, fixed) =
|
ballarin@28697
|
84 |
let
|
ballarin@28697
|
85 |
fun reject_dups message xs =
|
ballarin@28697
|
86 |
let val dups = duplicates (op =) xs
|
ballarin@28697
|
87 |
in
|
ballarin@28697
|
88 |
if null dups then () else error (message ^ commas dups)
|
ballarin@28697
|
89 |
end;
|
ballarin@28697
|
90 |
|
haftmann@28999
|
91 |
fun match_bind (n, b) = (n = Binding.base_name b);
|
wenzelm@29288
|
92 |
fun parm_eq ((b1, mx1: mixfix), (b2, mx2)) =
|
ballarin@29030
|
93 |
(* FIXME: cannot compare bindings for equality, instead check for equal name and syntax *)
|
ballarin@29030
|
94 |
(Binding.base_name b1 = Binding.base_name b2) andalso
|
ballarin@29030
|
95 |
(if mx1 = mx2 then true
|
ballarin@29030
|
96 |
else error ("Conflicting syntax for parameter" ^ quote (Binding.display b1) ^
|
ballarin@29030
|
97 |
" in expression."));
|
ballarin@29030
|
98 |
|
haftmann@28999
|
99 |
fun bind_eq (b1, b2) = (Binding.base_name b1 = Binding.base_name b2);
|
ballarin@28795
|
100 |
(* FIXME: cannot compare bindings for equality. *)
|
ballarin@28795
|
101 |
|
ballarin@28795
|
102 |
fun params_loc loc =
|
haftmann@29734
|
103 |
(Locale.params_of thy loc |> map (fn (p, _, mx) => (p, mx)), loc);
|
ballarin@28795
|
104 |
fun params_inst (expr as (loc, (prfx, Positional insts))) =
|
ballarin@28697
|
105 |
let
|
ballarin@28795
|
106 |
val (ps, loc') = params_loc loc;
|
haftmann@29358
|
107 |
val d = length ps - length insts;
|
haftmann@29358
|
108 |
val insts' =
|
haftmann@29358
|
109 |
if d < 0 then error ("More arguments than parameters in instantiation of locale " ^
|
haftmann@29360
|
110 |
quote (Locale.extern thy loc))
|
haftmann@29358
|
111 |
else insts @ replicate d NONE;
|
ballarin@28697
|
112 |
val ps' = (ps ~~ insts') |>
|
ballarin@28697
|
113 |
map_filter (fn (p, NONE) => SOME p | (_, SOME _) => NONE);
|
ballarin@28885
|
114 |
in (ps', (loc', (prfx, Positional insts'))) end
|
ballarin@28795
|
115 |
| params_inst (expr as (loc, (prfx, Named insts))) =
|
ballarin@28697
|
116 |
let
|
ballarin@28697
|
117 |
val _ = reject_dups "Duplicate instantiation of the following parameter(s): "
|
ballarin@28859
|
118 |
(map fst insts);
|
ballarin@28697
|
119 |
|
ballarin@28795
|
120 |
val (ps, loc') = params_loc loc;
|
ballarin@28697
|
121 |
val ps' = fold (fn (p, _) => fn ps =>
|
ballarin@28795
|
122 |
if AList.defined match_bind ps p then AList.delete match_bind p ps
|
ballarin@28859
|
123 |
else error (quote p ^" not a parameter of instantiated expression.")) insts ps;
|
ballarin@28885
|
124 |
in (ps', (loc', (prfx, Named insts))) end;
|
ballarin@28885
|
125 |
fun params_expr is =
|
ballarin@28697
|
126 |
let
|
ballarin@28697
|
127 |
val (is', ps') = fold_map (fn i => fn ps =>
|
ballarin@28697
|
128 |
let
|
ballarin@28795
|
129 |
val (ps', i') = params_inst i;
|
ballarin@29030
|
130 |
val ps'' = distinct parm_eq (ps @ ps');
|
ballarin@28697
|
131 |
in (i', ps'') end) is []
|
ballarin@28885
|
132 |
in (ps', is') end;
|
ballarin@28697
|
133 |
|
ballarin@28895
|
134 |
val (implicit, expr') = params_expr expr;
|
ballarin@28697
|
135 |
|
haftmann@28999
|
136 |
val implicit' = map (#1 #> Binding.base_name) implicit;
|
haftmann@28999
|
137 |
val fixed' = map (#1 #> Binding.base_name) fixed;
|
ballarin@28697
|
138 |
val _ = reject_dups "Duplicate fixed parameter(s): " fixed';
|
ballarin@28895
|
139 |
val implicit'' = if strict then []
|
ballarin@28895
|
140 |
else let val _ = reject_dups
|
ballarin@28895
|
141 |
"Parameter(s) declared simultaneously in expression and for clause: " (implicit' @ fixed')
|
ballarin@28895
|
142 |
in map (fn (b, mx) => (b, NONE, mx)) implicit end;
|
ballarin@28697
|
143 |
|
ballarin@28895
|
144 |
in (expr', implicit'' @ fixed) end;
|
ballarin@28697
|
145 |
|
ballarin@28795
|
146 |
|
ballarin@28795
|
147 |
(** Read instantiation **)
|
ballarin@28795
|
148 |
|
ballarin@28872
|
149 |
(* Parse positional or named instantiation *)
|
ballarin@28872
|
150 |
|
ballarin@28859
|
151 |
local
|
ballarin@28859
|
152 |
|
haftmann@29734
|
153 |
fun prep_inst prep_term ctxt parms (Positional insts) =
|
ballarin@28872
|
154 |
(insts ~~ parms) |> map (fn
|
haftmann@29734
|
155 |
(NONE, p) => Free (p, dummyT) |
|
haftmann@29734
|
156 |
(SOME t, _) => prep_term ctxt t)
|
haftmann@29734
|
157 |
| prep_inst prep_term ctxt parms (Named insts) =
|
ballarin@28872
|
158 |
parms |> map (fn p => case AList.lookup (op =) insts p of
|
haftmann@29734
|
159 |
SOME t => prep_term ctxt t |
|
haftmann@29734
|
160 |
NONE => Free (p, dummyT));
|
ballarin@28872
|
161 |
|
ballarin@28872
|
162 |
in
|
ballarin@28872
|
163 |
|
ballarin@28872
|
164 |
fun parse_inst x = prep_inst Syntax.parse_term x;
|
ballarin@28872
|
165 |
fun make_inst x = prep_inst (K I) x;
|
ballarin@28872
|
166 |
|
ballarin@28872
|
167 |
end;
|
ballarin@28872
|
168 |
|
ballarin@28872
|
169 |
|
ballarin@28872
|
170 |
(* Instantiation morphism *)
|
ballarin@28872
|
171 |
|
ballarin@29214
|
172 |
fun inst_morph (parm_names, parm_types) ((prfx, strict), insts') ctxt =
|
ballarin@28795
|
173 |
let
|
ballarin@28795
|
174 |
(* parameters *)
|
ballarin@28795
|
175 |
val type_parm_names = fold Term.add_tfreesT parm_types [] |> map fst;
|
ballarin@28795
|
176 |
|
ballarin@28795
|
177 |
(* type inference and contexts *)
|
ballarin@28795
|
178 |
val parm_types' = map (TypeInfer.paramify_vars o Logic.varifyT) parm_types;
|
ballarin@28795
|
179 |
val type_parms = fold Term.add_tvarsT parm_types' [] |> map (Logic.mk_type o TVar);
|
ballarin@28795
|
180 |
val arg = type_parms @ map2 TypeInfer.constrain parm_types' insts';
|
ballarin@28795
|
181 |
val res = Syntax.check_terms ctxt arg;
|
ballarin@28795
|
182 |
val ctxt' = ctxt |> fold Variable.auto_fixes res;
|
ballarin@28872
|
183 |
|
ballarin@28795
|
184 |
(* instantiation *)
|
ballarin@28795
|
185 |
val (type_parms'', res') = chop (length type_parms) res;
|
ballarin@28795
|
186 |
val insts'' = (parm_names ~~ res') |> map_filter
|
ballarin@28795
|
187 |
(fn (inst as (x, Free (y, _))) => if x = y then NONE else SOME inst |
|
ballarin@28795
|
188 |
inst => SOME inst);
|
ballarin@28795
|
189 |
val instT = Symtab.make (type_parm_names ~~ map Logic.dest_type type_parms'');
|
ballarin@28795
|
190 |
val inst = Symtab.make insts'';
|
ballarin@28795
|
191 |
in
|
ballarin@28795
|
192 |
(Element.inst_morphism (ProofContext.theory_of ctxt) (instT, inst) $>
|
ballarin@29214
|
193 |
Morphism.binding_morphism (Binding.add_prefix strict prfx), ctxt')
|
ballarin@28795
|
194 |
end;
|
ballarin@28859
|
195 |
|
ballarin@28697
|
196 |
|
ballarin@28795
|
197 |
(*** Locale processing ***)
|
ballarin@28795
|
198 |
|
ballarin@28852
|
199 |
(** Parsing **)
|
ballarin@28852
|
200 |
|
wenzelm@29604
|
201 |
fun parse_elem prep_typ prep_term ctxt =
|
wenzelm@29604
|
202 |
Element.map_ctxt
|
wenzelm@29604
|
203 |
{binding = I,
|
wenzelm@29604
|
204 |
typ = prep_typ ctxt,
|
wenzelm@29604
|
205 |
term = prep_term (ProofContext.set_mode ProofContext.mode_schematic ctxt),
|
wenzelm@29604
|
206 |
pattern = prep_term (ProofContext.set_mode ProofContext.mode_pattern ctxt),
|
wenzelm@29604
|
207 |
fact = I,
|
wenzelm@29604
|
208 |
attrib = I};
|
ballarin@28852
|
209 |
|
ballarin@28852
|
210 |
fun parse_concl prep_term ctxt concl =
|
ballarin@28852
|
211 |
(map o map) (fn (t, ps) =>
|
ballarin@29215
|
212 |
(prep_term (ProofContext.set_mode ProofContext.mode_schematic ctxt) t, (* FIXME ?? *)
|
ballarin@29215
|
213 |
map (prep_term (ProofContext.set_mode ProofContext.mode_pattern ctxt)) ps)) concl;
|
ballarin@28852
|
214 |
|
ballarin@28852
|
215 |
|
ballarin@28885
|
216 |
(** Simultaneous type inference: instantiations + elements + conclusion **)
|
ballarin@28852
|
217 |
|
ballarin@28885
|
218 |
local
|
ballarin@28885
|
219 |
|
ballarin@28885
|
220 |
fun mk_type T = (Logic.mk_type T, []);
|
ballarin@28885
|
221 |
fun mk_term t = (t, []);
|
ballarin@28885
|
222 |
fun mk_propp (p, pats) = (Syntax.type_constraint propT p, pats);
|
ballarin@28885
|
223 |
|
ballarin@28885
|
224 |
fun dest_type (T, []) = Logic.dest_type T;
|
ballarin@28885
|
225 |
fun dest_term (t, []) = t;
|
ballarin@28885
|
226 |
fun dest_propp (p, pats) = (p, pats);
|
ballarin@28885
|
227 |
|
ballarin@28885
|
228 |
fun extract_inst (_, (_, ts)) = map mk_term ts;
|
ballarin@28885
|
229 |
fun restore_inst ((l, (p, _)), cs) = (l, (p, map dest_term cs));
|
ballarin@28885
|
230 |
|
ballarin@28885
|
231 |
fun extract_elem (Fixes fixes) = map (#2 #> the_list #> map mk_type) fixes
|
ballarin@28885
|
232 |
| extract_elem (Constrains csts) = map (#2 #> single #> map mk_type) csts
|
ballarin@28885
|
233 |
| extract_elem (Assumes asms) = map (#2 #> map mk_propp) asms
|
ballarin@28885
|
234 |
| extract_elem (Defines defs) = map (fn (_, (t, ps)) => [mk_propp (t, ps)]) defs
|
ballarin@28852
|
235 |
| extract_elem (Notes _) = [];
|
ballarin@28852
|
236 |
|
ballarin@28885
|
237 |
fun restore_elem (Fixes fixes, css) =
|
ballarin@28885
|
238 |
(fixes ~~ css) |> map (fn ((x, _, mx), cs) =>
|
ballarin@28885
|
239 |
(x, cs |> map dest_type |> try hd, mx)) |> Fixes
|
ballarin@28885
|
240 |
| restore_elem (Constrains csts, css) =
|
ballarin@28885
|
241 |
(csts ~~ css) |> map (fn ((x, _), cs) =>
|
ballarin@28885
|
242 |
(x, cs |> map dest_type |> hd)) |> Constrains
|
ballarin@28885
|
243 |
| restore_elem (Assumes asms, css) =
|
ballarin@28885
|
244 |
(asms ~~ css) |> map (fn ((b, _), cs) => (b, map dest_propp cs)) |> Assumes
|
ballarin@28885
|
245 |
| restore_elem (Defines defs, css) =
|
ballarin@28885
|
246 |
(defs ~~ css) |> map (fn ((b, _), [c]) => (b, dest_propp c)) |> Defines
|
ballarin@28852
|
247 |
| restore_elem (Notes notes, _) = Notes notes;
|
ballarin@28852
|
248 |
|
ballarin@28885
|
249 |
fun check cs context =
|
ballarin@28885
|
250 |
let
|
ballarin@28885
|
251 |
fun prep (_, pats) (ctxt, t :: ts) =
|
ballarin@28885
|
252 |
let val ctxt' = Variable.auto_fixes t ctxt
|
ballarin@28885
|
253 |
in
|
ballarin@28885
|
254 |
((t, Syntax.check_props (ProofContext.set_mode ProofContext.mode_pattern ctxt') pats),
|
ballarin@28885
|
255 |
(ctxt', ts))
|
ballarin@28885
|
256 |
end
|
ballarin@28885
|
257 |
val (cs', (context', _)) = fold_map prep cs
|
ballarin@28885
|
258 |
(context, Syntax.check_terms
|
ballarin@28885
|
259 |
(ProofContext.set_mode ProofContext.mode_schematic context) (map fst cs));
|
ballarin@28885
|
260 |
in (cs', context') end;
|
ballarin@28885
|
261 |
|
ballarin@28885
|
262 |
in
|
ballarin@28885
|
263 |
|
ballarin@28872
|
264 |
fun check_autofix insts elems concl ctxt =
|
ballarin@28852
|
265 |
let
|
ballarin@28885
|
266 |
val inst_cs = map extract_inst insts;
|
ballarin@28885
|
267 |
val elem_css = map extract_elem elems;
|
ballarin@28885
|
268 |
val concl_cs = (map o map) mk_propp concl;
|
ballarin@28885
|
269 |
(* Type inference *)
|
ballarin@28885
|
270 |
val (inst_cs' :: css', ctxt') =
|
ballarin@28885
|
271 |
(fold_burrow o fold_burrow) check (inst_cs :: elem_css @ [concl_cs]) ctxt;
|
ballarin@28934
|
272 |
val (elem_css', [concl_cs']) = chop (length elem_css) css';
|
ballarin@28885
|
273 |
in
|
ballarin@28934
|
274 |
(map restore_inst (insts ~~ inst_cs'), map restore_elem (elems ~~ elem_css'),
|
ballarin@28934
|
275 |
concl_cs', ctxt')
|
ballarin@28885
|
276 |
end;
|
ballarin@28885
|
277 |
|
ballarin@28885
|
278 |
end;
|
ballarin@28852
|
279 |
|
ballarin@28852
|
280 |
|
ballarin@28795
|
281 |
(** Prepare locale elements **)
|
ballarin@28795
|
282 |
|
ballarin@28795
|
283 |
fun declare_elem prep_vars (Fixes fixes) ctxt =
|
ballarin@28795
|
284 |
let val (vars, _) = prep_vars fixes ctxt
|
ballarin@28852
|
285 |
in ctxt |> ProofContext.add_fixes_i vars |> snd end
|
ballarin@28795
|
286 |
| declare_elem prep_vars (Constrains csts) ctxt =
|
haftmann@28965
|
287 |
ctxt |> prep_vars (map (fn (x, T) => (Binding.name x, SOME T, NoSyn)) csts) |> snd
|
ballarin@28872
|
288 |
| declare_elem _ (Assumes _) ctxt = ctxt
|
ballarin@28872
|
289 |
| declare_elem _ (Defines _) ctxt = ctxt
|
ballarin@28852
|
290 |
| declare_elem _ (Notes _) ctxt = ctxt;
|
ballarin@28795
|
291 |
|
ballarin@29221
|
292 |
(** Finish locale elements **)
|
ballarin@28795
|
293 |
|
ballarin@28852
|
294 |
fun closeup _ _ false elem = elem
|
ballarin@28852
|
295 |
| closeup ctxt parms true elem =
|
ballarin@28795
|
296 |
let
|
ballarin@28795
|
297 |
fun close_frees t =
|
ballarin@28795
|
298 |
let
|
ballarin@28795
|
299 |
val rev_frees =
|
ballarin@28795
|
300 |
Term.fold_aterms (fn Free (x, T) =>
|
ballarin@28852
|
301 |
if AList.defined (op =) parms x then I else insert (op =) (x, T) | _ => I) t [];
|
ballarin@29021
|
302 |
in Term.list_all_free (rev rev_frees, t) end; (* FIXME use fold Logic.all *)
|
ballarin@29019
|
303 |
(* FIXME consider closing in syntactic phase *)
|
ballarin@28795
|
304 |
|
ballarin@28795
|
305 |
fun no_binds [] = []
|
ballarin@28852
|
306 |
| no_binds _ = error "Illegal term bindings in context element";
|
ballarin@28795
|
307 |
in
|
ballarin@28795
|
308 |
(case elem of
|
ballarin@28795
|
309 |
Assumes asms => Assumes (asms |> map (fn (a, propps) =>
|
ballarin@28795
|
310 |
(a, map (fn (t, ps) => (close_frees t, no_binds ps)) propps)))
|
ballarin@29022
|
311 |
| Defines defs => Defines (defs |> map (fn ((name, atts), (t, ps)) =>
|
ballarin@29022
|
312 |
let val ((c, _), t') = LocalDefs.cert_def ctxt (close_frees t)
|
ballarin@29022
|
313 |
in
|
ballarin@29022
|
314 |
((Binding.map_base (Thm.def_name_optional c) name, atts), (t', no_binds ps))
|
ballarin@29022
|
315 |
end))
|
ballarin@28795
|
316 |
| e => e)
|
ballarin@28795
|
317 |
end;
|
ballarin@28795
|
318 |
|
ballarin@28872
|
319 |
fun finish_primitive parms _ (Fixes fixes) = Fixes (map (fn (binding, _, mx) =>
|
haftmann@28999
|
320 |
let val x = Binding.base_name binding
|
ballarin@28795
|
321 |
in (binding, AList.lookup (op =) parms x, mx) end) fixes)
|
ballarin@28872
|
322 |
| finish_primitive _ _ (Constrains _) = Constrains []
|
ballarin@28872
|
323 |
| finish_primitive _ close (Assumes asms) = close (Assumes asms)
|
ballarin@28872
|
324 |
| finish_primitive _ close (Defines defs) = close (Defines defs)
|
ballarin@28872
|
325 |
| finish_primitive _ _ (Notes facts) = Notes facts;
|
ballarin@28872
|
326 |
|
ballarin@29221
|
327 |
fun finish_inst ctxt parms do_close (loc, (prfx, inst)) =
|
ballarin@28872
|
328 |
let
|
ballarin@28872
|
329 |
val thy = ProofContext.theory_of ctxt;
|
haftmann@29360
|
330 |
val (parm_names, parm_types) = Locale.params_of thy loc |>
|
haftmann@29510
|
331 |
map_split (fn (b, SOME T, _) => (Binding.base_name b, T));
|
ballarin@28872
|
332 |
val (morph, _) = inst_morph (parm_names, parm_types) (prfx, inst) ctxt;
|
ballarin@29221
|
333 |
in (loc, morph) end;
|
ballarin@28795
|
334 |
|
ballarin@29221
|
335 |
fun finish_elem ctxt parms do_close elem =
|
ballarin@28795
|
336 |
let
|
ballarin@28872
|
337 |
val elem' = finish_primitive parms (closeup ctxt parms do_close) elem;
|
ballarin@29221
|
338 |
in elem' end
|
ballarin@28795
|
339 |
|
ballarin@29221
|
340 |
fun finish ctxt parms do_close insts elems =
|
ballarin@28872
|
341 |
let
|
ballarin@29221
|
342 |
val deps = map (finish_inst ctxt parms do_close) insts;
|
ballarin@29221
|
343 |
val elems' = map (finish_elem ctxt parms do_close) elems;
|
ballarin@29221
|
344 |
in (deps, elems') end;
|
ballarin@28795
|
345 |
|
ballarin@28795
|
346 |
|
ballarin@28895
|
347 |
(** Process full context statement: instantiations + elements + conclusion **)
|
ballarin@28895
|
348 |
|
ballarin@28895
|
349 |
(* Interleave incremental parsing and type inference over entire parsed stretch. *)
|
ballarin@28895
|
350 |
|
ballarin@28795
|
351 |
local
|
ballarin@28795
|
352 |
|
haftmann@29734
|
353 |
fun prep_full_context_statement parse_typ parse_prop prep_vars_elem prep_inst prep_vars_inst prep_expr
|
haftmann@29702
|
354 |
strict do_close raw_import init_body raw_elems raw_concl ctxt1 =
|
ballarin@28795
|
355 |
let
|
haftmann@29358
|
356 |
val thy = ProofContext.theory_of ctxt1;
|
ballarin@28872
|
357 |
|
ballarin@28895
|
358 |
val (raw_insts, fixed) = parameters_of thy strict (apfst (prep_expr thy) raw_import);
|
ballarin@28895
|
359 |
|
haftmann@29734
|
360 |
fun prep_insts (loc, (prfx, inst)) (i, insts, ctxt) =
|
ballarin@28872
|
361 |
let
|
haftmann@29360
|
362 |
val (parm_names, parm_types) = Locale.params_of thy loc |>
|
haftmann@29510
|
363 |
map_split (fn (b, SOME T, _) => (Binding.base_name b, T))
|
haftmann@29510
|
364 |
(*FIXME return value of Locale.params_of has strange type*)
|
haftmann@29734
|
365 |
val inst' = prep_inst ctxt parm_names inst;
|
ballarin@28885
|
366 |
val parm_types' = map (TypeInfer.paramify_vars o
|
ballarin@28885
|
367 |
Term.map_type_tvar (fn ((x, _), S) => TVar ((x, i), S)) o Logic.varifyT) parm_types;
|
ballarin@28872
|
368 |
val inst'' = map2 TypeInfer.constrain parm_types' inst';
|
ballarin@28872
|
369 |
val insts' = insts @ [(loc, (prfx, inst''))];
|
ballarin@28951
|
370 |
val (insts'', _, _, ctxt' (* FIXME not used *) ) = check_autofix insts' [] [] ctxt;
|
ballarin@28872
|
371 |
val inst''' = insts'' |> List.last |> snd |> snd;
|
ballarin@28872
|
372 |
val (morph, _) = inst_morph (parm_names, parm_types) (prfx, inst''') ctxt;
|
haftmann@29360
|
373 |
val ctxt'' = Locale.activate_declarations thy (loc, morph) ctxt;
|
ballarin@28951
|
374 |
in (i+1, insts', ctxt'') end;
|
ballarin@28872
|
375 |
|
haftmann@29501
|
376 |
fun prep_elem insts raw_elem (elems, ctxt) =
|
ballarin@28852
|
377 |
let
|
haftmann@29501
|
378 |
val ctxt' = declare_elem prep_vars_elem raw_elem ctxt;
|
ballarin@28852
|
379 |
val elems' = elems @ [parse_elem parse_typ parse_prop ctxt' raw_elem];
|
ballarin@28872
|
380 |
val (_, _, _, ctxt'') = check_autofix insts elems' [] ctxt';
|
haftmann@29501
|
381 |
in (elems', ctxt') end;
|
ballarin@28795
|
382 |
|
ballarin@28872
|
383 |
fun prep_concl raw_concl (insts, elems, ctxt) =
|
ballarin@28852
|
384 |
let
|
ballarin@29215
|
385 |
val concl = parse_concl parse_prop ctxt raw_concl;
|
ballarin@28872
|
386 |
in check_autofix insts elems concl ctxt end;
|
ballarin@28795
|
387 |
|
haftmann@29501
|
388 |
val fors = prep_vars_inst fixed ctxt1 |> fst;
|
haftmann@29358
|
389 |
val ctxt2 = ctxt1 |> ProofContext.add_fixes_i fors |> snd;
|
haftmann@29734
|
390 |
val (_, insts', ctxt3) = fold prep_insts raw_insts (0, [], ctxt2);
|
haftmann@29702
|
391 |
val ctxt4 = init_body ctxt3;
|
haftmann@29702
|
392 |
val (elems, ctxt5) = fold (prep_elem insts') raw_elems ([], ctxt4);
|
haftmann@29702
|
393 |
val (insts, elems', concl, ctxt6) =
|
haftmann@29702
|
394 |
prep_concl raw_concl (insts', elems, ctxt5);
|
ballarin@28795
|
395 |
|
ballarin@28872
|
396 |
(* Retrieve parameter types *)
|
haftmann@29501
|
397 |
val xs = fold (fn Fixes fixes => (fn ps => ps @ map (Binding.base_name o #1) fixes)
|
haftmann@29501
|
398 |
| _ => fn ps => ps) (Fixes fors :: elems') [];
|
haftmann@29702
|
399 |
val (Ts, ctxt7) = fold_map ProofContext.inferred_param xs ctxt6;
|
ballarin@28895
|
400 |
val parms = xs ~~ Ts; (* params from expression and elements *)
|
ballarin@28795
|
401 |
|
ballarin@28872
|
402 |
val Fixes fors' = finish_primitive parms I (Fixes fors);
|
haftmann@29501
|
403 |
val (deps, elems'') = finish ctxt6 parms do_close insts elems';
|
ballarin@28852
|
404 |
|
haftmann@29702
|
405 |
in ((fors', deps, elems'', concl), (parms, ctxt7)) end
|
ballarin@28795
|
406 |
|
ballarin@28795
|
407 |
in
|
ballarin@28795
|
408 |
|
haftmann@29501
|
409 |
fun cert_full_context_statement x =
|
haftmann@29501
|
410 |
prep_full_context_statement (K I) (K I) ProofContext.cert_vars
|
haftmann@29501
|
411 |
make_inst ProofContext.cert_vars (K I) x;
|
haftmann@29501
|
412 |
fun cert_read_full_context_statement x =
|
haftmann@29501
|
413 |
prep_full_context_statement Syntax.parse_typ Syntax.parse_prop ProofContext.read_vars
|
haftmann@29501
|
414 |
make_inst ProofContext.cert_vars (K I) x;
|
ballarin@28895
|
415 |
fun read_full_context_statement x =
|
haftmann@29501
|
416 |
prep_full_context_statement Syntax.parse_typ Syntax.parse_prop ProofContext.read_vars
|
haftmann@29501
|
417 |
parse_inst ProofContext.read_vars intern x;
|
ballarin@28795
|
418 |
|
ballarin@28795
|
419 |
end;
|
ballarin@28795
|
420 |
|
ballarin@28795
|
421 |
|
ballarin@28898
|
422 |
(* Context statement: elements + conclusion *)
|
ballarin@28795
|
423 |
|
ballarin@28795
|
424 |
local
|
ballarin@28795
|
425 |
|
ballarin@28898
|
426 |
fun prep_statement prep activate raw_elems raw_concl context =
|
ballarin@28898
|
427 |
let
|
haftmann@29358
|
428 |
val ((_, _, elems, concl), _) =
|
haftmann@29702
|
429 |
prep true false ([], []) I raw_elems raw_concl context;
|
haftmann@29501
|
430 |
val (_, context') = context |>
|
haftmann@29501
|
431 |
ProofContext.set_stmt true |>
|
haftmann@29501
|
432 |
activate elems;
|
ballarin@28898
|
433 |
in (concl, context') end;
|
ballarin@28898
|
434 |
|
ballarin@28898
|
435 |
in
|
ballarin@28898
|
436 |
|
haftmann@29501
|
437 |
fun cert_statement x = prep_statement cert_full_context_statement Element.activate_i x;
|
ballarin@28898
|
438 |
fun read_statement x = prep_statement read_full_context_statement Element.activate x;
|
ballarin@28898
|
439 |
|
ballarin@28898
|
440 |
end;
|
ballarin@28898
|
441 |
|
ballarin@28898
|
442 |
|
ballarin@28898
|
443 |
(* Locale declaration: import + elements *)
|
ballarin@28898
|
444 |
|
ballarin@28898
|
445 |
local
|
ballarin@28898
|
446 |
|
haftmann@29702
|
447 |
fun prep_declaration prep activate raw_import init_body raw_elems context =
|
ballarin@28795
|
448 |
let
|
haftmann@29358
|
449 |
val ((fixed, deps, elems, _), (parms, ctxt')) =
|
haftmann@29702
|
450 |
prep false true raw_import init_body raw_elems [] context ;
|
ballarin@28898
|
451 |
(* Declare parameters and imported facts *)
|
ballarin@28898
|
452 |
val context' = context |>
|
ballarin@28898
|
453 |
ProofContext.add_fixes_i fixed |> snd |>
|
haftmann@29360
|
454 |
fold Locale.activate_local_facts deps;
|
haftmann@29501
|
455 |
val (elems', _) = context' |>
|
haftmann@29501
|
456 |
ProofContext.set_stmt true |>
|
haftmann@29501
|
457 |
activate elems;
|
ballarin@29221
|
458 |
in ((fixed, deps, elems'), (parms, ctxt')) end;
|
ballarin@28795
|
459 |
|
ballarin@28795
|
460 |
in
|
ballarin@28795
|
461 |
|
haftmann@29501
|
462 |
fun cert_declaration x = prep_declaration cert_full_context_statement Element.activate_i x;
|
haftmann@29501
|
463 |
fun cert_read_declaration x = prep_declaration cert_read_full_context_statement Element.activate x;
|
ballarin@28898
|
464 |
fun read_declaration x = prep_declaration read_full_context_statement Element.activate x;
|
ballarin@28879
|
465 |
|
ballarin@28898
|
466 |
end;
|
ballarin@28898
|
467 |
|
ballarin@28898
|
468 |
|
ballarin@28898
|
469 |
(* Locale expression to set up a goal *)
|
ballarin@28898
|
470 |
|
ballarin@28898
|
471 |
local
|
ballarin@28898
|
472 |
|
ballarin@28898
|
473 |
fun props_of thy (name, morph) =
|
ballarin@28898
|
474 |
let
|
haftmann@29360
|
475 |
val (asm, defs) = Locale.specification_of thy name;
|
ballarin@28898
|
476 |
in
|
ballarin@28898
|
477 |
(case asm of NONE => defs | SOME asm => asm :: defs) |> map (Morphism.term morph)
|
ballarin@28898
|
478 |
end;
|
ballarin@28898
|
479 |
|
ballarin@28898
|
480 |
fun prep_goal_expression prep expression context =
|
ballarin@28898
|
481 |
let
|
ballarin@28898
|
482 |
val thy = ProofContext.theory_of context;
|
ballarin@28898
|
483 |
|
haftmann@29358
|
484 |
val ((fixed, deps, _, _), _) =
|
haftmann@29702
|
485 |
prep true true expression I [] [] context;
|
ballarin@28898
|
486 |
(* proof obligations *)
|
ballarin@28898
|
487 |
val propss = map (props_of thy) deps;
|
ballarin@28898
|
488 |
|
ballarin@28898
|
489 |
val goal_ctxt = context |>
|
ballarin@28898
|
490 |
ProofContext.add_fixes_i fixed |> snd |>
|
ballarin@28898
|
491 |
(fold o fold) Variable.auto_fixes propss;
|
ballarin@28898
|
492 |
|
ballarin@28898
|
493 |
val export = Variable.export_morphism goal_ctxt context;
|
ballarin@28898
|
494 |
val exp_fact = Drule.zero_var_indexes_list o map Thm.strip_shyps o Morphism.fact export;
|
ballarin@29245
|
495 |
val exp_term = TermSubst.zero_var_indexes o Morphism.term export;
|
ballarin@28898
|
496 |
val exp_typ = Logic.type_map exp_term;
|
wenzelm@29604
|
497 |
val export' = Morphism.morphism {binding = I, typ = exp_typ, term = exp_term, fact = exp_fact};
|
ballarin@28898
|
498 |
in ((propss, deps, export'), goal_ctxt) end;
|
ballarin@28898
|
499 |
|
ballarin@28898
|
500 |
in
|
ballarin@28898
|
501 |
|
haftmann@29501
|
502 |
fun cert_goal_expression x = prep_goal_expression cert_full_context_statement x;
|
ballarin@28898
|
503 |
fun read_goal_expression x = prep_goal_expression read_full_context_statement x;
|
ballarin@28879
|
504 |
|
ballarin@28795
|
505 |
end;
|
ballarin@28795
|
506 |
|
ballarin@28795
|
507 |
|
ballarin@28795
|
508 |
(*** Locale declarations ***)
|
ballarin@28795
|
509 |
|
ballarin@29221
|
510 |
(* extract specification text *)
|
ballarin@29221
|
511 |
|
ballarin@29221
|
512 |
val norm_term = Envir.beta_norm oo Term.subst_atomic;
|
ballarin@29221
|
513 |
|
ballarin@29221
|
514 |
fun bind_def ctxt eq (xs, env, eqs) =
|
ballarin@29221
|
515 |
let
|
ballarin@29221
|
516 |
val _ = LocalDefs.cert_def ctxt eq;
|
ballarin@29221
|
517 |
val ((y, T), b) = LocalDefs.abs_def eq;
|
ballarin@29221
|
518 |
val b' = norm_term env b;
|
ballarin@29221
|
519 |
fun err msg = error (msg ^ ": " ^ quote y);
|
ballarin@29221
|
520 |
in
|
ballarin@29250
|
521 |
case filter (fn (Free (y', _), _) => y = y' | _ => false) env of
|
ballarin@29250
|
522 |
[] => (Term.add_frees b' xs, (Free (y, T), b') :: env, eq :: eqs) |
|
ballarin@29250
|
523 |
dups => if forall (fn (_, b'') => b' aconv b'') dups
|
ballarin@29250
|
524 |
then (xs, env, eqs)
|
ballarin@29250
|
525 |
else err "Attempt to redefine variable"
|
ballarin@29221
|
526 |
end;
|
ballarin@29221
|
527 |
|
ballarin@29221
|
528 |
(* text has the following structure:
|
ballarin@29221
|
529 |
(((exts, exts'), (ints, ints')), (xs, env, defs))
|
ballarin@29221
|
530 |
where
|
ballarin@29221
|
531 |
exts: external assumptions (terms in assumes elements)
|
ballarin@29221
|
532 |
exts': dito, normalised wrt. env
|
ballarin@29221
|
533 |
ints: internal assumptions (terms in assumptions from insts)
|
ballarin@29221
|
534 |
ints': dito, normalised wrt. env
|
ballarin@29221
|
535 |
xs: the free variables in exts' and ints' and rhss of definitions,
|
ballarin@29221
|
536 |
this includes parameters except defined parameters
|
ballarin@29221
|
537 |
env: list of term pairs encoding substitutions, where the first term
|
ballarin@29221
|
538 |
is a free variable; substitutions represent defines elements and
|
ballarin@29221
|
539 |
the rhs is normalised wrt. the previous env
|
ballarin@29221
|
540 |
defs: the equations from the defines elements
|
ballarin@29221
|
541 |
*)
|
ballarin@29221
|
542 |
|
ballarin@29221
|
543 |
fun eval_text _ _ (Fixes _) text = text
|
ballarin@29221
|
544 |
| eval_text _ _ (Constrains _) text = text
|
ballarin@29221
|
545 |
| eval_text _ is_ext (Assumes asms)
|
ballarin@29221
|
546 |
(((exts, exts'), (ints, ints')), (xs, env, defs)) =
|
ballarin@29221
|
547 |
let
|
ballarin@29221
|
548 |
val ts = maps (map #1 o #2) asms;
|
ballarin@29221
|
549 |
val ts' = map (norm_term env) ts;
|
ballarin@29221
|
550 |
val spec' =
|
ballarin@29221
|
551 |
if is_ext then ((exts @ ts, exts' @ ts'), (ints, ints'))
|
ballarin@29221
|
552 |
else ((exts, exts'), (ints @ ts, ints' @ ts'));
|
ballarin@29221
|
553 |
in (spec', (fold Term.add_frees ts' xs, env, defs)) end
|
ballarin@29221
|
554 |
| eval_text ctxt _ (Defines defs) (spec, binds) =
|
ballarin@29221
|
555 |
(spec, fold (bind_def ctxt o #1 o #2) defs binds)
|
ballarin@29221
|
556 |
| eval_text _ _ (Notes _) text = text;
|
ballarin@29221
|
557 |
|
ballarin@29221
|
558 |
fun eval_inst ctxt (loc, morph) text =
|
ballarin@29221
|
559 |
let
|
ballarin@29221
|
560 |
val thy = ProofContext.theory_of ctxt;
|
haftmann@29360
|
561 |
val (asm, defs) = Locale.specification_of thy loc;
|
ballarin@29221
|
562 |
val asm' = Option.map (Morphism.term morph) asm;
|
ballarin@29221
|
563 |
val defs' = map (Morphism.term morph) defs;
|
ballarin@29221
|
564 |
val text' = text |>
|
ballarin@29221
|
565 |
(if is_some asm
|
ballarin@29221
|
566 |
then eval_text ctxt false (Assumes [(Attrib.empty_binding, [(the asm', [])])])
|
ballarin@29221
|
567 |
else I) |>
|
ballarin@29221
|
568 |
(if not (null defs)
|
ballarin@29221
|
569 |
then eval_text ctxt false (Defines (map (fn def => (Attrib.empty_binding, (def, []))) defs'))
|
ballarin@29221
|
570 |
else I)
|
haftmann@29360
|
571 |
(* FIXME clone from locale.ML *)
|
ballarin@29221
|
572 |
in text' end;
|
ballarin@29221
|
573 |
|
ballarin@29221
|
574 |
fun eval_elem ctxt elem text =
|
ballarin@29221
|
575 |
let
|
ballarin@29221
|
576 |
val text' = eval_text ctxt true elem text;
|
ballarin@29221
|
577 |
in text' end;
|
ballarin@29221
|
578 |
|
ballarin@29221
|
579 |
fun eval ctxt deps elems =
|
ballarin@29221
|
580 |
let
|
ballarin@29221
|
581 |
val text' = fold (eval_inst ctxt) deps ((([], []), ([], [])), ([], [], []));
|
ballarin@29221
|
582 |
val ((spec, (_, _, defs))) = fold (eval_elem ctxt) elems text';
|
ballarin@29221
|
583 |
in (spec, defs) end;
|
ballarin@29221
|
584 |
|
ballarin@28903
|
585 |
(* axiomsN: name of theorem set with destruct rules for locale predicates,
|
ballarin@28903
|
586 |
also name suffix of delta predicates and assumptions. *)
|
ballarin@28903
|
587 |
|
ballarin@28903
|
588 |
val axiomsN = "axioms";
|
ballarin@28903
|
589 |
|
ballarin@28795
|
590 |
local
|
ballarin@28795
|
591 |
|
ballarin@28795
|
592 |
(* introN: name of theorems for introduction rules of locale and
|
ballarin@28903
|
593 |
delta predicates *)
|
ballarin@28795
|
594 |
|
ballarin@28795
|
595 |
val introN = "intro";
|
ballarin@28795
|
596 |
|
ballarin@28795
|
597 |
fun atomize_spec thy ts =
|
ballarin@28795
|
598 |
let
|
ballarin@28795
|
599 |
val t = Logic.mk_conjunction_balanced ts;
|
ballarin@28795
|
600 |
val body = ObjectLogic.atomize_term thy t;
|
ballarin@28795
|
601 |
val bodyT = Term.fastype_of body;
|
ballarin@28795
|
602 |
in
|
ballarin@28795
|
603 |
if bodyT = propT then (t, propT, Thm.reflexive (Thm.cterm_of thy t))
|
ballarin@28795
|
604 |
else (body, bodyT, ObjectLogic.atomize (Thm.cterm_of thy t))
|
ballarin@28795
|
605 |
end;
|
ballarin@28795
|
606 |
|
ballarin@28795
|
607 |
(* achieve plain syntax for locale predicates (without "PROP") *)
|
ballarin@28795
|
608 |
|
ballarin@28795
|
609 |
fun aprop_tr' n c = (Syntax.constN ^ c, fn ctxt => fn args =>
|
ballarin@28795
|
610 |
if length args = n then
|
ballarin@28795
|
611 |
Syntax.const "_aprop" $
|
ballarin@28795
|
612 |
Term.list_comb (Syntax.free (Consts.extern (ProofContext.consts_of ctxt) c), args)
|
ballarin@28795
|
613 |
else raise Match);
|
ballarin@28795
|
614 |
|
ballarin@28898
|
615 |
(* define one predicate including its intro rule and axioms
|
ballarin@28795
|
616 |
- bname: predicate name
|
ballarin@28795
|
617 |
- parms: locale parameters
|
ballarin@28795
|
618 |
- defs: thms representing substitutions from defines elements
|
ballarin@28795
|
619 |
- ts: terms representing locale assumptions (not normalised wrt. defs)
|
ballarin@28795
|
620 |
- norm_ts: terms representing locale assumptions (normalised wrt. defs)
|
ballarin@28795
|
621 |
- thy: the theory
|
ballarin@28795
|
622 |
*)
|
ballarin@28795
|
623 |
|
ballarin@28795
|
624 |
fun def_pred bname parms defs ts norm_ts thy =
|
ballarin@28795
|
625 |
let
|
haftmann@28965
|
626 |
val name = Sign.full_bname thy bname;
|
ballarin@28795
|
627 |
|
ballarin@28795
|
628 |
val (body, bodyT, body_eq) = atomize_spec thy norm_ts;
|
wenzelm@29272
|
629 |
val env = Term.add_free_names body [];
|
ballarin@28795
|
630 |
val xs = filter (member (op =) env o #1) parms;
|
ballarin@28795
|
631 |
val Ts = map #2 xs;
|
wenzelm@29272
|
632 |
val extraTs =
|
wenzelm@29272
|
633 |
(Term.add_tfrees body [] \\ fold Term.add_tfreesT Ts [])
|
ballarin@28795
|
634 |
|> Library.sort_wrt #1 |> map TFree;
|
ballarin@28795
|
635 |
val predT = map Term.itselfT extraTs ---> Ts ---> bodyT;
|
ballarin@28795
|
636 |
|
ballarin@28795
|
637 |
val args = map Logic.mk_type extraTs @ map Free xs;
|
ballarin@28795
|
638 |
val head = Term.list_comb (Const (name, predT), args);
|
ballarin@28795
|
639 |
val statement = ObjectLogic.ensure_propT thy head;
|
ballarin@28795
|
640 |
|
ballarin@28795
|
641 |
val ([pred_def], defs_thy) =
|
ballarin@28795
|
642 |
thy
|
ballarin@28795
|
643 |
|> bodyT = propT ? Sign.add_advanced_trfuns ([], [], [aprop_tr' (length args) name], [])
|
haftmann@28965
|
644 |
|> Sign.declare_const [] ((Binding.name bname, predT), NoSyn) |> snd
|
ballarin@28795
|
645 |
|> PureThy.add_defs false
|
haftmann@29578
|
646 |
[((Binding.name (Thm.def_name bname), Logic.mk_equals (head, body)), [Thm.kind_internal])];
|
ballarin@28795
|
647 |
val defs_ctxt = ProofContext.init defs_thy |> Variable.declare_term head;
|
ballarin@28795
|
648 |
|
ballarin@28795
|
649 |
val cert = Thm.cterm_of defs_thy;
|
ballarin@28795
|
650 |
|
ballarin@28795
|
651 |
val intro = Goal.prove_global defs_thy [] norm_ts statement (fn _ =>
|
ballarin@28795
|
652 |
MetaSimplifier.rewrite_goals_tac [pred_def] THEN
|
ballarin@28795
|
653 |
Tactic.compose_tac (false, body_eq RS Drule.equal_elim_rule1, 1) 1 THEN
|
ballarin@28795
|
654 |
Tactic.compose_tac (false,
|
ballarin@28795
|
655 |
Conjunction.intr_balanced (map (Thm.assume o cert) norm_ts), 0) 1);
|
ballarin@28795
|
656 |
|
ballarin@28795
|
657 |
val conjuncts =
|
ballarin@28795
|
658 |
(Drule.equal_elim_rule2 OF [body_eq,
|
ballarin@28795
|
659 |
MetaSimplifier.rewrite_rule [pred_def] (Thm.assume (cert statement))])
|
ballarin@28795
|
660 |
|> Conjunction.elim_balanced (length ts);
|
ballarin@28795
|
661 |
val axioms = ts ~~ conjuncts |> map (fn (t, ax) =>
|
ballarin@28795
|
662 |
Element.prove_witness defs_ctxt t
|
ballarin@28795
|
663 |
(MetaSimplifier.rewrite_goals_tac defs THEN
|
ballarin@28795
|
664 |
Tactic.compose_tac (false, ax, 0) 1));
|
ballarin@28795
|
665 |
in ((statement, intro, axioms), defs_thy) end;
|
ballarin@28795
|
666 |
|
ballarin@28795
|
667 |
in
|
ballarin@28795
|
668 |
|
ballarin@28795
|
669 |
(* CB: main predicate definition function *)
|
ballarin@28795
|
670 |
|
ballarin@29221
|
671 |
fun define_preds pname parms (((exts, exts'), (ints, ints')), defs) thy =
|
ballarin@28795
|
672 |
let
|
ballarin@29031
|
673 |
val defs' = map (cterm_of thy #> Assumption.assume #> Drule.gen_all #> Drule.abs_def) defs;
|
ballarin@29031
|
674 |
|
ballarin@28795
|
675 |
val (a_pred, a_intro, a_axioms, thy'') =
|
ballarin@28795
|
676 |
if null exts then (NONE, NONE, [], thy)
|
ballarin@28795
|
677 |
else
|
ballarin@28795
|
678 |
let
|
ballarin@28795
|
679 |
val aname = if null ints then pname else pname ^ "_" ^ axiomsN;
|
ballarin@28795
|
680 |
val ((statement, intro, axioms), thy') =
|
ballarin@28795
|
681 |
thy
|
ballarin@29031
|
682 |
|> def_pred aname parms defs' exts exts';
|
ballarin@28795
|
683 |
val (_, thy'') =
|
ballarin@28795
|
684 |
thy'
|
ballarin@28795
|
685 |
|> Sign.add_path aname
|
ballarin@28795
|
686 |
|> Sign.no_base_names
|
ballarin@28903
|
687 |
|> PureThy.note_thmss Thm.internalK
|
haftmann@29360
|
688 |
[((Binding.name introN, []), [([intro], [Locale.unfold_attrib])])]
|
ballarin@28795
|
689 |
||> Sign.restore_naming thy';
|
ballarin@28795
|
690 |
in (SOME statement, SOME intro, axioms, thy'') end;
|
ballarin@28795
|
691 |
val (b_pred, b_intro, b_axioms, thy'''') =
|
ballarin@28795
|
692 |
if null ints then (NONE, NONE, [], thy'')
|
ballarin@28795
|
693 |
else
|
ballarin@28795
|
694 |
let
|
ballarin@28795
|
695 |
val ((statement, intro, axioms), thy''') =
|
ballarin@28795
|
696 |
thy''
|
ballarin@29031
|
697 |
|> def_pred pname parms defs' (ints @ the_list a_pred) (ints' @ the_list a_pred);
|
ballarin@28795
|
698 |
val (_, thy'''') =
|
ballarin@28795
|
699 |
thy'''
|
ballarin@28795
|
700 |
|> Sign.add_path pname
|
ballarin@28795
|
701 |
|> Sign.no_base_names
|
ballarin@28795
|
702 |
|> PureThy.note_thmss Thm.internalK
|
haftmann@29360
|
703 |
[((Binding.name introN, []), [([intro], [Locale.intro_attrib])]),
|
haftmann@28965
|
704 |
((Binding.name axiomsN, []),
|
ballarin@28795
|
705 |
[(map (Drule.standard o Element.conclude_witness) axioms, [])])]
|
ballarin@28795
|
706 |
||> Sign.restore_naming thy''';
|
ballarin@28795
|
707 |
in (SOME statement, SOME intro, axioms, thy'''') end;
|
ballarin@28795
|
708 |
in ((a_pred, a_intro, a_axioms), (b_pred, b_intro, b_axioms), thy'''') end;
|
ballarin@28795
|
709 |
|
ballarin@28795
|
710 |
end;
|
ballarin@28795
|
711 |
|
ballarin@28795
|
712 |
|
ballarin@28795
|
713 |
local
|
ballarin@28795
|
714 |
|
ballarin@28795
|
715 |
fun assumes_to_notes (Assumes asms) axms =
|
ballarin@28795
|
716 |
fold_map (fn (a, spec) => fn axs =>
|
ballarin@28795
|
717 |
let val (ps, qs) = chop (length spec) axs
|
ballarin@28795
|
718 |
in ((a, [(ps, [])]), qs) end) asms axms
|
ballarin@28795
|
719 |
|> apfst (curry Notes Thm.assumptionK)
|
ballarin@28795
|
720 |
| assumes_to_notes e axms = (e, axms);
|
ballarin@28795
|
721 |
|
ballarin@29031
|
722 |
fun defines_to_notes thy (Defines defs) =
|
ballarin@29031
|
723 |
Notes (Thm.definitionK, map (fn (a, (def, _)) =>
|
ballarin@29245
|
724 |
(a, [([Assumption.assume (cterm_of thy def)],
|
haftmann@29360
|
725 |
[(Attrib.internal o K) Locale.witness_attrib])])) defs)
|
ballarin@29031
|
726 |
| defines_to_notes _ e = e;
|
ballarin@28795
|
727 |
|
ballarin@28898
|
728 |
fun gen_add_locale prep_decl
|
wenzelm@30189
|
729 |
bname raw_predicate_bname raw_import raw_body thy =
|
ballarin@28795
|
730 |
let
|
haftmann@28965
|
731 |
val name = Sign.full_bname thy bname;
|
haftmann@29389
|
732 |
val _ = Locale.defined thy name andalso
|
ballarin@28795
|
733 |
error ("Duplicate definition of locale " ^ quote name);
|
ballarin@28795
|
734 |
|
ballarin@29221
|
735 |
val ((fixed, deps, body_elems), (parms, ctxt')) =
|
wenzelm@30189
|
736 |
prep_decl raw_import I raw_body (ProofContext.init thy);
|
ballarin@29221
|
737 |
val text as (((_, exts'), _), defs) = eval ctxt' deps body_elems;
|
ballarin@29221
|
738 |
|
haftmann@29389
|
739 |
val predicate_bname = if raw_predicate_bname = "" then bname
|
haftmann@29389
|
740 |
else raw_predicate_bname;
|
ballarin@28872
|
741 |
val ((a_statement, a_intro, a_axioms), (b_statement, b_intro, b_axioms), thy') =
|
haftmann@29389
|
742 |
define_preds predicate_bname parms text thy;
|
ballarin@28795
|
743 |
|
ballarin@28795
|
744 |
val extraTs = fold Term.add_tfrees exts' [] \\ fold Term.add_tfreesT (map snd parms) [];
|
ballarin@28795
|
745 |
val _ = if null extraTs then ()
|
ballarin@28795
|
746 |
else warning ("Additional type variable(s) in locale specification " ^ quote bname);
|
ballarin@28795
|
747 |
|
ballarin@29035
|
748 |
val a_satisfy = Element.satisfy_morphism a_axioms;
|
ballarin@29035
|
749 |
val b_satisfy = Element.satisfy_morphism b_axioms;
|
ballarin@28903
|
750 |
|
ballarin@28895
|
751 |
val params = fixed @
|
ballarin@28872
|
752 |
(body_elems |> map_filter (fn Fixes fixes => SOME fixes | _ => NONE) |> flat);
|
ballarin@28903
|
753 |
val asm = if is_some b_statement then b_statement else a_statement;
|
ballarin@29028
|
754 |
|
ballarin@29028
|
755 |
val notes =
|
ballarin@29028
|
756 |
if is_some asm
|
ballarin@29028
|
757 |
then [(Thm.internalK, [((Binding.name (bname ^ "_" ^ axiomsN), []),
|
ballarin@29028
|
758 |
[([Assumption.assume (cterm_of thy' (the asm))],
|
haftmann@29360
|
759 |
[(Attrib.internal o K) Locale.witness_attrib])])])]
|
ballarin@29028
|
760 |
else [];
|
ballarin@28795
|
761 |
|
ballarin@29035
|
762 |
val notes' = body_elems |>
|
ballarin@29035
|
763 |
map (defines_to_notes thy') |>
|
ballarin@29035
|
764 |
map (Element.morph_ctxt a_satisfy) |>
|
ballarin@29035
|
765 |
(fn elems => fold_map assumes_to_notes elems (map Element.conclude_witness a_axioms)) |>
|
ballarin@29035
|
766 |
fst |>
|
ballarin@29035
|
767 |
map (Element.morph_ctxt b_satisfy) |>
|
ballarin@29035
|
768 |
map_filter (fn Notes notes => SOME notes | _ => NONE);
|
ballarin@29035
|
769 |
|
ballarin@29035
|
770 |
val deps' = map (fn (l, morph) => (l, morph $> b_satisfy)) deps;
|
haftmann@29439
|
771 |
val axioms = map Element.conclude_witness b_axioms;
|
ballarin@28872
|
772 |
|
haftmann@29358
|
773 |
val loc_ctxt = thy'
|
haftmann@29360
|
774 |
|> Locale.register_locale bname (extraTs, params)
|
haftmann@29439
|
775 |
(asm, rev defs) (a_intro, b_intro) axioms ([], [])
|
haftmann@29358
|
776 |
(map (fn n => (n, stamp ())) notes |> rev) (map (fn d => (d, stamp ())) deps' |> rev)
|
haftmann@29358
|
777 |
|> TheoryTarget.init (SOME name)
|
haftmann@29358
|
778 |
|> fold (fn (kind, facts) => LocalTheory.notes kind facts #> snd) notes';
|
ballarin@29028
|
779 |
|
haftmann@29358
|
780 |
in (name, loc_ctxt) end;
|
ballarin@28795
|
781 |
|
ballarin@28795
|
782 |
in
|
ballarin@28795
|
783 |
|
haftmann@29501
|
784 |
val add_locale = gen_add_locale cert_declaration;
|
ballarin@28902
|
785 |
val add_locale_cmd = gen_add_locale read_declaration;
|
ballarin@28795
|
786 |
|
ballarin@28795
|
787 |
end;
|
ballarin@28795
|
788 |
|
ballarin@28895
|
789 |
|
ballarin@28895
|
790 |
(*** Interpretation ***)
|
ballarin@28895
|
791 |
|
ballarin@28895
|
792 |
(** Interpretation between locales: declaring sublocale relationships **)
|
ballarin@28895
|
793 |
|
ballarin@28895
|
794 |
local
|
ballarin@28895
|
795 |
|
haftmann@29578
|
796 |
fun gen_sublocale prep_expr intern raw_target expression thy =
|
ballarin@28895
|
797 |
let
|
ballarin@28902
|
798 |
val target = intern thy raw_target;
|
haftmann@29360
|
799 |
val target_ctxt = Locale.init target thy;
|
ballarin@28895
|
800 |
|
ballarin@28903
|
801 |
val ((propss, deps, export), goal_ctxt) = prep_expr expression target_ctxt;
|
ballarin@28898
|
802 |
|
haftmann@29578
|
803 |
fun after_qed witss = ProofContext.theory (
|
haftmann@29578
|
804 |
fold2 (fn (name, morph) => fn wits => Locale.add_dependency target
|
haftmann@29578
|
805 |
(name, morph $> Element.satisfy_morphism wits $> export)) deps witss #>
|
haftmann@29578
|
806 |
(fn thy => fold_rev Locale.activate_global_facts
|
haftmann@29389
|
807 |
(Locale.get_registrations thy) thy));
|
haftmann@29578
|
808 |
in Element.witness_proof after_qed propss goal_ctxt end;
|
ballarin@28895
|
809 |
|
ballarin@28895
|
810 |
in
|
ballarin@28895
|
811 |
|
haftmann@29501
|
812 |
fun sublocale x = gen_sublocale cert_goal_expression (K I) x;
|
haftmann@29360
|
813 |
fun sublocale_cmd x = gen_sublocale read_goal_expression Locale.intern x;
|
ballarin@28895
|
814 |
|
ballarin@28795
|
815 |
end;
|
ballarin@28895
|
816 |
|
ballarin@29018
|
817 |
|
ballarin@28993
|
818 |
(** Interpretation in theories **)
|
ballarin@28993
|
819 |
|
ballarin@28993
|
820 |
local
|
ballarin@28993
|
821 |
|
ballarin@29211
|
822 |
fun gen_interpretation prep_expr parse_prop prep_attr
|
haftmann@29496
|
823 |
expression equations theory =
|
ballarin@28993
|
824 |
let
|
haftmann@29496
|
825 |
val ((propss, regs, export), expr_ctxt) = ProofContext.init theory
|
haftmann@29496
|
826 |
|> prep_expr expression;
|
haftmann@29439
|
827 |
|
ballarin@29211
|
828 |
val eqns = map (parse_prop expr_ctxt o snd) equations |> Syntax.check_terms expr_ctxt;
|
haftmann@29496
|
829 |
val eq_attns = map ((apsnd o map) (prep_attr theory) o fst) equations;
|
ballarin@29211
|
830 |
val goal_ctxt = fold Variable.auto_fixes eqns expr_ctxt;
|
ballarin@29211
|
831 |
val export' = Variable.export_morphism goal_ctxt expr_ctxt;
|
ballarin@29210
|
832 |
|
haftmann@29578
|
833 |
fun store_reg ((name, morph), wits) thy =
|
haftmann@29439
|
834 |
let
|
haftmann@29578
|
835 |
val wits' = map (Element.morph_witness export') wits;
|
haftmann@29578
|
836 |
val morph' = morph $> Element.satisfy_morphism wits';
|
haftmann@29439
|
837 |
in
|
haftmann@29439
|
838 |
thy
|
haftmann@29439
|
839 |
|> Locale.add_registration (name, (morph', export))
|
haftmann@29439
|
840 |
|> pair (name, morph')
|
haftmann@29439
|
841 |
end;
|
haftmann@29439
|
842 |
|
haftmann@29439
|
843 |
fun store_eqns_activate regs [] thy =
|
haftmann@29439
|
844 |
thy
|
haftmann@29439
|
845 |
|> fold (fn (name, morph) =>
|
haftmann@29439
|
846 |
Locale.activate_global_facts (name, morph $> export)) regs
|
haftmann@29578
|
847 |
| store_eqns_activate regs eqs thy =
|
haftmann@29439
|
848 |
let
|
haftmann@29578
|
849 |
val eqs' = eqs |> map (Morphism.thm (export' $> export) #>
|
haftmann@29439
|
850 |
LocalDefs.meta_rewrite_rule (ProofContext.init thy) #>
|
haftmann@29439
|
851 |
Drule.abs_def);
|
haftmann@29578
|
852 |
val eq_morph = Element.eq_morphism thy eqs';
|
haftmann@29439
|
853 |
val eq_attns' = map ((apsnd o map) (Attrib.attribute_i thy)) eq_attns;
|
haftmann@29439
|
854 |
in
|
haftmann@29439
|
855 |
thy
|
haftmann@29439
|
856 |
|> fold (fn (name, morph) =>
|
haftmann@29439
|
857 |
Locale.amend_registration eq_morph (name, morph) #>
|
haftmann@29439
|
858 |
Locale.activate_global_facts (name, morph $> eq_morph $> export)) regs
|
haftmann@29578
|
859 |
|> PureThy.note_thmss Thm.lemmaK (eq_attns' ~~ map (fn eq => [([eq], [])]) eqs')
|
haftmann@29439
|
860 |
|> snd
|
haftmann@29439
|
861 |
end;
|
haftmann@29439
|
862 |
|
haftmann@29578
|
863 |
fun after_qed wits eqs = ProofContext.theory (fold_map store_reg (regs ~~ wits)
|
haftmann@29578
|
864 |
#-> (fn regs => store_eqns_activate regs eqs));
|
haftmann@29439
|
865 |
|
haftmann@29578
|
866 |
in Element.witness_proof_eqs after_qed propss eqns goal_ctxt end;
|
ballarin@28993
|
867 |
|
ballarin@28993
|
868 |
in
|
ballarin@28993
|
869 |
|
haftmann@29501
|
870 |
fun interpretation x = gen_interpretation cert_goal_expression (K I) (K I) x;
|
ballarin@29210
|
871 |
fun interpretation_cmd x = gen_interpretation read_goal_expression
|
ballarin@29211
|
872 |
Syntax.parse_prop Attrib.intern_src x;
|
ballarin@28895
|
873 |
|
ballarin@28895
|
874 |
end;
|
ballarin@28903
|
875 |
|
ballarin@29018
|
876 |
|
ballarin@29018
|
877 |
(** Interpretation in proof contexts **)
|
ballarin@29018
|
878 |
|
ballarin@29018
|
879 |
local
|
ballarin@29018
|
880 |
|
ballarin@29018
|
881 |
fun gen_interpret prep_expr
|
ballarin@29018
|
882 |
expression int state =
|
ballarin@29018
|
883 |
let
|
ballarin@29018
|
884 |
val _ = Proof.assert_forward_or_chain state;
|
ballarin@29018
|
885 |
val ctxt = Proof.context_of state;
|
ballarin@29018
|
886 |
|
ballarin@29018
|
887 |
val ((propss, regs, export), goal_ctxt) = prep_expr expression ctxt;
|
ballarin@29018
|
888 |
|
haftmann@29578
|
889 |
fun store_reg (name, morph) thms =
|
ballarin@29018
|
890 |
let
|
ballarin@29018
|
891 |
val morph' = morph $> Element.satisfy_morphism thms $> export;
|
haftmann@29578
|
892 |
in Locale.activate_local_facts (name, morph') end;
|
ballarin@29018
|
893 |
|
haftmann@29578
|
894 |
fun after_qed wits =
|
haftmann@29578
|
895 |
Proof.map_context (fold2 store_reg regs wits);
|
ballarin@29018
|
896 |
in
|
haftmann@29578
|
897 |
state
|
haftmann@29578
|
898 |
|> Element.witness_local_proof after_qed "interpret" propss goal_ctxt int
|
ballarin@29018
|
899 |
end;
|
ballarin@29018
|
900 |
|
ballarin@29018
|
901 |
in
|
ballarin@29018
|
902 |
|
haftmann@29501
|
903 |
fun interpret x = gen_interpret cert_goal_expression x;
|
ballarin@29018
|
904 |
fun interpret_cmd x = gen_interpret read_goal_expression x;
|
ballarin@29018
|
905 |
|
ballarin@28993
|
906 |
end;
|
ballarin@28993
|
907 |
|
ballarin@29018
|
908 |
end;
|
ballarin@29018
|
909 |
|