TY - JOUR
T1 - Strategy construction in the higher-order framework of TL
AU - Winter, Victor L.
N1 - Funding Information:
1 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. 2 Email: [email protected]
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
AN - SCOPUS:13944281059
SN - 1571-0661
VL - 124
SP - 149
EP - 170
JO - Electronic Notes in Theoretical Computer Science
JF - Electronic Notes in Theoretical Computer Science
IS - 1
T2 - Proceedings of the Fifth International Workshop on Rule-Based Programming (RULE 2004)
Y2 - 1 June 2004 through 1 June 2004
ER -