Higher-order transformation and the distributed data problem.

Winter, Victor Lono (University of Nebraska at Omaha, Omaha, NE) ; Subramaniam, Mahadevan (University of Nebraska at Omaha, Omaha, NE)

Sandia National Laboratories

关键词: 99 General And Miscellaneous//Mathematics, Computing, And Information Science;    Computers;    Programming;    Information Retrieval;    97;   

DOI  :  10.2172/918284
RP-ID  :  SAND2003-4587
RP-ID  :  AC04-94AL85000
RP-ID  :  918284

美国|英语

来源: UNT Digital Library

【 摘 要 】

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.