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