Data sharing in an FFP machine
Gyula Magó · 1982
The possibility of expressing data sharing in FPs is discussed. The Paterson-Wegman unification algorithm is considered, in which data sharing is indispensable to achieve efficient (linear time) execution. An FP implementation of this algorithm is shown to execute in linear time on an FFP machine. “Associative” versions of some of Backus's FP functions and combining forms appear to be very useful in dealing with irregular data objects such as graphs.