Solving a combinatorial problem by transformation of abstract data types
Eerke Boiten · Kent Academic Repository (University of Kent) · 1991
Techniques from the area of formal specification are shown to be useful in the analysis of combinatorial problems. A problem description is given, using an abstract data type. By gradual elimination of the equivalences on the data types a unique representation of the type is derived which reduces the new problem to a known one.