Abstract
In a strategic framework, combinators provide a fundamental mechanism for exercising control over rewriting. This type of control is based on the observation of the success or failure of strategy application. This paper describes a framework where information relating to the outcome of strategy application is stored in two internally maintained stacks. These stacks represent an implicit state which is used to control the rewriting process.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 135-149 |
| Number of pages | 15 |
| Journal | Electronic Notes in Theoretical Computer Science |
| State | Published - 2007 |
| Event | 7th International Workshop on Reduction Strategies in Rewriting and Programming, WRS 2007, as part of the 4th Federated Conference on Rewriting, Deduction, and Programming, RDP 2007 - Paris, France Duration: Jun 25 2007 → Jun 25 2007 |
Keywords
- HATS
- Program transformation
- Strategic programming
- TL
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science