author | huffman |
Tue, 02 Mar 2010 04:31:50 -0800 | |
changeset 35497 | 979706bd5c16 |
parent 35465 | 064bb6e9ace0 |
child 35519 | abf45a91d24d |
permissions | -rw-r--r-- |
32126 | 1 |
(* Title: HOLCF/Tools/Domain/domain_library.ML |
23152 | 2 |
Author: David von Oheimb |
3 |
||
4 |
Library for domain command. |
|
5 |
*) |
|
6 |
||
7 |
||
31006 | 8 |
(* infix syntax *) |
9 |
||
10 |
infixr 5 -->; |
|
11 |
infixr 6 ->>; |
|
12 |
infixr 0 ===>; |
|
13 |
infixr 0 ==>; |
|
14 |
infix 0 ==; |
|
15 |
infix 1 ===; |
|
16 |
infix 1 ~=; |
|
17 |
||
18 |
infix 9 ` ; |
|
19 |
infix 9 `% ; |
|
20 |
infix 9 `%%; |
|
21 |
||
22 |
||
23152 | 23 |
(* ----- specific support for domain ---------------------------------------- *) |
24 |
||
31006 | 25 |
signature DOMAIN_LIBRARY = |
26 |
sig |
|
35465 | 27 |
val first : 'a * 'b * 'c -> 'a |
28 |
val second : 'a * 'b * 'c -> 'b |
|
29 |
val third : 'a * 'b * 'c -> 'c |
|
30 |
val upd_second : ('b -> 'd) -> 'a * 'b * 'c -> 'a * 'd * 'c |
|
31 |
val upd_third : ('c -> 'd) -> 'a * 'b * 'c -> 'a * 'b * 'd |
|
32 |
val mapn : (int -> 'a -> 'b) -> int -> 'a list -> 'b list |
|
33 |
val atomize : Proof.context -> thm -> thm list |
|
34 |
||
31006 | 35 |
val Imposs : string -> 'a; |
31162 | 36 |
val cpo_type : theory -> typ -> bool; |
31006 | 37 |
val pcpo_type : theory -> typ -> bool; |
38 |
val string_of_typ : theory -> typ -> string; |
|
39 |
||
40 |
(* Creating HOLCF types *) |
|
41 |
val ->> : typ * typ -> typ; |
|
42 |
val mk_ssumT : typ * typ -> typ; |
|
43 |
val mk_sprodT : typ * typ -> typ; |
|
44 |
val mk_uT : typ -> typ; |
|
45 |
val oneT : typ; |
|
46 |
val mk_maybeT : typ -> typ; |
|
47 |
val mk_ctupleT : typ list -> typ; |
|
48 |
val mk_TFree : string -> typ; |
|
49 |
val pcpoS : sort; |
|
50 |
||
51 |
(* Creating HOLCF terms *) |
|
52 |
val %: : string -> term; |
|
53 |
val %%: : string -> term; |
|
54 |
val ` : term * term -> term; |
|
55 |
val `% : term * string -> term; |
|
56 |
val /\ : string -> term -> term; |
|
57 |
val UU : term; |
|
31231 | 58 |
val ID : term; |
59 |
val oo : term * term -> term; |
|
31006 | 60 |
val mk_ctuple : term list -> term; |
61 |
val mk_fix : term -> term; |
|
62 |
val mk_iterate : term * term * term -> term; |
|
63 |
val mk_fail : term; |
|
64 |
val mk_return : term -> term; |
|
65 |
val list_ccomb : term * term list -> term; |
|
66 |
val con_app2 : string -> ('a -> term) -> 'a list -> term; |
|
35497 | 67 |
val prj : ('a -> 'b -> 'a) -> ('a -> 'b -> 'a) -> 'a -> 'b list -> int -> 'a |
31006 | 68 |
val proj : term -> 'a list -> int -> term; |
69 |
val mk_ctuple_pat : term list -> term; |
|
70 |
val mk_branch : term -> term; |
|
71 |
||
72 |
(* Creating propositions *) |
|
73 |
val mk_conj : term * term -> term; |
|
74 |
val mk_disj : term * term -> term; |
|
75 |
val mk_imp : term * term -> term; |
|
76 |
val mk_lam : string * term -> term; |
|
77 |
val mk_all : string * term -> term; |
|
78 |
val mk_ex : string * term -> term; |
|
79 |
val mk_constrainall : string * typ * term -> term; |
|
80 |
val === : term * term -> term; |
|
81 |
val strict : term -> term; |
|
82 |
val defined : term -> term; |
|
83 |
val mk_adm : term -> term; |
|
84 |
val lift : ('a -> term) -> 'a list * term -> term; |
|
85 |
val lift_defined : ('a -> term) -> 'a list * term -> term; |
|
86 |
||
87 |
(* Creating meta-propositions *) |
|
88 |
val mk_trp : term -> term; (* HOLogic.mk_Trueprop *) |
|
89 |
val == : term * term -> term; |
|
90 |
val ===> : term * term -> term; |
|
91 |
val ==> : term * term -> term; |
|
92 |
val mk_All : string * term -> term; |
|
93 |
||
31288 | 94 |
(* Domain specifications *) |
95 |
eqtype arg; |
|
35288 | 96 |
type cons = string * mixfix * arg list; |
31006 | 97 |
type eq = (string * typ list) * cons list; |
31738
7b9b9ba532ca
discontinued ancient tradition to suffix certain ML module names with "_package"
haftmann
parents:
31288
diff
changeset
|
98 |
val mk_arg : (bool * Datatype.dtyp) * string option * string -> arg; |
31006 | 99 |
val is_lazy : arg -> bool; |
100 |
val rec_of : arg -> int; |
|
31738
7b9b9ba532ca
discontinued ancient tradition to suffix certain ML module names with "_package"
haftmann
parents:
31288
diff
changeset
|
101 |
val dtyp_of : arg -> Datatype.dtyp; |
31006 | 102 |
val sel_of : arg -> string option; |
103 |
val vname : arg -> string; |
|
104 |
val upd_vname : (string -> string) -> arg -> arg; |
|
105 |
val is_rec : arg -> bool; |
|
106 |
val is_nonlazy_rec : arg -> bool; |
|
107 |
val nonlazy : arg list -> string list; |
|
108 |
val nonlazy_rec : arg list -> string list; |
|
109 |
val %# : arg -> term; |
|
110 |
val /\# : arg * term -> term; |
|
111 |
val when_body : cons list -> (int * int -> term) -> term; |
|
112 |
val when_funs : 'a list -> string list; |
|
113 |
val bound_arg : ''a list -> ''a -> term; (* ''a = arg or string *) |
|
114 |
val idx_name : 'a list -> string -> int -> string; |
|
115 |
val app_rec_arg : (int -> term) -> arg -> term; |
|
31228 | 116 |
val con_app : string -> arg list -> term; |
31738
7b9b9ba532ca
discontinued ancient tradition to suffix certain ML module names with "_package"
haftmann
parents:
31288
diff
changeset
|
117 |
val dtyp_of_eq : eq -> Datatype.dtyp; |
31228 | 118 |
|
31006 | 119 |
|
120 |
(* Name mangling *) |
|
121 |
val strip_esc : string -> string; |
|
122 |
val extern_name : string -> string; |
|
123 |
val dis_name : string -> string; |
|
124 |
val mat_name : string -> string; |
|
125 |
val pat_name : string -> string; |
|
126 |
end; |
|
127 |
||
31023 | 128 |
structure Domain_Library :> DOMAIN_LIBRARY = |
31006 | 129 |
struct |
23152 | 130 |
|
35465 | 131 |
fun first (x,_,_) = x; |
132 |
fun second (_,x,_) = x; |
|
133 |
fun third (_,_,x) = x; |
|
134 |
||
135 |
fun upd_first f (x,y,z) = (f x, y, z); |
|
136 |
fun upd_second f (x,y,z) = ( x, f y, z); |
|
137 |
fun upd_third f (x,y,z) = ( x, y, f z); |
|
138 |
||
139 |
fun mapn f n [] = [] |
|
140 |
| mapn f n (x::xs) = (f n x) :: mapn f (n+1) xs; |
|
141 |
||
142 |
fun foldr'' f (l,f2) = |
|
143 |
let fun itr [] = raise Fail "foldr''" |
|
144 |
| itr [a] = f2 a |
|
145 |
| itr (a::l) = f(a, itr l) |
|
146 |
in itr l end; |
|
147 |
||
148 |
fun atomize ctxt thm = |
|
149 |
let |
|
150 |
val r_inst = read_instantiate ctxt; |
|
151 |
fun at thm = |
|
152 |
case concl_of thm of |
|
153 |
_$(Const("op &",_)$_$_) => at(thm RS conjunct1)@at(thm RS conjunct2) |
|
154 |
| _$(Const("All" ,_)$Abs(s,_,_))=> at(thm RS (r_inst [(("x", 0), "?" ^ s)] spec)) |
|
155 |
| _ => [thm]; |
|
156 |
in map zero_var_indexes (at thm) end; |
|
157 |
||
23152 | 158 |
exception Impossible of string; |
159 |
fun Imposs msg = raise Impossible ("Domain:"^msg); |
|
160 |
||
161 |
(* ----- name handling ----- *) |
|
162 |
||
31288 | 163 |
val strip_esc = |
164 |
let fun strip ("'" :: c :: cs) = c :: strip cs |
|
165 |
| strip ["'"] = [] |
|
166 |
| strip (c :: cs) = c :: strip cs |
|
167 |
| strip [] = []; |
|
168 |
in implode o strip o Symbol.explode end; |
|
23152 | 169 |
|
31288 | 170 |
fun extern_name con = |
171 |
case Symbol.explode con of |
|
172 |
("o"::"p"::" "::rest) => implode rest |
|
173 |
| _ => con; |
|
23152 | 174 |
fun dis_name con = "is_"^ (extern_name con); |
175 |
fun dis_name_ con = "is_"^ (strip_esc con); |
|
176 |
fun mat_name con = "match_"^ (extern_name con); |
|
177 |
fun mat_name_ con = "match_"^ (strip_esc con); |
|
178 |
fun pat_name con = (extern_name con) ^ "_pat"; |
|
179 |
fun pat_name_ con = (strip_esc con) ^ "_pat"; |
|
180 |
||
31162 | 181 |
fun cpo_type sg t = Sign.of_sort sg (Sign.certify_typ sg t, @{sort cpo}); |
30910 | 182 |
fun pcpo_type sg t = Sign.of_sort sg (Sign.certify_typ sg t, @{sort pcpo}); |
26939
1035c89b4c02
moved global pretty/string_of functions from Sign to Syntax;
wenzelm
parents:
26012
diff
changeset
|
183 |
fun string_of_typ sg = Syntax.string_of_typ_global sg o Sign.certify_typ sg; |
23152 | 184 |
|
185 |
(* ----- constructor list handling ----- *) |
|
186 |
||
31006 | 187 |
type arg = |
31738
7b9b9ba532ca
discontinued ancient tradition to suffix certain ML module names with "_package"
haftmann
parents:
31288
diff
changeset
|
188 |
(bool * Datatype.dtyp) * (* (lazy, recursive element) *) |
31288 | 189 |
string option * (* selector name *) |
190 |
string; (* argument name *) |
|
31006 | 191 |
|
192 |
type cons = |
|
31288 | 193 |
string * (* operator name of constr *) |
35288 | 194 |
mixfix * (* mixfix syntax of constructor *) |
31288 | 195 |
arg list; (* argument list *) |
31006 | 196 |
|
197 |
type eq = |
|
31288 | 198 |
(string * (* name of abstracted type *) |
199 |
typ list) * (* arguments of abstracted type *) |
|
200 |
cons list; (* represented type, as a constructor list *) |
|
23152 | 201 |
|
31228 | 202 |
val mk_arg = I; |
31229 | 203 |
|
204 |
fun rec_of ((_,dtyp),_,_) = |
|
33971 | 205 |
case dtyp of Datatype_Aux.DtRec i => i | _ => ~1; |
31229 | 206 |
(* FIXME: what about indirect recursion? *) |
207 |
||
208 |
fun is_lazy arg = fst (first arg); |
|
31231 | 209 |
fun dtyp_of arg = snd (first arg); |
23152 | 210 |
val sel_of = second; |
211 |
val vname = third; |
|
212 |
val upd_vname = upd_third; |
|
213 |
fun is_rec arg = rec_of arg >=0; |
|
214 |
fun is_nonlazy_rec arg = is_rec arg andalso not (is_lazy arg); |
|
33317 | 215 |
fun nonlazy args = map vname (filter_out is_lazy args); |
216 |
fun nonlazy_rec args = map vname (filter is_nonlazy_rec args); |
|
23152 | 217 |
|
31231 | 218 |
|
219 |
(* ----- combinators for making dtyps ----- *) |
|
220 |
||
33971 | 221 |
fun mk_uD T = Datatype_Aux.DtType(@{type_name "u"}, [T]); |
222 |
fun mk_sprodD (T, U) = Datatype_Aux.DtType(@{type_name "**"}, [T, U]); |
|
223 |
fun mk_ssumD (T, U) = Datatype_Aux.DtType(@{type_name "++"}, [T, U]); |
|
224 |
fun mk_liftD T = Datatype_Aux.DtType(@{type_name "lift"}, [T]); |
|
225 |
val unitD = Datatype_Aux.DtType(@{type_name "unit"}, []); |
|
226 |
val boolD = Datatype_Aux.DtType(@{type_name "bool"}, []); |
|
31231 | 227 |
val oneD = mk_liftD unitD; |
228 |
val trD = mk_liftD boolD; |
|
229 |
fun big_sprodD ds = case ds of [] => oneD | _ => foldr1 mk_sprodD ds; |
|
230 |
fun big_ssumD ds = case ds of [] => unitD | _ => foldr1 mk_ssumD ds; |
|
231 |
||
232 |
fun dtyp_of_arg ((lazy, D), _, _) = if lazy then mk_uD D else D; |
|
35288 | 233 |
fun dtyp_of_cons (_, _, args) = big_sprodD (map dtyp_of_arg args); |
31231 | 234 |
fun dtyp_of_eq (_, cons) = big_ssumD (map dtyp_of_cons cons); |
235 |
||
236 |
||
23152 | 237 |
(* ----- support for type and mixfix expressions ----- *) |
238 |
||
30910 | 239 |
fun mk_uT T = Type(@{type_name "u"}, [T]); |
240 |
fun mk_cfunT (T, U) = Type(@{type_name "->"}, [T, U]); |
|
241 |
fun mk_sprodT (T, U) = Type(@{type_name "**"}, [T, U]); |
|
242 |
fun mk_ssumT (T, U) = Type(@{type_name "++"}, [T, U]); |
|
243 |
val oneT = @{typ one}; |
|
244 |
||
245 |
val op ->> = mk_cfunT; |
|
246 |
||
247 |
fun mk_TFree s = TFree ("'" ^ s, @{sort pcpo}); |
|
23152 | 248 |
|
249 |
(* ----- support for term expressions ----- *) |
|
250 |
||
251 |
fun %: s = Free(s,dummyT); |
|
252 |
fun %# arg = %:(vname arg); |
|
253 |
fun %%: s = Const(s,dummyT); |
|
254 |
||
255 |
local open HOLogic in |
|
256 |
val mk_trp = mk_Trueprop; |
|
257 |
fun mk_conj (S,T) = conj $ S $ T; |
|
258 |
fun mk_disj (S,T) = disj $ S $ T; |
|
259 |
fun mk_imp (S,T) = imp $ S $ T; |
|
260 |
fun mk_lam (x,T) = Abs(x,dummyT,T); |
|
261 |
fun mk_all (x,P) = HOLogic.mk_all (x,dummyT,P); |
|
262 |
fun mk_ex (x,P) = mk_exists (x,dummyT,P); |
|
24680 | 263 |
fun mk_constrainall (x,typ,P) = %%:"All" $ (TypeInfer.constrain (typ --> boolT) (mk_lam(x,P))); |
23152 | 264 |
end |
265 |
||
266 |
fun mk_All (x,P) = %%:"all" $ mk_lam(x,P); (* meta universal quantification *) |
|
267 |
||
268 |
infixr 0 ===>; fun S ===> T = %%:"==>" $ S $ T; |
|
269 |
infixr 0 ==>; fun S ==> T = mk_trp S ===> mk_trp T; |
|
270 |
infix 0 ==; fun S == T = %%:"==" $ S $ T; |
|
271 |
infix 1 ===; fun S === T = %%:"op =" $ S $ T; |
|
272 |
infix 1 ~=; fun S ~= T = HOLogic.mk_not (S === T); |
|
273 |
||
30595
c87a3350f5a9
proper spacing before ML antiquotations -- note that @ may be part of symbolic ML identifiers;
wenzelm
parents:
30190
diff
changeset
|
274 |
infix 9 ` ; fun f ` x = %%: @{const_name Rep_CFun} $ f $ x; |
23152 | 275 |
infix 9 `% ; fun f`% s = f` %: s; |
276 |
infix 9 `%%; fun f`%%s = f` %%:s; |
|
26012 | 277 |
|
30595
c87a3350f5a9
proper spacing before ML antiquotations -- note that @ may be part of symbolic ML identifiers;
wenzelm
parents:
30190
diff
changeset
|
278 |
fun mk_adm t = %%: @{const_name adm} $ t; |
c87a3350f5a9
proper spacing before ML antiquotations -- note that @ may be part of symbolic ML identifiers;
wenzelm
parents:
30190
diff
changeset
|
279 |
val ID = %%: @{const_name ID}; |
c87a3350f5a9
proper spacing before ML antiquotations -- note that @ may be part of symbolic ML identifiers;
wenzelm
parents:
30190
diff
changeset
|
280 |
fun mk_strictify t = %%: @{const_name strictify}`t; |
c87a3350f5a9
proper spacing before ML antiquotations -- note that @ may be part of symbolic ML identifiers;
wenzelm
parents:
30190
diff
changeset
|
281 |
fun mk_ssplit t = %%: @{const_name ssplit}`t; |
c87a3350f5a9
proper spacing before ML antiquotations -- note that @ may be part of symbolic ML identifiers;
wenzelm
parents:
30190
diff
changeset
|
282 |
fun mk_sscase (x, y) = %%: @{const_name sscase}`x`y; |
c87a3350f5a9
proper spacing before ML antiquotations -- note that @ may be part of symbolic ML identifiers;
wenzelm
parents:
30190
diff
changeset
|
283 |
fun mk_fup (t,u) = %%: @{const_name fup} ` t ` u; |
26012 | 284 |
val ONE = @{term ONE}; |
30595
c87a3350f5a9
proper spacing before ML antiquotations -- note that @ may be part of symbolic ML identifiers;
wenzelm
parents:
30190
diff
changeset
|
285 |
fun mk_iterate (n,f,z) = %%: @{const_name iterate} $ n ` f ` z; |
c87a3350f5a9
proper spacing before ML antiquotations -- note that @ may be part of symbolic ML identifiers;
wenzelm
parents:
30190
diff
changeset
|
286 |
fun mk_fix t = %%: @{const_name fix}`t; |
c87a3350f5a9
proper spacing before ML antiquotations -- note that @ may be part of symbolic ML identifiers;
wenzelm
parents:
30190
diff
changeset
|
287 |
fun mk_return t = %%: @{const_name Fixrec.return}`t; |
c87a3350f5a9
proper spacing before ML antiquotations -- note that @ may be part of symbolic ML identifiers;
wenzelm
parents:
30190
diff
changeset
|
288 |
val mk_fail = %%: @{const_name Fixrec.fail}; |
26012 | 289 |
|
30595
c87a3350f5a9
proper spacing before ML antiquotations -- note that @ may be part of symbolic ML identifiers;
wenzelm
parents:
30190
diff
changeset
|
290 |
fun mk_branch t = %%: @{const_name Fixrec.branch} $ t; |
26012 | 291 |
|
292 |
val pcpoS = @{sort pcpo}; |
|
293 |
||
23152 | 294 |
val list_ccomb = Library.foldl (op `); (* continuous version of list_comb *) |
295 |
fun con_app2 con f args = list_ccomb(%%:con,map f args); |
|
296 |
fun con_app con = con_app2 con %#; |
|
297 |
fun if_rec arg f y = if is_rec arg then f (rec_of arg) else y; |
|
298 |
fun app_rec_arg p arg = if_rec arg (fn n => fn x => (p n)`x) I (%# arg); |
|
299 |
fun prj _ _ x ( _::[]) _ = x |
|
31288 | 300 |
| prj f1 _ x (_::y::ys) 0 = f1 x y |
301 |
| prj f1 f2 x (y:: ys) j = prj f1 f2 (f2 x y) ys (j-1); |
|
23152 | 302 |
fun proj x = prj (fn S => K(%%:"fst" $S)) (fn S => K(%%:"snd" $S)) x; |
303 |
fun lift tfn = Library.foldr (fn (x,t)=> (mk_trp(tfn x) ===> t)); |
|
304 |
||
30595
c87a3350f5a9
proper spacing before ML antiquotations -- note that @ may be part of symbolic ML identifiers;
wenzelm
parents:
30190
diff
changeset
|
305 |
fun /\ v T = %%: @{const_name Abs_CFun} $ mk_lam(v,T); |
23152 | 306 |
fun /\# (arg,T) = /\ (vname arg) T; |
30595
c87a3350f5a9
proper spacing before ML antiquotations -- note that @ may be part of symbolic ML identifiers;
wenzelm
parents:
30190
diff
changeset
|
307 |
infixr 9 oo; fun S oo T = %%: @{const_name cfcomp}`S`T; |
c87a3350f5a9
proper spacing before ML antiquotations -- note that @ may be part of symbolic ML identifiers;
wenzelm
parents:
30190
diff
changeset
|
308 |
val UU = %%: @{const_name UU}; |
23152 | 309 |
fun strict f = f`UU === UU; |
310 |
fun defined t = t ~= UU; |
|
33396 | 311 |
fun cpair (t,u) = %%: @{const_name Pair} $ t $ u; |
30595
c87a3350f5a9
proper spacing before ML antiquotations -- note that @ may be part of symbolic ML identifiers;
wenzelm
parents:
30190
diff
changeset
|
312 |
fun spair (t,u) = %%: @{const_name spair}`t`u; |
23152 | 313 |
fun mk_ctuple [] = HOLogic.unit (* used in match_defs *) |
31288 | 314 |
| mk_ctuple ts = foldr1 cpair ts; |
23152 | 315 |
fun mk_ctupleT [] = HOLogic.unitT (* used in match_defs *) |
31288 | 316 |
| mk_ctupleT Ts = foldr1 HOLogic.mk_prodT Ts; |
23152 | 317 |
fun mk_maybeT T = Type ("Fixrec.maybe",[T]); |
30595
c87a3350f5a9
proper spacing before ML antiquotations -- note that @ may be part of symbolic ML identifiers;
wenzelm
parents:
30190
diff
changeset
|
318 |
fun cpair_pat (p1,p2) = %%: @{const_name cpair_pat} $ p1 $ p2; |
26012 | 319 |
val mk_ctuple_pat = foldr1 cpair_pat; |
23152 | 320 |
fun lift_defined f = lift (fn x => defined (f x)); |
31986 | 321 |
fun bound_arg vns v = Bound (length vns - find_index (fn v' => v' = v) vns - 1); |
23152 | 322 |
|
323 |
fun cont_eta_contract (Const("Cfun.Abs_CFun",TT) $ Abs(a,T,body)) = |
|
31288 | 324 |
(case cont_eta_contract body of |
325 |
body' as (Const("Cfun.Rep_CFun",Ta) $ f $ Bound 0) => |
|
326 |
if not (0 mem loose_bnos f) then incr_boundvars ~1 f |
|
327 |
else Const("Cfun.Abs_CFun",TT) $ Abs(a,T,body') |
|
328 |
| body' => Const("Cfun.Abs_CFun",TT) $ Abs(a,T,body')) |
|
329 |
| cont_eta_contract(f$t) = cont_eta_contract f $ cont_eta_contract t |
|
330 |
| cont_eta_contract t = t; |
|
23152 | 331 |
|
332 |
fun idx_name dnames s n = s^(if length dnames = 1 then "" else string_of_int n); |
|
333 |
fun when_funs cons = if length cons = 1 then ["f"] |
|
334 |
else mapn (fn n => K("f"^(string_of_int n))) 1 cons; |
|
31288 | 335 |
fun when_body cons funarg = |
336 |
let |
|
35288 | 337 |
fun one_fun n (_,_,[] ) = /\ "dummy" (funarg(1,n)) |
338 |
| one_fun n (_,_,args) = let |
|
31288 | 339 |
val l2 = length args; |
340 |
fun idxs m arg = (if is_lazy arg then (fn t => mk_fup (ID, t)) |
|
341 |
else I) (Bound(l2-m)); |
|
342 |
in cont_eta_contract |
|
343 |
(foldr'' |
|
344 |
(fn (a,t) => mk_ssplit (/\# (a,t))) |
|
345 |
(args, |
|
346 |
fn a=> /\#(a,(list_ccomb(funarg(l2,n),mapn idxs 1 args)))) |
|
347 |
) end; |
|
35288 | 348 |
in (if length cons = 1 andalso length(third(hd cons)) <= 1 |
31288 | 349 |
then mk_strictify else I) |
350 |
(foldr1 mk_sscase (mapn one_fun 1 cons)) end; |
|
351 |
||
23152 | 352 |
end; (* struct *) |