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

Victor L Winter, Mahadevan Subramaniam

Research output: Contribution to journalArticle

15 Citations (Scopus)

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.

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

Fingerprint

Loaders
Virtual machine

Keywords

  • 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

Cite this

The transient combinator, higher-order strategies, and the distributed data problem. / Winter, Victor L; Subramaniam, Mahadevan.

In: Science of Computer Programming, Vol. 52, No. 1-3, 01.08.2004, p. 165-212.

Research output: Contribution to journalArticle

@article{d3d6aebde29a49cd843064038b76970f,
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.",
keywords = "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",
author = "Winter, {Victor L} and Mahadevan Subramaniam",
year = "2004",
month = "8",
day = "1",
doi = "10.1016/j.scico.2004.03.006",
language = "English (US)",
volume = "52",
pages = "165--212",
journal = "Science of Computer Programming",
issn = "0167-6423",
publisher = "Elsevier",
number = "1-3",

}

TY - JOUR

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

AU - Winter, Victor L

AU - Subramaniam, Mahadevan

PY - 2004/8/1

Y1 - 2004/8/1

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

VL - 52

SP - 165

EP - 212

JO - Science of Computer Programming

JF - Science of Computer Programming

SN - 0167-6423

IS - 1-3

ER -