3 ms·
> the experience of code refactors via algebraic manipulation is still possible in other languages, especially in non-pure functional languages like Scheme or S
by kagevf 3y ago
> the experience of code refactors via algebraic manipulation is still possible in other languages, especially in non-pure functional languages like Scheme or SML
Wouldn't "code refactors via algebraic manipulation" require static types? How would this work in Scheme?
- mrkeen 3y agoI think the requirement would be purity not static types, but I agree with your overall objection. (Then again, you need static types if you want to have pure functions, IO functions, and not mix them up)
- kagevf 3y ago> I think the requirement would be purity Well, yeah, I think if I had instead said "if not static typing, then how would it be possible?" ... I had no idea how it could be done, but with something like purity - by which we mean deterministic functions, right? - I can at least start to see how it would be possible with Scheme.