Boiten, E.A. (1991) Intersections of Sets and Bags of Extended Substructures, and Can Bag Comprehension be Used at All? Technical report. Dept. of Informatics, University of Nijmegen
| The full text of this publication is not available from this repository. (Contact us about this Publication) |
Abstract
Formal specifications that exhibit similarities will often have similar solutions. Thus, it is useful to construct generalized specifications that describe classes of problems, since (partial) solutions to the generalized problem can be used for obtaining solutions for the specific problems. In this paper we study a class of generalized pattern matching problems, in which the essential operation is the intersection of a particular set and a bag of extended substructures of a structured object. We present a formalization of bags of extended substructures and define the ISBES (Intersection of Sets and Bags of Extended Substructures) class of problems. Some example ISBES specifications are shown, and we present some first ideas about applicable program transformation strategies for ISBES problems. The second paper discusses conditions under which the non-standard specification mechanism of a bag comprehension may be safely used. The first paper has been published (/pubs/1991/161/) and included in my PhD thesis.
| Item Type: | Monograph (Technical report) |
|---|---|
| Uncontrolled keywords: | bags, transformational programming, substructures, pattern matching, Bird-Meertens formalism |
| Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
| Divisions: | Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group |
| Depositing User: | Mark Wheadon |
| Date Deposited: | 01 Aug 2009 15:44 |
| Last Modified: | 01 Aug 2009 15:44 |
| Resource URI: | http://kar.kent.ac.uk/id/eprint/20991 (The current URI for this page, for reference purposes) |
- Depositors only (login required):
