skip to main content

Extensional and Intensional Strategies

Bourdier, Tony ; Cirstea, Horatiu ; Dougherty, Daniel ; Kirchner, Hélène

Electronic proceedings in theoretical computer science, 2010-01, Vol.15 (Proc. WRS 2009), p.1-19

EPTCS

Texto completo disponível

Citações Citado por
  • Título:
    Extensional and Intensional Strategies
  • Autor: Bourdier, Tony ; Cirstea, Horatiu ; Dougherty, Daniel ; Kirchner, Hélène
  • Assuntos: Computer Science ; Logic in Computer Science
  • É parte de: Electronic proceedings in theoretical computer science, 2010-01, Vol.15 (Proc. WRS 2009), p.1-19
  • Descrição: 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.
  • Editor: EPTCS
  • Idioma: Inglês

Buscando em bases de dados remotas. Favor aguardar.