Any dependently typed language worth its salt will be able to model a state machine in its type system. Haskell can do it with some effort, maybe for simple st

Any dependently typed language worth its salt will be able to model a state machine in its type system. Haskell can do it with some effort, maybe for simple stuff phantom types and GADTs are enough. With linear types the explicit "consumption" can be modeled.