Disciplined‚ efficient‚ generalised folds for nested datatypes
Nested (or non-uniform, or non-regular) datatypes have recursive definitions in which the type parameter changes. Their folds are restricted in power due to type constraints. Bird and Paterson introduced <em>generalised folds</em> for extra power, but at the cost of a loss of efficiency:...
| المؤلفون الرئيسيون: | , , |
|---|---|
| التنسيق: | Journal article |
| منشور في: |
2004
|