haskell - Can any function be reduced to a point-free form? -
A lot of functions can be reduced to point to the free form - but is this true for everyone?
For example, I do not think how this can be done:
apply2 fx = fxx
is the compositor for your apply2 function (if I'm reading things correctly): () Of (s (s (s)) (k (s (s (s))) ((SK))))) "lark", page To
( Edit-In: ) Ends 1 \ fx -> F (xx) . According to the comments of "@GearRatator" given below, it is known as "lark", whereas the function \ f x -> Fx = S (S (K (S (S (K)) (KK) SI Fx = S Q & A; request is requested in the book (aka) made before "Warbler", ( S (KB) S) (KK) SI Fx = CSI Fx = SFIX = FXA . here:
(s (s (s) of s (k) (k (s (s))) ((s))))) fx = s (s (s) (k) SK K) (SK K) (SKK)) Fx = - SKK == IS (S (K) K) (K Ii) Fx = = BSB (K) of S. (K) Fx = BF (K) S) X = BF (SIi) X = F (Sii X) = F (XX)
Comments
Post a Comment