Strategy construction in the higher-order framework of TL

Victor L Winter

Research output: Contribution to journalConference article

8 Citations (Scopus)

Abstract

When viewed from a strategic perspective, a labeled rule base in a rewriting system can be seen as a restricted form of strategic expression (e.g., a collection of rules strictly composed using the left-biased choice combinator). This paper describes higher-order mechanisms capable of dynamically constructing strategic expressions that are similar to rule bases. One notable difference between these strategic expressions and rule bases is that strategic expressions can be constructed using arbitrary binary combinators (e.g., left-biased choice, right-biased choice, sequential composition, or user defined). Furthermore, the data used in these strategic expressions can be obtained through term traversals. A higher-order strategic programming framework called TL is described. In TL it is possible to dynamically construct strategic expression of the kind mentioned in the previous paragraph. A demonstration follows showing how the higher-order constructs available in TL can be used to solve several problems common to the area of program transformation.

Original languageEnglish (US)
Pages (from-to)149-170
Number of pages22
JournalElectronic Notes in Theoretical Computer Science
Volume124
Issue number1
DOIs
StatePublished - Mar 2 2005
EventProceedings of the Fifth International Workshop on Rule-Based Programming (RULE 2004) -
Duration: Jun 1 2004Jun 1 2004

Fingerprint

Demonstrations
Higher Order
Rule Base
Chemical analysis
Biased
Rewriting Systems
Program Transformation
Strategy
Framework
Strictly
Programming
Binary
Arbitrary
Term

Keywords

  • Higher-order rewriting
  • Program transformation
  • Rewriting
  • Strategic programming
  • TL
  • Transient combinator

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Strategy construction in the higher-order framework of TL. / Winter, Victor L.

In: Electronic Notes in Theoretical Computer Science, Vol. 124, No. 1, 02.03.2005, p. 149-170.

Research output: Contribution to journalConference article

@article{b789da6888354e36bc9a5ee0dd1efe46,
title = "Strategy construction in the higher-order framework of TL",
abstract = "When viewed from a strategic perspective, a labeled rule base in a rewriting system can be seen as a restricted form of strategic expression (e.g., a collection of rules strictly composed using the left-biased choice combinator). This paper describes higher-order mechanisms capable of dynamically constructing strategic expressions that are similar to rule bases. One notable difference between these strategic expressions and rule bases is that strategic expressions can be constructed using arbitrary binary combinators (e.g., left-biased choice, right-biased choice, sequential composition, or user defined). Furthermore, the data used in these strategic expressions can be obtained through term traversals. A higher-order strategic programming framework called TL is described. In TL it is possible to dynamically construct strategic expression of the kind mentioned in the previous paragraph. A demonstration follows showing how the higher-order constructs available in TL can be used to solve several problems common to the area of program transformation.",
keywords = "Higher-order rewriting, Program transformation, Rewriting, Strategic programming, TL, Transient combinator",
author = "Winter, {Victor L}",
year = "2005",
month = "3",
day = "2",
doi = "10.1016/j.entcs.2004.07.020",
language = "English (US)",
volume = "124",
pages = "149--170",
journal = "Electronic Notes in Theoretical Computer Science",
issn = "1571-0661",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

T1 - Strategy construction in the higher-order framework of TL

AU - Winter, Victor L

PY - 2005/3/2

Y1 - 2005/3/2

N2 - When viewed from a strategic perspective, a labeled rule base in a rewriting system can be seen as a restricted form of strategic expression (e.g., a collection of rules strictly composed using the left-biased choice combinator). This paper describes higher-order mechanisms capable of dynamically constructing strategic expressions that are similar to rule bases. One notable difference between these strategic expressions and rule bases is that strategic expressions can be constructed using arbitrary binary combinators (e.g., left-biased choice, right-biased choice, sequential composition, or user defined). Furthermore, the data used in these strategic expressions can be obtained through term traversals. A higher-order strategic programming framework called TL is described. In TL it is possible to dynamically construct strategic expression of the kind mentioned in the previous paragraph. A demonstration follows showing how the higher-order constructs available in TL can be used to solve several problems common to the area of program transformation.

AB - When viewed from a strategic perspective, a labeled rule base in a rewriting system can be seen as a restricted form of strategic expression (e.g., a collection of rules strictly composed using the left-biased choice combinator). This paper describes higher-order mechanisms capable of dynamically constructing strategic expressions that are similar to rule bases. One notable difference between these strategic expressions and rule bases is that strategic expressions can be constructed using arbitrary binary combinators (e.g., left-biased choice, right-biased choice, sequential composition, or user defined). Furthermore, the data used in these strategic expressions can be obtained through term traversals. A higher-order strategic programming framework called TL is described. In TL it is possible to dynamically construct strategic expression of the kind mentioned in the previous paragraph. A demonstration follows showing how the higher-order constructs available in TL can be used to solve several problems common to the area of program transformation.

KW - Higher-order rewriting

KW - Program transformation

KW - Rewriting

KW - Strategic programming

KW - TL

KW - Transient combinator

UR - http://www.scopus.com/inward/record.url?scp=13944281059&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=13944281059&partnerID=8YFLogxK

U2 - 10.1016/j.entcs.2004.07.020

DO - 10.1016/j.entcs.2004.07.020

M3 - Conference article

VL - 124

SP - 149

EP - 170

JO - Electronic Notes in Theoretical Computer Science

JF - Electronic Notes in Theoretical Computer Science

SN - 1571-0661

IS - 1

ER -