Point-free in Haskell

Question

I have this code that I want to make point-free;

(\\k t -> chr $ a + flip mod 26 (ord k + ord t -2*a))

How do I do that?

Also are the

Answer 1

Also are there some general rules for point free style other than "think about this amd come up with something"?

You can always cheat and use the "pl" tool from lambdabot (either by going to #haskell on freenode or by using e.g. ghci on acid). For your code pl gives:

((chr . (a +) . flip mod 26) .) . flip flip (2 * a) . ((-) .) . (. ord) . (+) . ord

Which isn't really an improvement if you ask me.