Terms

From HaskellWiki
Revision as of 22:29, 16 March 2011 by Henk-Jan van Tuyl (talk | contribs) (Created a stub with explanation of several terms in a table)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

This article is a stub. You can help by expanding it.

An overview of Haskell related terms

See also Abbreviations

Anamorphism An unfold
Catamorphism Fold; any for-each loop can be represented as a catamorphism
Finally tagless ???
Forgetful functor Given some object with structure as input, some or all of the object's structure or properties is 'forgotten' in the output
Hylomorphism Combination of fold and unfold; every for-loop (without early exits) can be represented as a hylomorphism
Tail recursion A recursive function is tail recursive if the final result of the recursive call is the final result of the function itself.
Tying the knot Building a cyclic data structure
Unpointed types Types that do not have bottom as an inhabitant