In order to extend the node-naming scheme to uniquely name the nodes in a function call graph, where we aim to exploit the redundancy in the structure, it will be necessary to work with a name that consists of the route or path of directions from the root node to the node in question. Providing a unique name for each node will be a major part of making the system work. Using full path names for the nodes will also lead us to be able to assign names automatically for a wide range of structures, without a user having to explicitly name the nodes themselves. It will be necessary to find a way to describe the structure of nested recursive data structures such as trees of lists, that can then be converted to a naming scheme. Finally, implementing the method and providing a library of routines that allow a user to manipulate structures in parallel in much the same way that a sequential program would be written will complete the project.