←back to thread

Polystate: Composable Finite State Machines

(github.com)
115 points goless | 1 comments | 23 Jun 25 01:47 UTC | HN request time: 0.374s | 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 #
physix ◴[23 Jun 25 05:43 UTC] No.44352757[source]▶
We developed an Entity DBMS where the entities are FSMs.

https://medium.com/@paul_42036/entity-workflows-for-event-dr...

I believe that FSMs are a very powerful approach, even for building entire systems. So much so, that it forms a core part of our product.

replies(1): >>44352792 #
goless ◴[23 Jun 25 05:52 UTC] No.44352792[source]▶
Yes, FSMs are underestimated in imperative programming. Of course this is probably because before type-safe state machines were available, manual coding was very error-prone.
replies(1): >>44353298 #
1. _0ffh ◴[23 Jun 25 07:25 UTC] No.44353298[source]▶
I've seen them a lot in embedded programming, but I can't be sure if that observation holds in general or just for the environment in which I was working when I did embedded.