S combinator in Haskell -
can analog of s combinator expressed in haskell using standard functions (without defining equation) , without using lambda (anonymous function)? expect of type (a -> b -> c) -> (a -> b) -> -> c.
for example, analog of k combinator const.
in fact trying express function \f x -> f x x using standard functions, cannot think of standard non-linear function start (that function uses argument more once).
s = (<*>) ((->) r) applicative instance.
Comments
Post a Comment