Difference between revisions of "Terms"
Jump to navigation
Jump to search
(Added "Oleg rating") |
(Pretty sure these are called "unlifted") |
||
Line 30: | Line 30: | ||
| Building a cyclic data structure |
| Building a cyclic data structure |
||
|- |
|- |
||
− | | |
+ | | Unlifted types |
| Types that do not have bottom as an inhabitant |
| Types that do not have bottom as an inhabitant |
||
|- |
|- |
Revision as of 03:03, 17 March 2011
This article is a stub. You can help by expanding it.
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 |