Îõ³h$Šu(c) OleksandrZhabenko 2021MITolexandr543@yahoo.com Experimental Safe-InferredksublistsÇSplits the input second argument into sublists each one containing the nù elements where the number is taken as the sequential element in the first argument starting from the left to the right. If the number is less than 1 then the corresponding sublist is empty. If all the elements in the first argument are less than 1 then returns an infinite lazy list of [] as its elements (probably not the needed case). When all the elements of the first argument ends and there are elements in the second argument being not already processed then the function reinitializes itself with the prior first argument and the rest of the unprocessed elements in the second argument. This leads to the *cycling behaviour*.Similar functions are in the  list-grouping and splitÐ packages, but they do not have cycling behaviour and have another realization. sublistsA monadic variant of the > where the first argument is taken from the monadic function. sublistsAn  variant of the  where the first argument is taken from the applicative function. sublistsÁA monadic function to obtain the argument for the regularization.sublists3An initial element (seed) for the monadic function.sublists(A list to be splitted into the sublists.sublistsAn 8 function to obtain the argument for the regularization.sublists7An initial element (seed) for the applicative function.sublists(A list to be splitted into the sublists.'sublists-0.1.2.0-1aCv3ORIv49EXciPX9KZrhSublistsintoRegularSublistsintoRegularSublistsMintoRegularSublistsAbaseGHC.Base Applicative