Paper in proceedings, 2012

In mathematics, an enumeration of a set S is a bijective function from (an initial segment of) the natural numbers to S. We define "functional enumerations" as efficiently computable such bijections. This paper describes a theory of functional enumeration and provides an algebra of enumerations closed under sums, products, guarded recursion and bijections. We partition each enumerated set into numbered, finite subsets.
We provide a generic enumeration such that the number of each part corresponds to the size of its values (measured in the number of constructors). We implement our ideas in a Haskell library called testing-feat, and make the source code freely available. Feat provides efficient "random access" to enumerated values. The primary application is property-based testing, where it is used to define both random sampling (for example QuickCheck generators) and exhaustive enumeration (in the style of SmallCheck). We claim that functional enumeration is the best option for automatically generating test cases from large groups of mutually recursive syntax tree types. As a case study we use Feat to test the pretty-printer of the Template Haskell library (uncovering several bugs).

Memoisation

Enumeration

Property-based testing

Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)

Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)

Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)

61-72

Information and Communication Technology

Basic sciences

Software Engineering

Computer Science

Discrete Mathematics

10.1145/2364506.2364515

978-145031574-6