Representing data paths by program structures

Simple item page
dc.contributor.authorMiddleton, Tony
dc.date.accessioned2023-03-01T18:27:56Z
dc.date.available2023-03-01T18:27:56Z
dc.date.issued1979
dc.description.abstractThis paper discusses an approach to using program fragments to characterise data aggregates (or "data paths"). The main topic of the paper is the use of this representation to specify assignments between data paths. The approach allows certain assignments between paths to be represented in a conceptually simpler manner than would be the case for conventional techniques.
dc.description.copyrightCopyright @ Tony Middleton, 1979.
dc.identifier.urihttps://unbscholar.lib.unb.ca/handle/1882/14800
dc.rightshttp://purl.org/coar/access_right/c_abf2
dc.subject.disciplineComputer Science
dc.titleRepresenting data paths by program structures
dc.typetechnical report

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
item.pdf
Size:
217.59 KB
Format:
Adobe Portable Document Format
Download

Collections

Research Reports