Îõ³h*sT0.1.2.0 (c) Oleksandr Zhabenko 2019-2024MIToleksandr.zhabenko@yahoo.com Safe-InferredDintermediate-structures*Function that applies additional function  f :: a -> [a] to a if p :: a -> Bool and  p a = Trueintermediate-structures*Function that applies additional function f :: a -> [[a]] to a if p :: a -> Bool and  p a = Trueintermediate-structuresïSome general transformation where the arguments that are not present are calculated from the one data argument a8 being just present. Can be used to contstruct function a -> d from some additional ideas.intermediate-structuresA variant of the Û with swapped two first arguments. The following takes place: > swapinter f g == inter g fintermediate-structures A variant of É with 'stricter' calculation scheme. Can be in many cases more efficient.intermediate-structuresA variant of the É with 'stricter' calculation scheme. Can be in many cases more efficient. 6intermediate-structures-0.1.2.0-2fGH077npEh7VKUxTYI7GhData.IntermediateStructures1intermediate-structuresmapImap2Iinter swapinterinter' swapinter'