I discovered the above implementation about the time I finished reading through the paper. I need to go back through and finish taking notes.
I think there might be room to add `any` and `all` guards that take many guards as arguments.
The other thing I've been pondering is the apparent similarity between ASTs and the sort of graph a statechart forms. If we compress state and chart into a single object, now you have states that can have parents and children (the semantics of what is an active state would vary with your node type, IE compound or parallel). Then your edges would the transitions between nodes.
The semantics of the whole thing starts to look vaguely like there's a programming language that could emerge if the intermediate representation is hammered out well enough.
I think there might be room to add `any` and `all` guards that take many guards as arguments.
The other thing I've been pondering is the apparent similarity between ASTs and the sort of graph a statechart forms. If we compress state and chart into a single object, now you have states that can have parents and children (the semantics of what is an active state would vary with your node type, IE compound or parallel). Then your edges would the transitions between nodes.
The semantics of the whole thing starts to look vaguely like there's a programming language that could emerge if the intermediate representation is hammered out well enough.