Extensional and Intensional Strategies
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...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2010-01-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1001.4427v1 |
id |
doaj-e929508765c0496282f9cbe32e3d7809 |
---|---|
record_format |
Article |
spelling |
doaj-e929508765c0496282f9cbe32e3d78092020-11-25T00:40:26ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802010-01-0115Proc. WRS 200911910.4204/EPTCS.15.1Extensional and Intensional StrategiesTony BourdierHoratiu CirsteaDaniel DoughertyHélène KirchnerThis 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. http://arxiv.org/pdf/1001.4427v1 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Tony Bourdier Horatiu Cirstea Daniel Dougherty Hélène Kirchner |
spellingShingle |
Tony Bourdier Horatiu Cirstea Daniel Dougherty Hélène Kirchner Extensional and Intensional Strategies Electronic Proceedings in Theoretical Computer Science |
author_facet |
Tony Bourdier Horatiu Cirstea Daniel Dougherty Hélène Kirchner |
author_sort |
Tony Bourdier |
title |
Extensional and Intensional Strategies |
title_short |
Extensional and Intensional Strategies |
title_full |
Extensional and Intensional Strategies |
title_fullStr |
Extensional and Intensional Strategies |
title_full_unstemmed |
Extensional and Intensional Strategies |
title_sort |
extensional and intensional strategies |
publisher |
Open Publishing Association |
series |
Electronic Proceedings in Theoretical Computer Science |
issn |
2075-2180 |
publishDate |
2010-01-01 |
description |
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. |
url |
http://arxiv.org/pdf/1001.4427v1 |
work_keys_str_mv |
AT tonybourdier extensionalandintensionalstrategies AT horatiucirstea extensionalandintensionalstrategies AT danieldougherty extensionalandintensionalstrategies AT helenekirchner extensionalandintensionalstrategies |
_version_ |
1725290120548974592 |