UNIFORM ALGEBRAIC SPECIFICATIONS OF FINITE SETS WITH EQUALITY
J. A. Bergstra, Sjouke Mauw, Freek Wiedijk · International Journal of Foundations of Computer Science · 1991
We study a variety of ways to specify a two sorted structure involving the Booleans B, with constants true and false and a finite set D with an equality function eq to the Booleans, under the assumption that there is a constant (name) for each element of D. The specifications are evaluated with respect to several properties, like textual length, efficiency in execution and the use of special features.