src/HOLCF/domain/syntax.ML
author kleing
Mon Jun 21 10:25:57 2004 +0200 (2004-06-21)
changeset 14981 e73f8140af78
parent 12030 46d57d0290a2
child 15570 8d8c70b41bab
permissions -rw-r--r--
Merged in license change from Isabelle2004
     1 (*  Title:      HOLCF/domain/syntax.ML
     2     ID:         $Id$
     3     Author:     David von Oheimb
     4 
     5 Syntax generator for domain section.
     6 *)
     7 
     8 structure Domain_Syntax = struct 
     9 
    10 local 
    11 
    12 open Domain_Library;
    13 infixr 5 -->; infixr 6 ->>;
    14 fun calc_syntax dtypeprod ((dname, typevars), 
    15 	(cons': (string * mixfix * (bool*string*typ) list) list)) =
    16 let
    17 (* ----- constants concerning the isomorphism ------------------------------- *)
    18 
    19 local
    20   fun opt_lazy (lazy,_,t) = if lazy then mk_uT t else t
    21   fun prod     (_,_,args) = if args = [] then oneT
    22 			    else foldr' mk_sprodT (map opt_lazy args);
    23   fun freetvar s = let val tvar = mk_TFree s in
    24 		   if tvar mem typevars then freetvar ("t"^s) else tvar end;
    25   fun when_type (_   ,_,args) = foldr (op ->>) (map third args,freetvar "t");
    26 in
    27   val dtype  = Type(dname,typevars);
    28   val dtype2 = foldr' mk_ssumT (map prod cons');
    29   val dnam = Sign.base_name dname;
    30   val const_rep  = (dnam^"_rep" ,              dtype  ->> dtype2, NoSyn);
    31   val const_abs  = (dnam^"_abs" ,              dtype2 ->> dtype , NoSyn);
    32   val const_when = (dnam^"_when",foldr (op ->>) ((map when_type cons'),
    33 					        dtype ->> freetvar "t"), NoSyn);
    34   val const_copy = (dnam^"_copy", dtypeprod ->> dtype  ->> dtype , NoSyn);
    35 end;
    36 
    37 (* ----- constants concerning constructors, discriminators, and selectors --- *)
    38 
    39 local
    40   val escape = let
    41 	fun esc (c::cs) = if c mem ["'","_","(",")","/"] then "'"::c::esc cs
    42 							 else      c::esc cs
    43 	|   esc []      = []
    44 	in implode o esc o Symbol.explode end;
    45   fun con (name,s,args) = (name,foldr (op ->>) (map third args,dtype),s);
    46   fun dis (con ,s,_   ) = (dis_name_ con, dtype->>trT,
    47 			   Mixfix(escape ("is_" ^ con), [], Syntax.max_pri));
    48 			(* stricly speaking, these constants have one argument,
    49 			   but the mixfix (without arguments) is introduced only
    50 			   to generate parse rules for non-alphanumeric names*)
    51   fun sel (_   ,_,args) = map (fn(_,sel,typ)=>(sel,dtype ->> typ,NoSyn))args;
    52 in
    53   val consts_con = map con cons';
    54   val consts_dis = map dis cons';
    55   val consts_sel = flat(map sel cons');
    56 end;
    57 
    58 (* ----- constants concerning induction ------------------------------------- *)
    59 
    60   val const_take   = (dnam^"_take"  , HOLogic.natT-->dtype->>dtype, NoSyn);
    61   val const_finite = (dnam^"_finite", dtype-->HOLogic.boolT       , NoSyn);
    62 
    63 (* ----- case translation --------------------------------------------------- *)
    64 
    65 local open Syntax in
    66   val case_trans = let 
    67 	fun c_ast con mx = Constant (const_name con mx);
    68 	fun expvar n     = Variable ("e"^(string_of_int n));
    69 	fun argvar n m _ = Variable ("a"^(string_of_int n)^"_"^
    70 					 (string_of_int m));
    71 	fun app s (l,r)   = mk_appl (Constant s) [l,r];
    72 	fun case1 n (con,mx,args) = mk_appl (Constant "_case1")
    73 		 [foldl (app "Rep_CFun") (c_ast con mx, (mapn (argvar n) 1 args)),
    74 		  expvar n];
    75 	fun arg1 n (con,_,args) = if args = [] then expvar n 
    76 				  else mk_appl (Constant "LAM ") 
    77 		 [foldr' (app "_idts") (mapn (argvar n) 1 args) , expvar n];
    78   in
    79     ParsePrintRule
    80       (mk_appl (Constant "_case_syntax") [Variable "x", foldr'
    81 				(fn (c,cs) => mk_appl (Constant"_case2") [c,cs])
    82 				 (mapn case1 1 cons')],
    83        mk_appl (Constant "Rep_CFun") [foldl 
    84 				(fn (w,a ) => mk_appl (Constant"Rep_CFun" ) [w,a ])
    85 				 (Constant (dnam^"_when"),mapn arg1 1 cons'),
    86 				 Variable "x"])
    87   end;
    88 end;
    89 
    90 in ([const_rep, const_abs, const_when, const_copy] @ 
    91      consts_con @ consts_dis @ consts_sel @
    92     [const_take, const_finite],
    93     [case_trans])
    94 end; (* let *)
    95 
    96 (* ----- putting all the syntax stuff together ------------------------------ *)
    97 
    98 in (* local *)
    99 
   100 fun add_syntax (comp_dnam,eqs': ((string * typ list) *
   101 	(string * mixfix * (bool*string*typ) list) list) list) thy'' =
   102 let
   103   val dtypes  = map (Type o fst) eqs';
   104   val boolT   = HOLogic.boolT;
   105   val funprod = foldr' mk_prodT (map (fn tp => tp ->> tp          ) dtypes);
   106   val relprod = foldr' mk_prodT (map (fn tp => tp --> tp --> boolT) dtypes);
   107   val const_copy   = (comp_dnam^"_copy"  ,funprod ->> funprod, NoSyn);
   108   val const_bisim  = (comp_dnam^"_bisim" ,relprod --> boolT  , NoSyn);
   109   val ctt           = map (calc_syntax funprod) eqs';
   110 in thy'' |> ContConsts.add_consts_i (flat (map fst ctt) @ 
   111 				    (if length eqs'>1 then [const_copy] else[])@
   112 				    [const_bisim])
   113 	 |> Theory.add_trrules_i (flat(map snd ctt))
   114 end; (* let *)
   115 
   116 end; (* local *)
   117 end; (* struct *)