←back to thread

Polystate: Composable Finite State Machines

(github.com)
115 points goless | 2 comments | 23 Jun 25 01:47 UTC | HN request time: 0s | source
Show context
goless ◴[23 Jun 25 01:47 UTC] No.44351819[source]▶
Hi everyone, I developed an interesting library Polystate: Composable Finite State Machines

Since I only have experience in haskell and zig, I'm curious if there are other languages or libraries with similar implementations?

replies(6): >>44351895 #>>44352068 #>>44352576 #>>44352757 #>>44353562 #>>44353893 #
1. crq-yml ◴[23 Jun 25 05:01 UTC] No.44352576[source]▶
Typically it's done through source code generation or a runtime interpreter - state machine systems implementing a "DSL->source code" mechanism have been around for nearly as long as high level languages, and by taking this approach they have a lot of freedom to include compiler techniques of their choosing. If dynamism is called for then the diagram is typically kept in memory and interpreted at runtime.

Doing it through types is intellectually interesting and makes the result more integrated into the edit-compile loop instead of involving a step in the build process or a step of invoking an interpreter, but it might not change the practical state of the art.

replies(1): >>44352803 #
2. goless ◴[23 Jun 25 05:55 UTC] No.44352803[source]▶
Yes, but their expressiveness may vary. An important role of polystate is code reuse. It can express more complex states and still be type-safe.