On assignment between data paths
| dc.contributor.author | Middleton, Tony | |
| dc.date.accessioned | 2023-03-01T18:26:58Z | |
| dc.date.available | 2023-03-01T18:26:58Z | |
| dc.date.issued | 1979 | |
| dc.description.abstract | This paper discusses an approach to the manipulation of "data paths". In particular, assignment between data paths is discussed. The notion of a "data path" is somewhat similar to that of an "abstract data structure" except that there is greater emphasis on the fact that elements are processed sequentially. The work is part of a broader effort to allow higher-level operations to be applicable to a wider range of data paths. The aim is to specify higher-level operations in such a manner that the nature of the data paths being manipulated is conveyed explicitly, and naturally, along with the specification of the operations being performed. Only simple cases are dealt with, but that is considered to reflect "work done so far" rather than inherent limitations of the approach. | |
| dc.description.copyright | Copyright @ Tony Middleton, 1979. | |
| dc.identifier.uri | https://unbscholar.lib.unb.ca/handle/1882/14669 | |
| dc.rights | http://purl.org/coar/access_right/c_abf2 | |
| dc.subject.discipline | Computer Science | |
| dc.title | On assignment between data paths | |
| dc.type | technical report |
Files
Original bundle
1 - 1 of 1