4 ms·
This seems to be about statically typed languages like Haskell. Can it be used (and be useful) for dynamically typed languages like Scheme?
by bicolao 8y ago
This seems to be about statically typed languages like Haskell. Can it be used (and be useful) for dynamically typed languages like Scheme?
- type_enthusiast 8y agoI think so. It's about factoring the recursion part out of a task, much like "map" is about factoring iteration out, and "fold" is about factoring out iteration+accumulation. I think scheme has both of these things; recursion schemes are the same idea but for recursion.