Extensional and Intensional Strategies

Tony Bourdier
(INRIA Nancy Grand-Est)
Horatiu Cirstea
(INRIA Nancy Grand-Est)
Daniel Dougherty
(Worcester Polytechnic Institute)
Hélène Kirchner
(INRIA Bordeaux Sud-Ouest)

This paper is a contribution to the theoretical foundations of strategies. We first present a general definition of abstract strategies which is extensional in the sense that a strategy is defined explicitly as a set of derivations of an abstract reduction system. We then move to a more intensional definition supporting the abstract view but more operational in the sense that it describes a means for determining such a set. We characterize the class of extensional strategies that can be defined intensionally. We also give some hints towards a logical characterization of intensional strategies and propose a few challenging perspectives.

In Maribel Fernández: Proceedings Ninth International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2009), Brasilia, Brazil, 28th June 2009, Electronic Proceedings in Theoretical Computer Science 15, pp. 1–19.
Published: 26th January 2010.

ArXived at: http://dx.doi.org/10.4204/EPTCS.15.1 bibtex PDF

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org