Description: The distributed data problem, is characterized by the desire to bring together semantically related data from syntactically unrelated portions of a term. Two strategic combinators, dynamic and transient, are introduced in the context of a classical strategic programming framework. The impact of the resulting system on instances of the distributed data problem is then explored.
Date: December 1, 2003
Creator: Winter, Victor Lono (University of Nebraska at Omaha, Omaha, NE) & Subramaniam, Mahadevan (University of Nebraska at Omaha, Omaha, NE)
Item Type: Refine your search to only Report
Partner: UNT Libraries Government Documents Department