% ================================================================= :- pred constr(bool). :- mode constr(in). :- ignore constr/1. % ================================================================= % Program :- pred quicksort(list(int),list(int)). :- mode quicksort(in,out). quicksort([], []). quicksort([X | Xs], ResL) :- partition(X, Xs, Smalls, Bigs), % partition of the tail Xs quicksort(Smalls, Ls), % with respect to the pivot X. quicksort(Bigs, Bs), % X is NOT in Xs. cons(X,Bs,XBs), append(Ls, XBs, ResL). :- pred partition(int,list(int),list(int),list(int)). :- mode partition(in,in,out,out). partition(X, [], [], []). partition(X, [Y | Ys], [Y | Ls], Bs) :- constr( (X>Y) ), partition(X, Ys, Ls, Bs). partition(X, [Y | Xs], Ls, [Y | Bs]) :- constr( (X= listcount(Y,Ls,SLs), listcount(Y,Smalls,SSmalls), listcount(Y,Bigs,SBigs) => constr(true). :- spec append(Xs,Ys,Zs) ==> listcount(X,Xs,SXs), listcount(X,Ys,SYs), listcount(X,Zs,SZs) => constr(true). :- spec cons(C,A,D) ==> listcount(X,A,SA), listcount(X,D,SD) => constr(true). % ================================================================= :- query ff1/0. % =================================================================