Timeline for Are there any programming languages that support state machines in their standard library?
Current License: CC BY-SA 4.0
15 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Nov 15, 2021 at 20:33 | history | edited | Caleb Stanford | CC BY-SA 4.0 |
typo
|
| Nov 7, 2021 at 18:05 | answer | added | Jörg W Mittag | timeline score: 1 | |
| Nov 4, 2021 at 23:03 | comment | added | Pseudonym♦ | If you're asking about UML/Harel statecharts, I'm not aware of any language which has that built in, but Wikipedia gives some libraries: en.wikipedia.org/wiki/SCXML | |
| Nov 4, 2021 at 22:00 | answer | added | Rodrigo de Azevedo | timeline score: 0 | |
| Nov 4, 2021 at 16:12 | comment | added | Rodrigo de Azevedo | @AndrejBauer I was not criticizing you, but merely commenting that your comment did not agree with my expectation, which made it interesting. | |
| Nov 4, 2021 at 15:45 | comment | added | Andrej Bauer | @RodrigodeAzevedo: you make a good point. Notice that I was talking about how mutable state is essentially an automaton, so it doesn't make so much sense to mention folds in that context. But you're always free to make your own comment or answer, in which you explain how state machines are manifested in declarative programming. | |
| Nov 4, 2021 at 13:59 | comment | added | Rodrigo de Azevedo |
@AndrejBauer I am surprised you haven't mentioned Haskell's foldl and scanl. The way I see it, they exist to simulate finite state machines.
|
|
| Nov 4, 2021 at 13:54 | review | Suggested edits | |||
| S Nov 15, 2021 at 20:33 | |||||
| Nov 4, 2021 at 12:35 | answer | added | Criticizing Israel not allowed | timeline score: 1 | |
| Nov 3, 2021 at 17:30 | answer | added | Claude Brisson | timeline score: 2 | |
| Nov 2, 2021 at 1:33 | comment | added | soren-n | I am assuming you are studying CS, or have studied. Please be careful with assuming all formal concepts around computing being taught in CS is directly useful in programming, they are not. They are however useful gadgets for making proofs. A professor I once took some courses under, and who was fond of pop culture quotes, offered me the following wisdom when I asked him about some issues I had with implementing RegExp using state machines; he sighed and said "Stop trying to hit me, and just hit me", meaning stop trying to simulate the solution to your problem, and just compute it directly. | |
| Nov 1, 2021 at 20:16 | comment | added | Andrej Bauer | In a programming language that supports mutable state (Jave, C/C++, Python, ...) the program itself is a kind of state machine. The state is the state of its variables, and the transitions are described by the program itself. So we do not really need a separate library, just good support to define datatypes that directly represent states (so that we do not need to encode them with something silly, such as strings or integers). | |
| Nov 1, 2021 at 20:07 | comment | added | gnasher729 | There isn't really much to implement for a state machine | |
| S Nov 1, 2021 at 19:30 | review | First questions | |||
| Nov 3, 2021 at 5:04 | |||||
| S Nov 1, 2021 at 19:30 | history | asked | Blank | CC BY-SA 4.0 |