Executing state machines (step 2)

[clayrat]

# run a bunch of steps in one go
./exec --fsm ./myProcess.fsm
    --ffiMap ./myProcess.ffiMap 
    --types ./myProcess.tdefs # we don't have this, _but_ it's doable
    --firingSequence ./myFiringSequence.txt

contents of myFiringSequence.txt: suppose the type of transition “0” = boolean
the text between () = serialized terms of the corresponding typedef

0 (true)
1 ()
2 ()
2 (12)
3 ()
1 ()
4 ()

what to do with this “messageData”? very simple, just pass it to the FFI
(right now, the format is text based, s-expr), but in the future it will be some for of binary data, CBOR, or cap-n-proto

possible FFI call

• printHello : () -> IO () ~ prints ‘hello’
• printNumber : Nat -> IO () ~ print ‘nr = »nat«’
• printBoolean : Bool -> IO () ~ print ‘bool = …’

f : A -> B, X is the typedef label on f
then, ffi call type = X * A -> B

[clayrat]

We've decided to try adding the FFI support to the "computer" approach to skip reimplementing things twice.

[clayrat]

We probably want to decouple transitions number and terms, a-la Marco's Cadiz talk example