definition: |
w12Tuple :: (Data a, Data b, Data c, Data d, Data e, Data f, Data g, Data h, Data i, Data j, Data k, Data l) => WuiSpec a -> WuiSpec b -> WuiSpec c -> WuiSpec d -> WuiSpec e -> WuiSpec f -> WuiSpec g -> WuiSpec h -> WuiSpec i -> WuiSpec j -> WuiSpec k -> WuiSpec l -> WuiSpec (a,b,c,d,e,f,g,h,i,j,k,l) --w12Tuple = wCons12 (\a b c d e f g h i j k l -> (a,b,c,d,e,f,g,h,i,j,k,l)) w12Tuple wa wb wc wd we wf wg wh wi wj wk wl = transformWSpec (\ ((a,b,c,d,e,f),(g,h,i,j,k,l)) -> (a,b,c,d,e,f,g,h,i,j,k,l), \ (a,b,c,d,e,f,g,h,i,j,k,l) -> ((a,b,c,d,e,f),(g,h,i,j,k,l))) (wJoinTuple (w6Tuple wa wb wc wd we wf) (w6Tuple wg wh wi wj wk wl)) |
demand: |
arguments 13 14 15 16 17 18 19 20 21 22 23 24 |
deterministic: |
deterministic operation |
documentation: |
--- WUI combinator for tuples of arity 12. |
failfree: |
<FAILING> |
indeterministic: |
referentially transparent operation |
infix: |
no fixity defined |
iotype: |
{(_,_,_,_,_,_,_,_,_,_,_,_,_,_,_,_,_,_,_,_,_,_,_,_) |-> {WuiSpec}} |
name: |
w12Tuple |
precedence: |
no precedence defined |
result-values: |
{WuiSpec} |
signature: |
(Prelude.Data a, Prelude.Data b, Prelude.Data c, Prelude.Data d, Prelude.Data e, Prelude.Data f, Prelude.Data g, Prelude.Data h, Prelude.Data i, Prelude.Data j, Prelude.Data k, Prelude.Data l) => WuiSpec a -> WuiSpec b -> WuiSpec c -> WuiSpec d -> WuiSpec e -> WuiSpec f -> WuiSpec g -> WuiSpec h -> WuiSpec i -> WuiSpec j -> WuiSpec k -> WuiSpec l -> WuiSpec (a, b, c, d, e, f, g, h, i, j, k, l) |
solution-complete: |
operation might suspend on free variables |
terminating: |
yes |
totally-defined: |
possibly non-reducible on same data term |