Make illegal states unrepresentable — but how? The Typestate Pattern in Erlang

Making illegal states unrepresentable is one of the practices Yaron Minsky from Jane Street preached in his Effective ML lectures on programming in OCaml some 10 years ago. Could this technique be applied in Erlang, which is known for being notoriously hard to typecheck? Let’s find out!

Minsky’s original example shows how to refactor a C-style “bag of things and an enum” (also known as a discriminated or disjoint union) representation of a state machine:

To a set of record types and an algebraic data type, which prevent misuse of fields in states in which these fields are not defined and should not be accessible:

I recommend watching the original video by following the link above to get a better hold of this technique — it’s worth it!

Fast forward a few years and it turns out that an improved version of this technique which uses generic types to encode valid transitions of the state machine is known as…

The Typestate Pattern

The typestate pattern is an approach to designing data types and APIs that is quite popular in the Haskell and Rust ecosystem.

That’s how Timo Freiberg introduces the typestate pattern in his blog post featured in the 383rd edition of This Week in Rust. The post starts with an example that’s roughly equivalent to the one of Minsky. Later, though, Freiberg elaborates how structuring the data impacts the code that operates on this data. The “bag of things” approach requires multiple conditions in the state machine implementation, which increase code complexity and cognitive overload.

The second of Freiberg’s posts describes the typestate pattern and refactoring of the “bag of things” data representation. We see on concrete examples not only how the illegal states are made unrepresentable, but also how the illegal transitions are made impossible, thanks to the static type system with generic type support.

The clarity of the state-transitioning functions and the ability to directly access the relevant state fields without conditional checks make the code so much simpler and clearer! This declarative description of the data reminds me of a quote from the introduction to Algorithms + Data Structures = Programs, the classic by Niklaus Wirth:

[…] one has an intuitive feeling that data precede algorithms: you must have some objects before you can perform operations on them.

This description of data is something I always missed a bit when working in Erlang, especially in my early days of digging through ejabberd code (which later evolved to become MongooseIM). With some experience came the realisation that nothing beats a well placed , or a file with snippets at hand if rebuilding is not an option, to get a hold of the actual structure of data that I'm dealing with.

Due to some interest in static typing, I set off to experiment with applying the typestate pattern in Erlang and with tools available in the BEAM ecosystem, which could reinforce its application: Dialyzer and Gradualizer. Is it even possible?

The Typestate Pattern in Erlang

In order to assess Dialyzer and Gradualizer feasibility for the task, I won’t consider the “bag of things” representation outlined by Timo and jump straight to translating his typestate aware Rust code:

For the sake of brevity, I omit or adjust some type annotations in the Erlang version below:

Some might argue it’s a lot of typing for no gain, but is it really? Let’s draw the conclusions once we run the typecheckers later. At this point, though, it’s worth taking note that unlike in Rust, we only have to provide essential type annotations — the rest of the code can stay untyped or typed in a very permissive fashion.

Timo’s Rust :

Gets translated to Erlang (in order to typecheck the code I also stub ):

With this Erlang code in place, let’s consider the following misuse of the function:

What does Dialyzer tell us about the code above?

Hmmm… not much. The only warning it returns points out that our stub won't ever return anything else than .

Let’s try Gradualizer:

What do we have there? Although, in general is a valid instance of , it's not allowed as an argument to ! Its spec tells us that only new repair orders can be validated:

Let’s consider another example — what if we make a mistake in itself?

Dialyzer isn’t helpful in this situation either, so I’ll skip its output. Let’s see what Gradualizer gives us:

In this situation the message is not as clear as the previous time, but it’s not that bad either. The tuple tag tells us to look closer at - isn't it an instance of ? Well, no, as upon checking again we realise that is defined as:

All in all, in exchange for defining the states of the state machine as distinct types we get the benefits of:

  1. Being able to encode valid transitions in function specifications
  2. Compile time verification of the state record validity

Moreover, we don’t really have to type everything! We can pick and choose which fields are important to be typed, since the transitions depend on them, and which are not. The more type annotations we provide in the code, though, the higher level of confidence in its correctness we get at compile time, and the more information we pass on to people reading it later. Ultimately, we can just run the code as usual, since it’s still ordinary Erlang, and typechecking it is completely separate from compiling it.

Some of you might ask, though, “what if I make a mistake in my types or specs?” Well, obviously, the typechecker won’t be able to catch errors based on invalid specifications. This situation, however, is similar to designing models for property-based testing — how likely is it that we make the same mistake both in the model and the implementation? Similarly, how likely is it that we make the same mistake in the type specification and the code it describes? In the latter case, though, we don’t have to run the tests to get correctness test results. And we don’t even have to write the (property-based) tests!

The BEAM community might grow more accustomed to techniques such as the typestate pattern as new languages such as Caramel and Gleam rise in popularity. Not every project can be rewritten from scratch, though, so it’s worth keeping in mind that thanks to projects like Gradualizer it’s possible to apply some techniques known in the broader functional programming community to improve Erlang or Elixir code in an evolutionary, or gradual, rather than revolutionary fashion.

Don’t take my word for it — clone https://github.com/erszcz/demos and run the typecheckers on yourself.

PS 1. If you think I’m biased towards Gradualizer or dislike Dialyzer, then you’d better check out this blog post by Rafał Studnicki and Simon Żelazny on typing Elixir which contains some code examples Gradualizer cannot handle at all, but Dialyzer does very well.

PS 2. Gradualizer is still an experimental project and when trying out the snippets for this blog post, I’ve run into a small bug which crashed the typechecker. Hopefully, the fix is merged before this post gets published :)

Erlang/Elixir engineer from Kraków, Poland

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store