Paper Info
Title
The transient combinator, higher-order strategies, and the distributed data problem
Abstract
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.
Year
DOI
Venue
2004
10.1016/j.scico.2004.03.006
Sci. Comput. Program.
Keywords
Field
DocType
transformation,strategic term,tl,higher-order strategic programming,resulting framework,java virtual machine,table normalization,transient combinator,hats,semantically related data,skip strategy,distributed data problem,java class loader,strategic combinator,class loader,higher-order traversal,rewriting,higher-order rewriting,strategic programming,strategic benchmarks,sandia secure processor,higher-order strategy,dynamic approach,one-layer higher-order traversals,program transformation,data problem,higher-order strategic framework,higher order,relational data
Programming language,Program transformation,Tree traversal,Combinatory logic,Computer science,Strategic programming,Theoretical computer science,Rewriting,Loader,Java virtual machine
Journal
Volume
Issue
ISSN
52
1-3
Science of Computer Programming
Citations 
PageRank 
References 
17
0.94
26
Authors
2
Name
Order
Citations
PageRank
Victor L. Winter111017.04
Mahadevan Subramaniam220425.78