Haskell utility to make function point free

Question

I'd like to quickly and correctly reduce functions to point free form in Haskell. I'd prefer to produce fairly readable outcomes. How should I go about this?

Answer 1

There is actually a program called "pointfree"

Do this

cabal install pointfree

then this at the command line

> pointfree "\x -> x+1"

 (1 +)

Warning- although some pointfree outcomes are wonderful, others are pretty scary....

Answer 2

The Haskell wiki covers tools for pointfree refactoring here. It mainly covers Lambdabot, an IRC bot that does pointfree and pointful refactoring:

@pl \x y -> EQ == compare x y
((EQ ==) .) . compare

[1] Example from http://ircbrowse.net/browse/haskell?id=19908612&timestamp=1421726397#t1421726397