3 ms·
The post discusses weak vs strong composition, not simple vs complex. The goal is FP for I/O so that composing is pure, so that it’s strong, whatever that means
by dahart 8y ago
The post discusses weak vs strong composition, not simple vs complex. The goal is FP for I/O so that composing is pure, so that it’s strong, whatever that means.
We already have simple composition of programs with Von Neumann I/O, so I’m not sure I can agree with you.
To that end, I found his example of number composition quite unconvincing. He said we use binary and not strings for composability. That’s not true. Numbers represented as strings are no less composable. The only real downside is they’re less memory and time efficient, but string based numbers are just as composable as binary numbers.