Extensional and Intensional Strategies

Tony Bourdier 1 Horatiu Cirstea 1 Daniel Dougherty 2 Hélène Kirchner 1, 3
1 PAREO - Formal islands: foundations and applications
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
2 WPI CS - Department of Computer Science
3 Inria Bordeaux - Sud-Ouest
Abstract : 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.
Document type :
Journal articles
Complete list of metadatas
https://hal.inria.fr/inria-00494636
Contributor : Helene Kirchner <>
Submitted on : Wednesday, June 23, 2010 - 8:22:53 PM
Last modification on : Thursday, January 11, 2018 - 6:22:10 AM

Links full text

arxiv

Identifiers

Collections

INRIA | INRIA-BORDEAUX | LORIA | UNIV-LORRAINE

Citation

Tony Bourdier, Horatiu Cirstea, Daniel Dougherty, Hélène Kirchner. Extensional and Intensional Strategies. Electronic Proceedings in Theoretical Computer Science, EPTCS, 2010, Reduction Strategies in Rewriting and Programming, 15, pp.1-19. ⟨10.4204/EPTCS.15.1⟩. ⟨inria-00494636⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

287

Contact


archive-ouverte@inria.fr