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