The transient combinator, higher-order strategies, and the distributed data problem

Victor L. Winter, Mahadevan Subramaniam

Research output: Contribution to journalArticlepeer-review

16 Scopus citations


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.

Original languageEnglish (US)
Pages (from-to)165-212
Number of pages48
JournalScience of Computer Programming
Issue number1-3
StatePublished - Aug 2004
Externally publishedYes


  • Distributed data problem
  • Higher-order rewriting
  • Higher-order strategic programming
  • Higher-order traversal
  • One-layer higher-order traversals
  • Program transformation
  • Rewriting
  • Skip strategy
  • Strategic programming
  • TL
  • Transformation
  • Transient combinator

ASJC Scopus subject areas

  • Software


Dive into the research topics of 'The transient combinator, higher-order strategies, and the distributed data problem'. Together they form a unique fingerprint.

Cite this