# Solving a combinatorial problem by transformation of abstract data types

Boiten, Eerke Albert (1991) Solving a combinatorial problem by transformation of abstract data types. In: van Leeuwen, J., ed. UNSPECIFIED Stichting Mathematisch Centrum, Amsterdam, pp. 99-108. ISBN 90-6196-403-2. (KAR id:20987)

## Abstract

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.

Item Type: Book section Also a chapter in PhD thesis program transformation, abstract data types, permutations Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, Faculties > Sciences > School of Computing > Theoretical Computing Group Eerke Boiten 23 Mar 2010 23:58 UTC 10 Sep 2019 14:29 UTC https://kar.kent.ac.uk/id/eprint/20987 (The current URI for this page, for reference purposes) https://orcid.org/0000-0002-9184-8968