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)
|
Postscript
Language: English |
|
|
Download this file (Postscript/166kB) |
Preview |
| Request a format suitable for use with assistive technology e.g. a screenreader | |
|
PDF
Language: English |
|
|
Download this file (PDF/474kB) |
Preview |
| Request a format suitable for use with assistive technology e.g. a screenreader | |
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 |
|---|---|
| Additional information: | Also a chapter in PhD thesis |
| Uncontrolled keywords: | program transformation, abstract data types, permutations |
| Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
| Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
| Depositing User: | Eerke Boiten |
| Date Deposited: | 23 Mar 2010 23:58 UTC |
| Last Modified: | 05 Nov 2024 09:58 UTC |
| Resource URI: | https://kar.kent.ac.uk/id/eprint/20987 (The current URI for this page, for reference purposes) |
University of Kent Author Information
Boiten, Eerke Albert.
| Creator's ORCID: |
 https://orcid.org/0000-0002-9184-8968
|
|---|---|
| CReDIT Contributor Roles: |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):
Total Views
Total Views
