Terms
From HaskellWiki
(Difference between revisions)
(If you google "Unpointed types", you wil find many hits) |
(Bottom) |
||
| Line 8: | Line 8: | ||
| Anamorphism | | Anamorphism | ||
| An unfold | | An unfold | ||
| + | |- | ||
| + | | [[Bottom]] | ||
| + | | Undefined value | ||
|- | |- | ||
| Catamorphism | | Catamorphism | ||
| Line 31: | Line 34: | ||
|- | |- | ||
| Unlifted types | | Unlifted types | ||
| - | | | + | | [[Type]]s that do not have [[bottom]] as an inhabitant |
|- | |- | ||
| [http://www.soi.city.ac.uk/~ross/papers/pointed.html Unpointed types] | | [http://www.soi.city.ac.uk/~ross/papers/pointed.html Unpointed types] | ||
| - | | | + | | [[Type]]s that do not have [[bottom]] as an inhabitant |
|- | |- | ||
|} | |} | ||
Revision as of 20:03, 21 March 2011
This article is a stub. You can help by expanding it.
An overview of Haskell related terms
See also Abbreviations
| Anamorphism | An unfold |
| Bottom | Undefined value |
| 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 |
| Oleg rating | A measure of ability to do type system trickery :) |
| 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 |
| Unlifted types | Types that do not have bottom as an inhabitant |
| Unpointed types | Types that do not have bottom as an inhabitant |
