author | wenzelm |
Mon, 17 May 2010 15:05:32 +0200 | |
changeset 36958 | ad5313f1bd30 |
parent 36692 | 54b64d4ad524 |
child 36960 | 01594f816e3a |
permissions | -rw-r--r-- |
28308 | 1 |
(* Title: HOL/Statespace/state_space.ML |
25171 | 2 |
Author: Norbert Schirmer, TU Muenchen |
3 |
*) |
|
4 |
||
25408 | 5 |
signature STATE_SPACE = |
6 |
sig |
|
7 |
val KN : string |
|
8 |
val distinct_compsN : string |
|
9 |
val getN : string |
|
10 |
val putN : string |
|
11 |
val injectN : string |
|
12 |
val namespaceN : string |
|
13 |
val projectN : string |
|
14 |
val valuetypesN : string |
|
15 |
||
16 |
val namespace_definition : |
|
17 |
bstring -> |
|
27276 | 18 |
typ -> |
29247
95d3a82857e5
adapted statespace module to new locales;
Norbert Schirmer <norbert.schirmer@web.de>
parents:
29064
diff
changeset
|
19 |
Expression.expression -> |
27276 | 20 |
string list -> string list -> theory -> theory |
25408 | 21 |
|
22 |
val define_statespace : |
|
23 |
string list -> |
|
24 |
string -> |
|
25 |
(string list * bstring * (string * string) list) list -> |
|
27276 | 26 |
(string * string) list -> theory -> theory |
25408 | 27 |
val define_statespace_i : |
28 |
string option -> |
|
29 |
string list -> |
|
30 |
string -> |
|
27276 | 31 |
(typ list * bstring * (string * string) list) list -> |
32 |
(string * typ) list -> theory -> theory |
|
25408 | 33 |
|
34 |
val statespace_decl : |
|
35 |
((string list * bstring) * |
|
36 |
((string list * xstring * (bstring * bstring) list) list * |
|
36958 | 37 |
(bstring * string) list)) parser |
25408 | 38 |
|
39 |
||
27276 | 40 |
val neq_x_y : Proof.context -> term -> term -> thm option |
27283 | 41 |
val distinctNameSolver : Simplifier.solver |
25408 | 42 |
val distinctTree_tac : |
27276 | 43 |
Proof.context -> term * int -> Tactical.tactic |
27283 | 44 |
val distinct_simproc : Simplifier.simproc |
25408 | 45 |
|
46 |
||
27276 | 47 |
val get_comp : Context.generic -> string -> (typ * string) Option.option |
25408 | 48 |
val get_silent : Context.generic -> bool |
49 |
val set_silent : bool -> Context.generic -> Context.generic |
|
50 |
||
27276 | 51 |
val gen_lookup_tr : Proof.context -> term -> string -> term |
52 |
val lookup_swap_tr : Proof.context -> term list -> term |
|
53 |
val lookup_tr : Proof.context -> term list -> term |
|
54 |
val lookup_tr' : Proof.context -> term list -> term |
|
25408 | 55 |
|
56 |
val gen_update_tr : |
|
27276 | 57 |
bool -> Proof.context -> string -> term -> term -> term |
58 |
val update_tr : Proof.context -> term list -> term |
|
59 |
val update_tr' : Proof.context -> term list -> term |
|
25408 | 60 |
end; |
61 |
||
29247
95d3a82857e5
adapted statespace module to new locales;
Norbert Schirmer <norbert.schirmer@web.de>
parents:
29064
diff
changeset
|
62 |
structure StateSpace : STATE_SPACE = |
25171 | 63 |
struct |
64 |
||
65 |
(* Theorems *) |
|
66 |
||
67 |
(* Names *) |
|
68 |
val distinct_compsN = "distinct_names" |
|
69 |
val namespaceN = "_namespace" |
|
70 |
val valuetypesN = "_valuetypes" |
|
71 |
val projectN = "project" |
|
72 |
val injectN = "inject" |
|
73 |
val getN = "get" |
|
74 |
val putN = "put" |
|
75 |
val project_injectL = "StateSpaceLocale.project_inject"; |
|
76 |
val KN = "StateFun.K_statefun" |
|
77 |
||
78 |
||
79 |
(* Library *) |
|
80 |
||
81 |
fun fold1 f xs = fold f (tl xs) (hd xs) |
|
82 |
fun fold1' f [] x = x |
|
83 |
| fold1' f xs _ = fold1 f xs |
|
26478 | 84 |
|
85 |
fun sublist_idx eq xs ys = |
|
25171 | 86 |
let |
26478 | 87 |
fun sublist n xs ys = |
25171 | 88 |
if is_prefix eq xs ys then SOME n |
89 |
else (case ys of [] => NONE |
|
90 |
| (y::ys') => sublist (n+1) xs ys') |
|
91 |
in sublist 0 xs ys end; |
|
92 |
||
93 |
fun is_sublist eq xs ys = is_some (sublist_idx eq xs ys); |
|
94 |
||
95 |
fun sorted_subset eq [] ys = true |
|
96 |
| sorted_subset eq (x::xs) [] = false |
|
97 |
| sorted_subset eq (x::xs) (y::ys) = if eq (x,y) then sorted_subset eq xs ys |
|
98 |
else sorted_subset eq (x::xs) ys; |
|
99 |
||
100 |
||
101 |
||
102 |
type namespace_info = |
|
103 |
{declinfo: (typ*string) Termtab.table, (* type, name of statespace *) |
|
104 |
distinctthm: thm Symtab.table, |
|
105 |
silent: bool |
|
106 |
}; |
|
26478 | 107 |
|
33519 | 108 |
structure NameSpaceData = Generic_Data |
109 |
( |
|
26478 | 110 |
type T = namespace_info; |
25171 | 111 |
val empty = {declinfo = Termtab.empty, distinctthm = Symtab.empty, silent = false}; |
112 |
val extend = I; |
|
33519 | 113 |
fun merge |
114 |
({declinfo=declinfo1, distinctthm=distinctthm1, silent=silent1}, |
|
115 |
{declinfo=declinfo2, distinctthm=distinctthm2, silent=silent2}) : T = |
|
116 |
{declinfo = Termtab.merge (K true) (declinfo1, declinfo2), |
|
117 |
distinctthm = Symtab.merge (K true) (distinctthm1, distinctthm2), |
|
118 |
silent = silent1 andalso silent2} |
|
119 |
); |
|
25171 | 120 |
|
121 |
fun make_namespace_data declinfo distinctthm silent = |
|
122 |
{declinfo=declinfo,distinctthm=distinctthm,silent=silent}; |
|
123 |
||
124 |
||
125 |
fun delete_declinfo n ctxt = |
|
126 |
let val {declinfo,distinctthm,silent} = NameSpaceData.get ctxt; |
|
26478 | 127 |
in NameSpaceData.put |
25171 | 128 |
(make_namespace_data (Termtab.delete_safe n declinfo) distinctthm silent) ctxt |
129 |
end; |
|
130 |
||
131 |
||
132 |
fun update_declinfo (n,v) ctxt = |
|
133 |
let val {declinfo,distinctthm,silent} = NameSpaceData.get ctxt; |
|
26478 | 134 |
in NameSpaceData.put |
25171 | 135 |
(make_namespace_data (Termtab.update (n,v) declinfo) distinctthm silent) ctxt |
136 |
end; |
|
137 |
||
138 |
fun set_silent silent ctxt = |
|
139 |
let val {declinfo,distinctthm,...} = NameSpaceData.get ctxt; |
|
26478 | 140 |
in NameSpaceData.put |
25171 | 141 |
(make_namespace_data declinfo distinctthm silent) ctxt |
142 |
end; |
|
143 |
||
144 |
val get_silent = #silent o NameSpaceData.get; |
|
26478 | 145 |
|
25171 | 146 |
fun prove_interpretation_in ctxt_tac (name, expr) thy = |
147 |
thy |
|
29247
95d3a82857e5
adapted statespace module to new locales;
Norbert Schirmer <norbert.schirmer@web.de>
parents:
29064
diff
changeset
|
148 |
|> Expression.sublocale_cmd name expr |
26478 | 149 |
|> Proof.global_terminal_proof |
32194 | 150 |
(Method.Basic (fn ctxt => SIMPLE_METHOD (ctxt_tac ctxt)), NONE) |
25171 | 151 |
|> ProofContext.theory_of |
152 |
||
29247
95d3a82857e5
adapted statespace module to new locales;
Norbert Schirmer <norbert.schirmer@web.de>
parents:
29064
diff
changeset
|
153 |
fun add_locale name expr elems thy = |
95d3a82857e5
adapted statespace module to new locales;
Norbert Schirmer <norbert.schirmer@web.de>
parents:
29064
diff
changeset
|
154 |
thy |
30346 | 155 |
|> Expression.add_locale (Binding.name name) (Binding.name name) expr elems |
29362 | 156 |
|> snd |
33671 | 157 |
|> Local_Theory.exit; |
29247
95d3a82857e5
adapted statespace module to new locales;
Norbert Schirmer <norbert.schirmer@web.de>
parents:
29064
diff
changeset
|
158 |
|
95d3a82857e5
adapted statespace module to new locales;
Norbert Schirmer <norbert.schirmer@web.de>
parents:
29064
diff
changeset
|
159 |
fun add_locale_cmd name expr elems thy = |
95d3a82857e5
adapted statespace module to new locales;
Norbert Schirmer <norbert.schirmer@web.de>
parents:
29064
diff
changeset
|
160 |
thy |
30346 | 161 |
|> Expression.add_locale_cmd (Binding.name name) Binding.empty expr elems |
29362 | 162 |
|> snd |
33671 | 163 |
|> Local_Theory.exit; |
29247
95d3a82857e5
adapted statespace module to new locales;
Norbert Schirmer <norbert.schirmer@web.de>
parents:
29064
diff
changeset
|
164 |
|
25171 | 165 |
type statespace_info = |
166 |
{args: (string * sort) list, (* type arguments *) |
|
167 |
parents: (typ list * string * string option list) list, |
|
168 |
(* type instantiation, state-space name, component renamings *) |
|
169 |
components: (string * typ) list, |
|
170 |
types: typ list (* range types of state space *) |
|
171 |
}; |
|
172 |
||
33519 | 173 |
structure StateSpaceData = Generic_Data |
174 |
( |
|
25171 | 175 |
type T = statespace_info Symtab.table; |
176 |
val empty = Symtab.empty; |
|
177 |
val extend = I; |
|
33519 | 178 |
fun merge data : T = Symtab.merge (K true) data; |
179 |
); |
|
25171 | 180 |
|
181 |
fun add_statespace name args parents components types ctxt = |
|
26478 | 182 |
StateSpaceData.put |
25171 | 183 |
(Symtab.update_new (name, {args=args,parents=parents, |
184 |
components=components,types=types}) (StateSpaceData.get ctxt)) |
|
26478 | 185 |
ctxt; |
25171 | 186 |
|
187 |
fun get_statespace ctxt name = |
|
188 |
Symtab.lookup (StateSpaceData.get ctxt) name; |
|
189 |
||
190 |
||
26478 | 191 |
fun lookupI eq xs n = |
25171 | 192 |
(case AList.lookup eq xs n of |
193 |
SOME v => v |
|
194 |
| NONE => n); |
|
26478 | 195 |
|
25171 | 196 |
fun mk_free ctxt name = |
26478 | 197 |
if Variable.is_fixed ctxt name orelse Variable.is_declared ctxt name |
25171 | 198 |
then |
199 |
let val n' = lookupI (op =) (Variable.fixes_of ctxt) name |
|
36506 | 200 |
in SOME (Free (n',ProofContext.infer_type ctxt (n', dummyT))) end |
25171 | 201 |
else NONE |
26478 | 202 |
|
203 |
||
25171 | 204 |
fun get_dist_thm ctxt name = Symtab.lookup (#distinctthm (NameSpaceData.get ctxt)) name; |
26478 | 205 |
fun get_comp ctxt name = |
206 |
Option.mapPartial |
|
207 |
(Termtab.lookup (#declinfo (NameSpaceData.get ctxt))) |
|
25171 | 208 |
(mk_free (Context.proof_of ctxt) name); |
209 |
||
210 |
||
211 |
(*** Tactics ***) |
|
212 |
||
213 |
fun neq_x_y ctxt x y = |
|
214 |
(let |
|
26478 | 215 |
val dist_thm = the (get_dist_thm (Context.Proof ctxt) (#1 (dest_Free x))); |
25171 | 216 |
val ctree = cprop_of dist_thm |> Thm.dest_comb |> #2 |> Thm.dest_comb |> #2; |
217 |
val tree = term_of ctree; |
|
218 |
val x_path = the (DistinctTreeProver.find_tree x tree); |
|
219 |
val y_path = the (DistinctTreeProver.find_tree y tree); |
|
220 |
val thm = DistinctTreeProver.distinctTreeProver dist_thm x_path y_path; |
|
26478 | 221 |
in SOME thm |
25171 | 222 |
end handle Option => NONE) |
223 |
||
26478 | 224 |
fun distinctTree_tac ctxt |
225 |
(Const ("Trueprop",_) $ |
|
25171 | 226 |
(Const ("Not", _) $ (Const ("op =", _) $ (x as Free _)$ (y as Free _))), i) = |
227 |
(case (neq_x_y ctxt x y) of |
|
228 |
SOME neq => rtac neq i |
|
229 |
| NONE => no_tac) |
|
230 |
| distinctTree_tac _ _ = no_tac; |
|
231 |
||
232 |
val distinctNameSolver = mk_solver' "distinctNameSolver" |
|
30289 | 233 |
(fn ss => case try Simplifier.the_context ss of |
25171 | 234 |
SOME ctxt => SUBGOAL (distinctTree_tac ctxt) |
235 |
| NONE => fn i => no_tac) |
|
236 |
||
237 |
val distinct_simproc = |
|
29064 | 238 |
Simplifier.simproc @{theory HOL} "StateSpace.distinct_simproc" ["x = y"] |
25171 | 239 |
(fn thy => fn ss => (fn (Const ("op =",_)$(x as Free _)$(y as Free _)) => |
30289 | 240 |
(case try Simplifier.the_context ss of |
26478 | 241 |
SOME ctxt => Option.map (fn neq => DistinctTreeProver.neq_to_eq_False OF [neq]) |
242 |
(neq_x_y ctxt x y) |
|
25171 | 243 |
| NONE => NONE) |
244 |
| _ => NONE)) |
|
245 |
||
246 |
local |
|
26478 | 247 |
val ss = HOL_basic_ss |
248 |
in |
|
249 |
fun interprete_parent name dist_thm_name parent_expr thy = |
|
25171 | 250 |
let |
251 |
||
252 |
fun solve_tac ctxt (_,i) st = |
|
253 |
let |
|
26343
0dd2eab7b296
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26336
diff
changeset
|
254 |
val distinct_thm = ProofContext.get_thm ctxt dist_thm_name; |
25171 | 255 |
val goal = List.nth (cprems_of st,i-1); |
256 |
val rule = DistinctTreeProver.distinct_implProver distinct_thm goal; |
|
257 |
in EVERY [rtac rule i] st |
|
258 |
end |
|
26478 | 259 |
|
29360 | 260 |
fun tac ctxt = EVERY [Locale.intro_locales_tac true ctxt [], |
26478 | 261 |
ALLGOALS (SUBGOAL (solve_tac ctxt))] |
262 |
||
263 |
in thy |
|
25171 | 264 |
|> prove_interpretation_in tac (name,parent_expr) |
26478 | 265 |
end; |
25171 | 266 |
|
267 |
end; |
|
268 |
||
26478 | 269 |
fun namespace_definition name nameT parent_expr parent_comps new_comps thy = |
25171 | 270 |
let |
271 |
val all_comps = parent_comps @ new_comps; |
|
29247
95d3a82857e5
adapted statespace module to new locales;
Norbert Schirmer <norbert.schirmer@web.de>
parents:
29064
diff
changeset
|
272 |
val vars = (map (fn n => (Binding.name n, NONE, NoSyn)) all_comps); |
28965 | 273 |
val full_name = Sign.full_bname thy name; |
25171 | 274 |
val dist_thm_name = distinct_compsN; |
275 |
||
29247
95d3a82857e5
adapted statespace module to new locales;
Norbert Schirmer <norbert.schirmer@web.de>
parents:
29064
diff
changeset
|
276 |
val dist_thm_full_name = dist_thm_name; |
26478 | 277 |
fun comps_of_thm thm = prop_of thm |
25171 | 278 |
|> (fn (_$(_$t)) => DistinctTreeProver.dest_tree t) |> map (fst o dest_Free); |
26478 | 279 |
|
25171 | 280 |
fun type_attr phi (ctxt,thm) = |
281 |
(case ctxt of Context.Theory _ => (ctxt,thm) |
|
282 |
| _ => |
|
26478 | 283 |
let |
25171 | 284 |
val {declinfo,distinctthm=tt,silent} = (NameSpaceData.get ctxt); |
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32952
diff
changeset
|
285 |
val all_names = comps_of_thm thm; |
25171 | 286 |
fun upd name tt = |
287 |
(case (Symtab.lookup tt name) of |
|
288 |
SOME dthm => if sorted_subset (op =) (comps_of_thm dthm) all_names |
|
289 |
then Symtab.update (name,thm) tt else tt |
|
290 |
| NONE => Symtab.update (name,thm) tt) |
|
291 |
||
292 |
val tt' = tt |> fold upd all_names; |
|
293 |
val activate_simproc = |
|
33222 | 294 |
Output.no_warnings_CRITICAL (* FIXME !?! *) |
26496
49ae9456eba9
purely functional setup of claset/simpset/clasimpset;
wenzelm
parents:
26478
diff
changeset
|
295 |
(Simplifier.map_ss (fn ss => ss addsimprocs [distinct_simproc])); |
25171 | 296 |
val ctxt' = |
26478 | 297 |
ctxt |
25171 | 298 |
|> NameSpaceData.put {declinfo=declinfo,distinctthm=tt',silent=silent} |
299 |
|> activate_simproc |
|
26478 | 300 |
in (ctxt',thm) |
25171 | 301 |
end) |
26478 | 302 |
|
25171 | 303 |
val attr = Attrib.internal type_attr; |
304 |
||
28965 | 305 |
val assumes = Element.Assumes [((Binding.name dist_thm_name,[attr]), |
25171 | 306 |
[(HOLogic.Trueprop $ |
307 |
(Const ("DistinctTreeProver.all_distinct", |
|
308 |
Type ("DistinctTreeProver.tree",[nameT]) --> HOLogic.boolT) $ |
|
26478 | 309 |
DistinctTreeProver.mk_tree (fn n => Free (n,nameT)) nameT |
25171 | 310 |
(sort fast_string_ord all_comps)), |
311 |
([]))])]; |
|
26478 | 312 |
in thy |
29247
95d3a82857e5
adapted statespace module to new locales;
Norbert Schirmer <norbert.schirmer@web.de>
parents:
29064
diff
changeset
|
313 |
|> add_locale name ([],vars) [assumes] |
95d3a82857e5
adapted statespace module to new locales;
Norbert Schirmer <norbert.schirmer@web.de>
parents:
29064
diff
changeset
|
314 |
|> ProofContext.theory_of |
95d3a82857e5
adapted statespace module to new locales;
Norbert Schirmer <norbert.schirmer@web.de>
parents:
29064
diff
changeset
|
315 |
|> interprete_parent name dist_thm_full_name parent_expr |
25171 | 316 |
end; |
317 |
||
32651 | 318 |
fun encode_dot x = if x= #"." then #"_" else x; |
25171 | 319 |
|
320 |
fun encode_type (TFree (s, _)) = s |
|
321 |
| encode_type (TVar ((s,i),_)) = "?" ^ s ^ string_of_int i |
|
26478 | 322 |
| encode_type (Type (n,Ts)) = |
25171 | 323 |
let |
324 |
val Ts' = fold1' (fn x => fn y => x ^ "_" ^ y) (map encode_type Ts) ""; |
|
32651 | 325 |
val n' = String.map encode_dot n; |
25171 | 326 |
in if Ts'="" then n' else Ts' ^ "_" ^ n' end; |
327 |
||
328 |
fun project_name T = projectN ^"_"^encode_type T; |
|
329 |
fun inject_name T = injectN ^"_"^encode_type T; |
|
330 |
||
331 |
fun project_free T pT V = Free (project_name T, V --> pT); |
|
332 |
fun inject_free T pT V = Free (inject_name T, pT --> V); |
|
333 |
||
334 |
fun get_name n = getN ^ "_" ^ n; |
|
335 |
fun put_name n = putN ^ "_" ^ n; |
|
336 |
fun get_const n T nT V = Free (get_name n, (nT --> V) --> T); |
|
337 |
fun put_const n T nT V = Free (put_name n, T --> (nT --> V) --> (nT --> V)); |
|
338 |
||
339 |
fun lookup_const T nT V = Const ("StateFun.lookup",(V --> T) --> nT --> (nT --> V) --> T); |
|
26478 | 340 |
fun update_const T nT V = |
25171 | 341 |
Const ("StateFun.update", |
342 |
(V --> T) --> (T --> V) --> nT --> (T --> T) --> (nT --> V) --> (nT --> V)); |
|
343 |
||
344 |
fun K_const T = Const ("StateFun.K_statefun",T --> T --> T); |
|
345 |
||
346 |
val no_syn = #3 (Syntax.no_syn ((),())); |
|
347 |
||
348 |
||
349 |
fun add_declaration name decl thy = |
|
350 |
thy |
|
33553 | 351 |
|> Theory_Target.init name |
33671 | 352 |
|> (fn lthy => Local_Theory.declaration false (decl lthy) lthy) |
353 |
|> Local_Theory.exit_global; |
|
25171 | 354 |
|
355 |
fun parent_components thy (Ts, pname, renaming) = |
|
356 |
let |
|
357 |
val ctxt = Context.Theory thy; |
|
358 |
fun rename [] xs = xs |
|
359 |
| rename (NONE::rs) (x::xs) = x::rename rs xs |
|
360 |
| rename (SOME r::rs) ((x,T)::xs) = (r,T)::rename rs xs; |
|
26478 | 361 |
val {args,parents,components,...} = |
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32952
diff
changeset
|
362 |
the (Symtab.lookup (StateSpaceData.get ctxt) pname); |
25171 | 363 |
val inst = map fst args ~~ Ts; |
364 |
val subst = Term.map_type_tfree (the o AList.lookup (op =) inst o fst); |
|
26478 | 365 |
val parent_comps = |
32952 | 366 |
maps (fn (Ts',n,rs) => parent_components thy (map subst Ts',n,rs)) parents; |
25171 | 367 |
val all_comps = rename renaming (parent_comps @ map (apsnd subst) components); |
368 |
in all_comps end; |
|
369 |
||
370 |
fun take_upto i xs = List.take(xs,i) handle Subscript => xs; |
|
371 |
||
372 |
fun statespace_definition state_type args name parents parent_comps components thy = |
|
26478 | 373 |
let |
28965 | 374 |
val full_name = Sign.full_bname thy name; |
25171 | 375 |
val all_comps = parent_comps @ components; |
376 |
||
377 |
val components' = map (fn (n,T) => (n,(T,full_name))) components; |
|
26478 | 378 |
val all_comps' = map (fn (n,T) => (n,(T,full_name))) all_comps; |
25171 | 379 |
|
29247
95d3a82857e5
adapted statespace module to new locales;
Norbert Schirmer <norbert.schirmer@web.de>
parents:
29064
diff
changeset
|
380 |
fun parent_expr (_,n,rs) = (suffix namespaceN n,((n,false),Expression.Positional rs)); |
95d3a82857e5
adapted statespace module to new locales;
Norbert Schirmer <norbert.schirmer@web.de>
parents:
29064
diff
changeset
|
381 |
(* FIXME: a more specific renaming-prefix (including parameter names) may be nicer *) |
95d3a82857e5
adapted statespace module to new locales;
Norbert Schirmer <norbert.schirmer@web.de>
parents:
29064
diff
changeset
|
382 |
val parents_expr = map parent_expr parents; |
25171 | 383 |
fun distinct_types Ts = |
27276 | 384 |
let val tab = fold (fn T => fn tab => Typtab.update (T,()) tab) Ts Typtab.empty; |
385 |
in map fst (Typtab.dest tab) end; |
|
25171 | 386 |
|
387 |
val Ts = distinct_types (map snd all_comps); |
|
388 |
val arg_names = map fst args; |
|
389 |
val valueN = Name.variant arg_names "'value"; |
|
390 |
val nameN = Name.variant (valueN::arg_names) "'name"; |
|
391 |
val valueT = TFree (valueN, Sign.defaultS thy); |
|
392 |
val nameT = TFree (nameN, Sign.defaultS thy); |
|
393 |
val stateT = nameT --> valueT; |
|
394 |
fun projectT T = valueT --> T; |
|
26478 | 395 |
fun injectT T = T --> valueT; |
29247
95d3a82857e5
adapted statespace module to new locales;
Norbert Schirmer <norbert.schirmer@web.de>
parents:
29064
diff
changeset
|
396 |
val locinsts = map (fn T => (project_injectL, |
95d3a82857e5
adapted statespace module to new locales;
Norbert Schirmer <norbert.schirmer@web.de>
parents:
29064
diff
changeset
|
397 |
(("",false),Expression.Positional |
95d3a82857e5
adapted statespace module to new locales;
Norbert Schirmer <norbert.schirmer@web.de>
parents:
29064
diff
changeset
|
398 |
[SOME (Free (project_name T,projectT T)), |
95d3a82857e5
adapted statespace module to new locales;
Norbert Schirmer <norbert.schirmer@web.de>
parents:
29064
diff
changeset
|
399 |
SOME (Free ((inject_name T,injectT T)))]))) Ts; |
32952 | 400 |
val locs = maps (fn T => [(Binding.name (project_name T),NONE,NoSyn), |
401 |
(Binding.name (inject_name T),NONE,NoSyn)]) Ts; |
|
402 |
val constrains = maps (fn T => [(project_name T,projectT T),(inject_name T,injectT T)]) Ts; |
|
25171 | 403 |
|
29247
95d3a82857e5
adapted statespace module to new locales;
Norbert Schirmer <norbert.schirmer@web.de>
parents:
29064
diff
changeset
|
404 |
fun interprete_parent_valuetypes (Ts, pname, _) thy = |
25171 | 405 |
let |
26478 | 406 |
val {args,types,...} = |
25171 | 407 |
the (Symtab.lookup (StateSpaceData.get (Context.Theory thy)) pname); |
408 |
val inst = map fst args ~~ Ts; |
|
409 |
val subst = Term.map_type_tfree (the o AList.lookup (op =) inst o fst); |
|
32952 | 410 |
val pars = maps ((fn T => [project_name T,inject_name T]) o subst) types; |
29247
95d3a82857e5
adapted statespace module to new locales;
Norbert Schirmer <norbert.schirmer@web.de>
parents:
29064
diff
changeset
|
411 |
|
95d3a82857e5
adapted statespace module to new locales;
Norbert Schirmer <norbert.schirmer@web.de>
parents:
29064
diff
changeset
|
412 |
val expr = ([(suffix valuetypesN name, |
95d3a82857e5
adapted statespace module to new locales;
Norbert Schirmer <norbert.schirmer@web.de>
parents:
29064
diff
changeset
|
413 |
(("",false),Expression.Positional (map SOME pars)))],[]); |
29291 | 414 |
in |
30473
e0b66c11e7e4
Assumption.all_prems_of, Assumption.all_assms_of;
wenzelm
parents:
30364
diff
changeset
|
415 |
prove_interpretation_in (ALLGOALS o solve_tac o Assumption.all_prems_of) |
29291 | 416 |
(suffix valuetypesN name, expr) thy |
417 |
end; |
|
25171 | 418 |
|
419 |
fun interprete_parent (_, pname, rs) = |
|
420 |
let |
|
29247
95d3a82857e5
adapted statespace module to new locales;
Norbert Schirmer <norbert.schirmer@web.de>
parents:
29064
diff
changeset
|
421 |
val expr = ([(pname, (("",false), Expression.Positional rs))],[]) |
26478 | 422 |
in prove_interpretation_in |
29360 | 423 |
(fn ctxt => Locale.intro_locales_tac false ctxt []) |
25171 | 424 |
(full_name, expr) end; |
425 |
||
426 |
fun declare_declinfo updates lthy phi ctxt = |
|
427 |
let |
|
26478 | 428 |
fun upd_prf ctxt = |
25171 | 429 |
let |
430 |
fun upd (n,v) = |
|
431 |
let |
|
36506 | 432 |
val nT = ProofContext.infer_type (Local_Theory.target_of lthy) (n, dummyT) |
26478 | 433 |
in Context.proof_map |
434 |
(update_declinfo (Morphism.term phi (Free (n,nT)),v)) |
|
25171 | 435 |
end; |
436 |
in ctxt |> fold upd updates end; |
|
437 |
||
438 |
in Context.mapping I upd_prf ctxt end; |
|
439 |
||
26478 | 440 |
fun string_of_typ T = |
32966
5b21661fe618
indicate CRITICAL nature of various setmp combinators;
wenzelm
parents:
32960
diff
changeset
|
441 |
setmp_CRITICAL show_sorts true |
36610
bafd82950e24
renamed ProofContext.init to ProofContext.init_global to emphasize that this is not the real thing;
wenzelm
parents:
36506
diff
changeset
|
442 |
(PrintMode.setmp [] (Syntax.string_of_typ (ProofContext.init_global thy))) T; |
25171 | 443 |
val fixestate = (case state_type of |
444 |
NONE => [] |
|
26478 | 445 |
| SOME s => |
446 |
let |
|
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32952
diff
changeset
|
447 |
val fx = Element.Fixes [(Binding.name s,SOME (string_of_typ stateT),NoSyn)]; |
26478 | 448 |
val cs = Element.Constrains |
25171 | 449 |
(map (fn (n,T) => (n,string_of_typ T)) |
450 |
((map (fn (n,_) => (n,nameT)) all_comps) @ |
|
451 |
constrains)) |
|
452 |
in [fx,cs] end |
|
453 |
) |
|
454 |
||
26478 | 455 |
|
456 |
in thy |
|
457 |
|> namespace_definition |
|
29247
95d3a82857e5
adapted statespace module to new locales;
Norbert Schirmer <norbert.schirmer@web.de>
parents:
29064
diff
changeset
|
458 |
(suffix namespaceN name) nameT (parents_expr,[]) |
25171 | 459 |
(map fst parent_comps) (map fst components) |
460 |
|> Context.theory_map (add_statespace full_name args parents components []) |
|
29247
95d3a82857e5
adapted statespace module to new locales;
Norbert Schirmer <norbert.schirmer@web.de>
parents:
29064
diff
changeset
|
461 |
|> add_locale (suffix valuetypesN name) (locinsts,locs) [] |
95d3a82857e5
adapted statespace module to new locales;
Norbert Schirmer <norbert.schirmer@web.de>
parents:
29064
diff
changeset
|
462 |
|> ProofContext.theory_of |
26478 | 463 |
|> fold interprete_parent_valuetypes parents |
29247
95d3a82857e5
adapted statespace module to new locales;
Norbert Schirmer <norbert.schirmer@web.de>
parents:
29064
diff
changeset
|
464 |
|> add_locale_cmd name |
95d3a82857e5
adapted statespace module to new locales;
Norbert Schirmer <norbert.schirmer@web.de>
parents:
29064
diff
changeset
|
465 |
([(suffix namespaceN full_name ,(("",false),Expression.Named [])), |
95d3a82857e5
adapted statespace module to new locales;
Norbert Schirmer <norbert.schirmer@web.de>
parents:
29064
diff
changeset
|
466 |
(suffix valuetypesN full_name,(("",false),Expression.Named []))],[]) fixestate |
95d3a82857e5
adapted statespace module to new locales;
Norbert Schirmer <norbert.schirmer@web.de>
parents:
29064
diff
changeset
|
467 |
|> ProofContext.theory_of |
25171 | 468 |
|> fold interprete_parent parents |
469 |
|> add_declaration (SOME full_name) (declare_declinfo components') |
|
470 |
end; |
|
471 |
||
472 |
||
473 |
(* prepare arguments *) |
|
474 |
||
27283 | 475 |
fun read_raw_parent ctxt raw_T = |
476 |
(case ProofContext.read_typ_abbrev ctxt raw_T of |
|
25171 | 477 |
Type (name, Ts) => (Ts, name) |
27283 | 478 |
| T => error ("Bad parent statespace specification: " ^ Syntax.string_of_typ ctxt T)); |
25171 | 479 |
|
36149 | 480 |
fun read_typ ctxt raw_T env = |
481 |
let |
|
482 |
val ctxt' = fold (Variable.declare_typ o TFree) env ctxt; |
|
483 |
val T = Syntax.read_typ ctxt' raw_T; |
|
484 |
val env' = OldTerm.add_typ_tfrees (T, env); |
|
485 |
in (T, env') end; |
|
486 |
||
487 |
fun cert_typ ctxt raw_T env = |
|
488 |
let |
|
489 |
val thy = ProofContext.theory_of ctxt; |
|
490 |
val T = Type.no_tvars (Sign.certify_typ thy raw_T) |
|
491 |
handle TYPE (msg, _, _) => error msg; |
|
492 |
val env' = OldTerm.add_typ_tfrees (T, env); |
|
493 |
in (T, env') end; |
|
494 |
||
25171 | 495 |
fun gen_define_statespace prep_typ state_space args name parents comps thy = |
496 |
let (* - args distinct |
|
497 |
- only args may occur in comps and parent-instantiations |
|
26478 | 498 |
- number of insts must match parent args |
25171 | 499 |
- no duplicate renamings |
500 |
- renaming should occur in namespace |
|
501 |
*) |
|
26478 | 502 |
val _ = writeln ("Defining statespace " ^ quote name ^ " ..."); |
25171 | 503 |
|
36610
bafd82950e24
renamed ProofContext.init to ProofContext.init_global to emphasize that this is not the real thing;
wenzelm
parents:
36506
diff
changeset
|
504 |
val ctxt = ProofContext.init_global thy; |
27283 | 505 |
|
25171 | 506 |
fun add_parent (Ts,pname,rs) env = |
507 |
let |
|
28965 | 508 |
val full_pname = Sign.full_bname thy pname; |
26478 | 509 |
val {args,components,...} = |
25171 | 510 |
(case get_statespace (Context.Theory thy) full_pname of |
511 |
SOME r => r |
|
512 |
| NONE => error ("Undefined statespace " ^ quote pname)); |
|
513 |
||
514 |
||
27283 | 515 |
val (Ts',env') = fold_map (prep_typ ctxt) Ts env |
26478 | 516 |
handle ERROR msg => cat_error msg |
36149 | 517 |
("The error(s) above occurred in parent statespace specification " |
25171 | 518 |
^ quote pname); |
519 |
val err_insts = if length args <> length Ts' then |
|
520 |
["number of type instantiation(s) does not match arguments of parent statespace " |
|
521 |
^ quote pname] |
|
522 |
else []; |
|
26478 | 523 |
|
25171 | 524 |
val rnames = map fst rs |
525 |
val err_dup_renamings = (case duplicates (op =) rnames of |
|
526 |
[] => [] |
|
527 |
| dups => ["Duplicate renaming(s) for " ^ commas dups]) |
|
528 |
||
529 |
val cnames = map fst components; |
|
36692
54b64d4ad524
farewell to old-style mem infixes -- type inference in situations with mem_int and mem_string should provide enough information to resolve the type of (op =)
haftmann
parents:
36610
diff
changeset
|
530 |
val err_rename_unknowns = (case subtract (op =) cnames rnames of |
25171 | 531 |
[] => [] |
532 |
| rs => ["Unknown components " ^ commas rs]); |
|
26478 | 533 |
|
25171 | 534 |
|
535 |
val rs' = map (AList.lookup (op =) rs o fst) components; |
|
536 |
val errs =err_insts @ err_dup_renamings @ err_rename_unknowns |
|
537 |
in if null errs then ((Ts',full_pname,rs'),env') |
|
538 |
else error (cat_lines (errs @ ["in parent statespace " ^ quote pname])) |
|
539 |
end; |
|
26478 | 540 |
|
25171 | 541 |
val (parents',env) = fold_map add_parent parents []; |
542 |
||
543 |
val err_dup_args = |
|
544 |
(case duplicates (op =) args of |
|
545 |
[] => [] |
|
546 |
| dups => ["Duplicate type argument(s) " ^ commas dups]); |
|
26478 | 547 |
|
25171 | 548 |
|
26478 | 549 |
val err_dup_components = |
25171 | 550 |
(case duplicates (op =) (map fst comps) of |
551 |
[] => [] |
|
552 |
| dups => ["Duplicate state-space components " ^ commas dups]); |
|
553 |
||
554 |
fun prep_comp (n,T) env = |
|
27283 | 555 |
let val (T', env') = prep_typ ctxt T env handle ERROR msg => |
36149 | 556 |
cat_error msg ("The error(s) above occurred in component " ^ quote n) |
25171 | 557 |
in ((n,T'), env') end; |
558 |
||
559 |
val (comps',env') = fold_map prep_comp comps env; |
|
560 |
||
561 |
val err_extra_frees = |
|
562 |
(case subtract (op =) args (map fst env') of |
|
563 |
[] => [] |
|
564 |
| extras => ["Extra free type variable(s) " ^ commas extras]); |
|
565 |
||
566 |
val defaultS = Sign.defaultS thy; |
|
567 |
val args' = map (fn x => (x, AList.lookup (op =) env x |> the_default defaultS)) args; |
|
568 |
||
569 |
||
570 |
fun fst_eq ((x:string,_),(y,_)) = x = y; |
|
26478 | 571 |
fun snd_eq ((_,t:typ),(_,u)) = t = u; |
25171 | 572 |
|
32952 | 573 |
val raw_parent_comps = maps (parent_components thy) parents'; |
26478 | 574 |
fun check_type (n,T) = |
25171 | 575 |
(case distinct (snd_eq) (filter (curry fst_eq (n,T)) raw_parent_comps) of |
576 |
[] => [] |
|
577 |
| [_] => [] |
|
32432
64f30bdd3ba1
modernized messages -- eliminated ctyp/cterm operations;
wenzelm
parents:
32194
diff
changeset
|
578 |
| rs => ["Different types for component " ^ n ^": " ^ |
64f30bdd3ba1
modernized messages -- eliminated ctyp/cterm operations;
wenzelm
parents:
32194
diff
changeset
|
579 |
commas (map (Syntax.string_of_typ ctxt o snd) rs)]) |
26478 | 580 |
|
32952 | 581 |
val err_dup_types = maps check_type (duplicates fst_eq raw_parent_comps) |
25171 | 582 |
|
583 |
val parent_comps = distinct (fst_eq) raw_parent_comps; |
|
584 |
val all_comps = parent_comps @ comps'; |
|
585 |
val err_comp_in_parent = (case duplicates (op =) (map fst all_comps) of |
|
586 |
[] => [] |
|
587 |
| xs => ["Components already defined in parents: " ^ commas xs]); |
|
588 |
val errs = err_dup_args @ err_dup_components @ err_extra_frees @ |
|
589 |
err_dup_types @ err_comp_in_parent; |
|
26478 | 590 |
in if null errs |
25171 | 591 |
then thy |> statespace_definition state_space args' name parents' parent_comps comps' |
26478 | 592 |
else error (cat_lines errs) |
25171 | 593 |
end |
594 |
handle ERROR msg => cat_error msg ("Failed to define statespace " ^ quote name); |
|
26478 | 595 |
|
36149 | 596 |
val define_statespace = gen_define_statespace read_typ NONE; |
597 |
val define_statespace_i = gen_define_statespace cert_typ; |
|
26478 | 598 |
|
25171 | 599 |
|
600 |
(*** parse/print - translations ***) |
|
601 |
||
602 |
||
603 |
local |
|
26478 | 604 |
fun map_get_comp f ctxt (Free (name,_)) = |
605 |
(case (get_comp ctxt name) of |
|
606 |
SOME (T,_) => f T T dummyT |
|
25171 | 607 |
| NONE => (Syntax.free "arbitrary"(*; error "context not ready"*))) |
608 |
| map_get_comp _ _ _ = Syntax.free "arbitrary"; |
|
609 |
||
610 |
val get_comp_projection = map_get_comp project_free; |
|
611 |
val get_comp_injection = map_get_comp inject_free; |
|
612 |
||
613 |
fun name_of (Free (n,_)) = n; |
|
614 |
in |
|
615 |
||
26478 | 616 |
fun gen_lookup_tr ctxt s n = |
25171 | 617 |
(case get_comp (Context.Proof ctxt) n of |
26478 | 618 |
SOME (T,_) => |
25171 | 619 |
Syntax.const "StateFun.lookup"$Syntax.free (project_name T)$Syntax.free n$s |
26478 | 620 |
| NONE => |
25171 | 621 |
if get_silent (Context.Proof ctxt) |
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32952
diff
changeset
|
622 |
then Syntax.const "StateFun.lookup" $ Syntax.const "undefined" $ Syntax.free n $ s |
25171 | 623 |
else raise TERM ("StateSpace.gen_lookup_tr: component " ^ n ^ " not defined",[])); |
624 |
||
625 |
fun lookup_tr ctxt [s,Free (n,_)] = gen_lookup_tr ctxt s n; |
|
626 |
fun lookup_swap_tr ctxt [Free (n,_),s] = gen_lookup_tr ctxt s n; |
|
627 |
||
628 |
fun lookup_tr' ctxt [_$Free (prj,_),n as (_$Free (name,_)),s] = |
|
629 |
( case get_comp (Context.Proof ctxt) name of |
|
630 |
SOME (T,_) => if prj=project_name T then |
|
26478 | 631 |
Syntax.const "_statespace_lookup" $ s $ n |
25171 | 632 |
else raise Match |
633 |
| NONE => raise Match) |
|
634 |
| lookup_tr' _ ts = raise Match; |
|
635 |
||
26478 | 636 |
fun gen_update_tr id ctxt n v s = |
25171 | 637 |
let |
638 |
fun pname T = if id then "Fun.id" else project_name T |
|
639 |
fun iname T = if id then "Fun.id" else inject_name T |
|
640 |
in |
|
641 |
(case get_comp (Context.Proof ctxt) n of |
|
642 |
SOME (T,_) => Syntax.const "StateFun.update"$ |
|
643 |
Syntax.free (pname T)$Syntax.free (iname T)$ |
|
644 |
Syntax.free n$(Syntax.const KN $ v)$s |
|
26478 | 645 |
| NONE => |
646 |
if get_silent (Context.Proof ctxt) |
|
25171 | 647 |
then Syntax.const "StateFun.update"$ |
30249 | 648 |
Syntax.const "undefined" $ Syntax.const "undefined" $ |
649 |
Syntax.free n $ (Syntax.const KN $ v) $ s |
|
25171 | 650 |
else raise TERM ("StateSpace.gen_update_tr: component " ^ n ^ " not defined",[])) |
651 |
end; |
|
652 |
||
653 |
fun update_tr ctxt [s,Free (n,_),v] = gen_update_tr false ctxt n v s; |
|
654 |
||
655 |
fun update_tr' ctxt [_$Free (prj,_),_$Free (inj,_),n as (_$Free (name,_)),(Const (k,_)$v),s] = |
|
30364
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30346
diff
changeset
|
656 |
if Long_Name.base_name k = Long_Name.base_name KN then |
25171 | 657 |
(case get_comp (Context.Proof ctxt) name of |
658 |
SOME (T,_) => if inj=inject_name T andalso prj=project_name T then |
|
26478 | 659 |
Syntax.const "_statespace_update" $ s $ n $ v |
25171 | 660 |
else raise Match |
661 |
| NONE => raise Match) |
|
662 |
else raise Match |
|
663 |
| update_tr' _ _ = raise Match; |
|
664 |
||
665 |
end; |
|
666 |
||
667 |
||
668 |
(*** outer syntax *) |
|
669 |
||
670 |
local structure P = OuterParse and K = OuterKeyword in |
|
671 |
||
672 |
val type_insts = |
|
673 |
P.typ >> single || |
|
26478 | 674 |
P.$$$ "(" |-- P.!!! (P.list1 P.typ --| P.$$$ ")") |
25171 | 675 |
|
676 |
val comp = P.name -- (P.$$$ "::" |-- P.!!! P.typ); |
|
677 |
fun plus1_unless test scan = |
|
25999 | 678 |
scan ::: Scan.repeat (P.$$$ "+" |-- Scan.unless test (P.!!! scan)); |
25171 | 679 |
|
680 |
val mapsto = P.$$$ "="; |
|
681 |
val rename = P.name -- (mapsto |-- P.name); |
|
682 |
val renames = Scan.optional (P.$$$ "[" |-- P.!!! (P.list1 rename --| P.$$$ "]")) []; |
|
683 |
||
684 |
||
685 |
val parent = ((type_insts -- P.xname) || (P.xname >> pair [])) -- renames |
|
686 |
>> (fn ((insts,name),renames) => (insts,name,renames)) |
|
687 |
||
688 |
||
689 |
val statespace_decl = |
|
690 |
P.type_args -- P.name -- |
|
26478 | 691 |
(P.$$$ "=" |-- |
25171 | 692 |
((Scan.repeat1 comp >> pair []) || |
693 |
(plus1_unless comp parent -- |
|
694 |
Scan.optional (P.$$$ "+" |-- P.!!! (Scan.repeat1 comp)) []))) |
|
695 |
||
696 |
val statespace_command = |
|
697 |
OuterSyntax.command "statespace" "define state space" K.thy_decl |
|
26478 | 698 |
(statespace_decl >> (fn ((args,name),(parents,comps)) => |
25171 | 699 |
Toplevel.theory (define_statespace args name parents comps))) |
700 |
||
701 |
end; |
|
702 |
||
32651 | 703 |
end; |