Middleton, Tony2023-03-012023-03-011979https://unbscholar.lib.unb.ca/handle/1882/14800This 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.http://purl.org/coar/access_right/c_abf2Representing data paths by program structurestechnical reportComputer Science