Daniel Brice - Infinite sets that admit fast exhaustive search

https://upload.wikimedia.org/wikipedia/commons/thumb/9/99/Cantor_set_binary_tree.svg/400px-Cantor_set_binary_tree.svg.png

From the intersection of data structures/algorithms, computability, type-level programming, and the high-generality branch of geometry called Topology comes a surprising theorem. The author applies the topological mantra that a compact set is a set that "behaves like" a finite set to the setting of programming, constructing a class of infinite data structures that have finite-time exhaustive search algorithms.

We seek to present all topics thoroughly while assuming as little background as possible. In particular, no prior knowledge of Topology is needed.

Paper: https://www.cs.bham.ac.uk/~mhe/papers/exhaustive.pdf