(This is a stub.)
(link to recent thread in Haskell-Cafe)
|(4 intermediate revisions by 3 users not shown)|
Latest revision as of 23:55, 6 January 2011
|Haskell theoretical foundations|
\x -> abs x
Converting from the first to the second would constitute an eta reduction, and moving from the second to the first would be an eta abstraction. The term 'eta conversion' can refer to the process in either direction.
Extensive use of η-reduction can lead to Pointfree programming. It is also typically used in certain compile-time optimisations.
 See also
- Haskell-Cafe on What's the motivation for η rules?