2010/01/25 by Tony Bourdier, Horatiu Cirstea, Daniel J. Dougherty +3 · 14 citations
Computer Science · #Advanced Algebra and Logic #Artificial intelligence #Characterization (materials science) #Class (philosophy) #Computer science #Extensional definition #Geology #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Physics #Programming language #Set (abstract data type) #cs.GT #cs.LO #cs.PL
paper · pdf · doi:10.4204/eptcs.15.1
published in Electronic Proceedings in Theoretical Computer Science 15, 1-19 (Open Publishing Association)
arxiv created 2010/01/25 · openalex publication_date 2010/01/26 · arxiv updated 2010/02/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/06
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.