Categories and State Machines
Please log in to watch this conference skillscast.
Among examples are both Kleisli categories and and the pure category -> where monadic actions come from the identity monad. This is important as it gives a way to instantiate an abstract description in a pure setting (e.g. for testing). Such categories admit a free model which allows to build abstract models, and he will present the free construction. Finally, he will present an example application in which a finite state machine will be represented using such a free category. This will give a type safe presentation of a state machine, where each state transition is guarded by the type system.
This talk will be based on his (on going) work on the free-category package published on Hackage. https://hackage.haskell.org/package/free-category
YOU MAY ALSO LIKE:
Thank you to our sponsors and partners
Platinum
Gold
Silver
Bronze
Categories and State Machines
Marcin Szamotulski
Marcin is a PhD mathematician, and a Haskell programmer. He did a PhD in abstract algebra studing crossroads of noncommutative geometry and categorical Galois theories. He is interested in the crossroads of logic, category theory, abstract algebra and computer science. He is currently working for IOHK as a Haskell developer and team lead for the networking team.