Personal tools

Terms

From HaskellWiki

(Difference between revisions)
Jump to: navigation, search
(Pretty sure these are called "unlifted")
(If you google "Unpointed types", you wil find many hits)
Line 31: Line 31:
 
|-
 
|-
 
| Unlifted types
 
| Unlifted types
  +
| Types that do not have bottom as an inhabitant
  +
|-
  +
| [http://www.soi.city.ac.uk/~ross/papers/pointed.html Unpointed types]
 
| Types that do not have bottom as an inhabitant
 
| Types that do not have bottom as an inhabitant
 
|-
 
|-

Revision as of 11:44, 17 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
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