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