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