Unifying Structured Recursion Schemes
Folds over inductive datatypes are well understood and widely used. In their plain form, they are quite restricted; but many disparate generalisations have been proposed that enjoy similar calculational benefits. There have also been attempts to unify the various generalisations: two prominent such...
| Huvudupphovsmän: | , , |
|---|---|
| Materialtyp: | Conference item |
| Publicerad: |
2013
|