Fun with Automata!

Pure functions cannot maintain state (such as squaring every OTHER number passed to a function), but there are many cases where we need to maintain state, but still want the benefits of referential transparency and determinism.

In this workshop, John A. De Goes introduces deterministic automata, which have a trivial encoding in functional programming that permits you to have your cake and eat it too -- pure, deterministic, and "stateful"!

Bring your laptop and prepare to work through a set of exercises at the end.

Free Pizza!