TY - JOUR
T1 - The transient combinator, higher-order strategies, and the distributed data problem
AU - Winter, Victor L.
AU - Subramaniam, Mahadevan
N1 - Funding Information:
This work was in part supported by the United States Department of Energy under Contract DE-AC04-94AL85000. Sandia is a multiprogram laboratory operated by Sandia Corporation, a Lockheed Martin Company, for the United States Department of Energy. Victor Winter was also partially supported by NSF grant number CCR-0209187.
PY - 2004/8
Y1 - 2004/8
N2 - The distributed data problem is characterized by the desire to bring together semantically related data from syntactically unrelated portions of a term. A strategic combinator called transient and a strategic constant called skip are introduced in the context of a higher-order strategic framework. The notion of traversal is lifted to the higher order as well. The resulting framework allows the manipulation of data to be expressed directly in strategic terms. The impact of this dynamic approach to strategy creation is then explored for several instances of the distributed data problem. Problems considered include three strategic benchmarks as well as two transformations that arise within a class loader for the Java virtual machine.
AB - The distributed data problem is characterized by the desire to bring together semantically related data from syntactically unrelated portions of a term. A strategic combinator called transient and a strategic constant called skip are introduced in the context of a higher-order strategic framework. The notion of traversal is lifted to the higher order as well. The resulting framework allows the manipulation of data to be expressed directly in strategic terms. The impact of this dynamic approach to strategy creation is then explored for several instances of the distributed data problem. Problems considered include three strategic benchmarks as well as two transformations that arise within a class loader for the Java virtual machine.
KW - Distributed data problem
KW - Higher-order rewriting
KW - Higher-order strategic programming
KW - Higher-order traversal
KW - One-layer higher-order traversals
KW - Program transformation
KW - Rewriting
KW - Skip strategy
KW - Strategic programming
KW - TL
KW - Transformation
KW - Transient combinator
UR - http://www.scopus.com/inward/record.url?scp=3042774756&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=3042774756&partnerID=8YFLogxK
U2 - 10.1016/j.scico.2004.03.006
DO - 10.1016/j.scico.2004.03.006
M3 - Article
AN - SCOPUS:3042774756
SN - 0167-6423
VL - 52
SP - 165
EP - 212
JO - Science of Computer Programming
JF - Science of Computer Programming
IS - 1-3
ER -