Oskar Wickstrom - Finite state machines - Code Mesh 2017
1,665 views · Published 18 December 2017 · 44:08 · Indexed 20 September 2026
Channel: Erlang Solutions · 2017 · Science & Technology
When modeling problem domains, we collect different possible states, legal transitions between states, and relevant data for each state. Finite-state machines emerge. To verify that programs are constructed correctly, and to have a living machine-verified documentation, we should let the compiler in on our trade secrets. In this talk we will look at motivations and examples of encoding finite-state machines, using the expressive type systems of Haskell and PureScript. More details: http://www.codemesh.io/codemesh2017/oskar-wickstrom
More from this channel
-
30:33
Erlang Application Metrics with Folsom: Joe Williams
-
43:45
Active Queue Management - What it is, and why you should care - Mahesh Paolini-Subramanya
-
45:39
The 'Jobs' Load Regulation Framework - Ulf Wiger
-
46:26
Ian Plosker - The End of Complexity: How Simple Services are Reshaping Databases and the Enterprise
-
50:08
Erlang Factory 2014 -- Star Trek: revisited in Lua and Erlang
-
53:57
Erlang Factory 2014 -- Erlang + CZMQ: Scalable, Secure, Cross Language Messaging
-
41:00
Benoît Chesneau - Primer (...) - Erlang User Conference 2015
-
45:56
Events Analysis with Riak, Perl and Erlang at Booking.com - Damien Krotkine