Eta conversion: Difference between revisions
No edit summary |
(Added slightly more chatter.) |
||
| Line 1: | Line 1: | ||
An ''eta conversion'' (also written ''η-conversion'') is adding or dropping of abstraction over a function. For example, the following two values are equivalent under η-conversion: <haskell>\x -> abs x | An ''eta conversion'' (also written ''η-conversion'') is adding or dropping of abstraction over a function. For example, the following two values are equivalent under η-conversion: <haskell>\x -> abs x | ||
</haskell>and <haskell>abs</haskell> | </haskell>and <haskell>abs</haskell> | ||
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. | Extensive use of η-reduction can lead to [[Pointfree]] programming. It is also typically used it certain compile-time optimisations. | ||
[[Category:Glossary]] | [[Category:Glossary]] | ||
Revision as of 12:58, 30 January 2007
An eta conversion (also written η-conversion) is adding or dropping of abstraction over a function. For example, the following two values are equivalent under η-conversion:
\x -> abs xabsConverting 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 it certain compile-time optimisations.