Ciao Preprocessor (integrated Alpha version)
| This is an alpha distribution, meant only for testing. Please do let us
| know at ciaopp-bugclip.dia.fi.upm.es any problems you may have.
{loaded in 3744.233 msec.}
{preprocessed for plai in 0.0 msec.}
{analyzed by plai using eterms with local-control off in 4.001 msec.}
{preprocessed for plai in 0.0 msec.}
{analyzed by plai using shfr with local-control off in 0.0 msec.}
{preprocessed for nfg in 0.0 msec.}
{analyzed by nfg in 0.0 msec.}
{analysis information stored in 4.0 msec.}
{preprocessed for ub bounds cost analysis in 0.0 msec.}
{ub bounds cost analysis performed in 28.001 msec.}
{ub bounds cost information stored in 0.0 msec.}
{preprocessed for lb bounds cost analysis in 0.0 msec.}
{lb bounds cost analysis performed in 12.001 msec.}
{lb bounds cost information stored in 0.0 msec.}
{written file /tmp/tmpuTv3HD/map_eterms_shfr_nfg_resources_co.pl}
:- module(_1,[map/2],[assertions,predefres(res_steps),nativeprops,basicmodes,regtypes]).
:- true pred p(_1,_2)
: ( gnd(_1), term(_2) )
=> ( rt2(_1), rt3(_2) ).
:- true pred p(_1,_2)
: ( mshare([[_2]]), ground([_1]) )
=> ground([_1,_2]).
:- true pred p(_1,_2)
: ( gnd(_1), term(_2) )
=> ( rt2(_1), rt3(_2) )
+ ( possibly_fails, not_covered ).
:- true pred p(_1,_2)
: ( gnd(_1), term(_2) )
=> ( rt2(_1), rt3(_2), size(lb,_1,size(_1)), size(lb,_2,1) )
+ cost(lb,steps,0).
:- true pred p(_1,_2)
: ( gnd(_1), term(_2) )
=> ( rt2(_1), rt3(_2), size(ub,_1,size(_1)), size(ub,_2,1) )
+ cost(ub,steps,1).
p(val_i,val_j).
:- entry map(A,B)
: ground(A).
:- true pred map(A,B)
: ( gnd(A), term(B) )
=> ( list(A,^(val_i)), list(B,^(val_j)) ).
:- true pred map(A,B)
: ( mshare([[B]]), ground([A]) )
=> ground([A,B]).
:- true pred map(A,B)
: ( gnd(A), term(B) )
=> ( list(A,^(val_i)), list(B,^(val_j)) )
+ ( possibly_fails, not_covered ).
:- true pred map(A,B)
: ( gnd(A), term(B) )
=> ( list(A,^(val_i)), list(B,^(val_j)), size(lb,A,length(A)), size(lb,B,length(A)) )
+ cost(lb,steps,0).
:- true pred map(A,B)
: ( gnd(A), term(B) )
=> ( list(A,^(val_i)), list(B,^(val_j)), size(ub,A,length(A)), size(ub,B,length(A)) )
+ cost(ub,steps,2*length(A)+1).
map([X|Xs],[Y|Ys]) :-
p(X,Y),
map(Xs,Ys).
map([],[]).
:- regtype rt2/1.
rt2(val_i).
:- regtype rt3/1.
rt3(val_j).