See also: Tony’s post on the same topic
You often hear people saying “Language X^{1} has sum types” or “I wish language X had sum types”^{2}, or “Sum types are cool”.
Much like fezzes and bow ties, sum types are indeed cool.
These days, I’ve also seen people asking about “Pi types”, because of this Rust RFC.
But what does “sum type” mean? And why is it called that? And what, in the name of sanity, is a Pi type?
Before I start, I’ll mention that while I will be covering some type theory to explain the names “sum” and “product”, you don’t need to understand these names to use these things! Far too often do people have trouble understanding relatively straightforward concepts in languages because they have confusing names with confusing mathematical backgrounds^{3}.
So what’s a sum type? (the notypetheory version)
In it’s essence, a sum type is basically an “or” type. Let’s first look at structs.
1 2 3 4 

Foo
is a bool
AND a String
. You need one of each to make one.
This is an “and” type, or a “product” type (I’ll explain the name later).
So what would an “or” type be? It would be one where the value can be a
bool
OR a String
. You can achieve this with C++ with a union:
1 2 3 4 5 6 7 

However, this isn’t exactly right, since the value doesn’t store the information
of which variant it is. You could store false
and the reader wouldn’t know
if you had stored an empty string
or a false
bool
.
There’s a pattern called “tagged union” (or “discriminated union”) in C++ which bridges this gap.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 

Here, you manually set the tag when setting the value. C++ also has std::variant
(or
boost::variant
) that encapsulates this pattern with a better API.
While I’m calling these “or” types here, the technical term for such types is “sum” types. Other languages have builtin sum types.
Rust has them and calls them “enums”. These are a more generalized version of the enums you see in other languages.
1 2 3 4 5 6 7 8 9 10 11 12 

Swift is similar, and also calls them enums
1 2 3 4 5 6 7 8 9 10 11 12 

You can fake these in Go using interfaces, as well. Typescript has builtin unions which can be typechecked without any special effort, but you need to add a tag (like in C++) to pattern match on them.
Of course, Haskell has them:
1 2 3 4 5 6 7 8 9 10 

One of the very common things that languages with sum types do is express nullability as a sum type;
1 2 3 4 5 6 7 8 9 10 11 

Generally, these languages have “pattern matching”, which is like a switch
statement on steroids. It lets you match on and destructure all kinds of things,
sum types being one of them. Usually, these are “exhaustive”, which means that
you are forced to handle all possible cases. In Rust, if you remove that None
branch, the program won’t compile. So you’re forced to deal with the none case,
somehow.
In general sum types are a pretty neat and powerful tool. Languages with them builtin tend to make heavy use of them, almost as much as they use structs.
Why do we call it a sum type?
Here be (type theory) dragons
Let’s step back a bit and figure out what a type is.
It’s really a restriction on the values allowed. It can have things like methods and whatnot dangling off it, but that’s not so important here.
In other words, it’s like^{4} a set. A boolean is the set \(\{\mathtt{true}, \mathtt{false}\}\). An 8bit unsigned integer
(u8
in Rust) is the set \(\{0, 1, 2, 3, …. 254, 255\}\). A string is a set with
infinite elements, containing all possible valid strings^{5}.
What’s a struct? A struct with two fields contains every possible combination of elements from the two sets.
1 2 3 4 

The set of possible values of Foo
is
(Read as “The set of all \((\mathtt{x}, \mathtt{y})\) where \(\tt x\) is in \(\mathtt{bool}\) and \(\tt y\) is in \(\mathtt{u8}\)”)
This is called a Cartesian product, and is often represented as \(\tt Foo = bool \times u8\).
An easy way to view this as a product is to count the possible values: The number of possible values
of Foo
is the number of possible values of bool
(2) times the number of possible values of u8
(256).
A general struct would be a “product” of the types of each field, so something like
1 2 3 4 5 6 

is \(\mathtt{Bar = bool \times u8 \times bool \times String}\)
This is why structs are called “product types”^{6}.
You can probably guess what comes next – Rust/Swift enums are “sum types”, because they are the sum of the two sets.
1 2 3 4 

is a set of all values which are valid booleans, and all values which are valid integers. This is a sum of sets, \(\tt Foo = bool + u8\). More accurately, it’s a disjoint union, where if the input sets have overlap, the overlap is “discriminated” out.
An example of this being a disjoint union is:
1 2 3 4 5 

This is not \(\tt Bar = bool + bool + u8\), because \(\tt bool + bool = bool\), (regular set addition doesn’t duplicate the overlap).
Instead, it’s something like
\[\tt Bar = bool + otherbool + u8\]where \(\tt otherbool\) is also a set \(\tt \{true, false\}\), except that these elements are different from those in \(\tt bool\). You can look at it as if
\[\tt otherbool = \{true_2, false_2\}\]so that
\[\mathtt{bool + otherbool} = \{\mathtt{true, false, true_2, false_2}\}\]For sum types, the number of possible values is the sum of the number of possible values of each of its component types.
So, Rust/Swift enums are “sum types”.
You may often notice the terminology “algebraic datatypes” (ADT) being used, usually that’s just talking about sum and product types together – a language with ADTs will have both.
In fact, you can even have exponential types! The notation A^{B} in set theory does mean something,
it’s the set of all possible mappings from \(B\) to \(A\). The number of elements is \({N_A}^{N_B}\). So
basically, the type of a function (which is a mapping) is an “exponential” type. You can also view it as
an iterated product type, a function from type B
to A
is really a struct like this:
1 2 3 4 5 6 7 8 9 10 11 

given a value of the input b
, the function will find the right field of my_func
and return
the mapping. Since a struct is a product type, this is
making it an exponential type.
You can even take derivatives of types! (h/t Sam TobinHochstadt for pointing this out to me)
What, in the name of sanity, is a Pi type?
It’s essentially a form of dependent type. A dependent type is when your type
can depend on a value. An example of this is integer generics, where you
can do things like Array<bool, 5>
, or template<unsigned int N, typename T> Array<T, N> ...
(in C++).
Note that the type signature contains a type dependent on an integer, being generic over multiple different array lengths.
The name comes from how a constructor for these types would look:
1 2 3 4 5 6 7 8 9 10 11 

What’s the type of make_array
here? It’s a function which can accept any integer
and return a different type in each case. You can view it as a set of functions,
where each function corresponds to a different integer input. It’s basically:
1 2 3 4 5 6 7 8 9 

Given an input, the function chooses the right child function here, and calls it.
This is a struct, or a product type! But it’s a product of an infinite number of types^{7}.
We can look at it as
\[\texttt{make_array} = \prod\limits_{x = 0}^\infty\left( \texttt{fn()} \mathtt\to \texttt{Array<bool, x>}\right)\]The usage of the \(\Pi\) symbol to denote an iterative product gives this the name “Pi type”.
In languages with lazy evaluation (like Haskell), there is no difference between having a function
that can give you a value, and actually having the value. So, the type of make_array
is the type
of Array<bool, N>
itself in languages with lazy evaluation.
There’s also a notion of a “sigma” type, which is basically
\[\sum\limits_{x = 0}^\infty \left(\texttt{fn()} \mathtt\to \texttt{Array<bool, x>}\right)\]With the Pi type, we had “for all N we can
construct an array”, with the sigma type we have “there exists some N for which we can construct this array”.
As you can expect, this type can be expressed with a possiblyinfinite enum, and instances of this type
are basically instances of Array<bool, N>
for some specific N
where the N
is only known at runtime.
(much like how regular sum types are instances of one amongst multiple types, where the exact type
is only known at runtime). Vec<bool>
is conceptually similar to the sigma type Array<bool, ?>
,
as is &[bool]
.
Wrapping up
Types are sets, and we can do settheory things on them to make cooler types.
Let’s try to avoid using confusing terminology, however. If Rust does get “pi types”, let’s just call them “dependent types” or “const generics” :)
Thanks to Zaki, Avi Weinstock, Corey Richardson, and Peter Atashian for reviewing drafts of this post.

Rust, Swift, sort of Typescript, and all the functional languages who had it before it was cool.↩

Lookin’ at you, Go.↩

Moooooooooooooooonads↩

Types are not exactly sets due to some differences, but for the purposes of this post we can think of them like sets.↩

Though you can argue that strings often have their length bounded by the pointer size of the platform, so it’s still a finite set.↩

This even holds for zerosized types, for more examples, check out this blog post↩

Like with strings, in practice this would probably be bounded by the integer type chosen↩