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