3 ms·
It is not hard to argue that several FP abstractions are basically state machines themselves, their transition function is simply recursively defined. For a tr
by kaba0 4y ago
It is not hard to argue that several FP abstractions are basically state machines themselves, their transition function is simply recursively defined.
For a trivial example, objects defining the Applicable trait.
- e-dant 4y agoWhich abstractions? I could see a monad being defined as a list of (typed) states with a functor. But they’re still stateless. I could also see immutable data structures being implemented in a stateful way (they usually are in non-FP languages).
- deleted 4y ago[deleted]