Scholarly article on topic 'Preface'

Preface Academic research paper on "Computer and information sciences"

CC BY-NC-ND
0
0
Share paper
Keywords
{}

Abstract of research paper on Computer and information sciences, author of scientific article — Bernhard Gramlich, Salvador Lucas

Abstract 2nd International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2002) - Final Proceedings This volume contains the final post-workshop proceedings of the 2nd International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2002). The workshop was held in conjunction withRTA 2002 in Copenhagen, Denmark, on July 21, 2002. Reduction strategies in rewriting and programming have attracted an increasing attention within the last years. New types of reduction strategies have been invented and investigated, and new results on rewriting/computation under particular strategies have been obtained. Research in this field ranges from primarily theoretical questions about reduction strategies to very practical application and implementation issues. The need for a deeper understanding of reduction strategies in rewriting and programming, both in theory and practice, is obvious, since they bridge the gap between unrestricted general rewriting (computation) and (more deterministic) rewriting with particular strategies (programming). Moreover, reduction strategies provide a natural way to go from operational principles (e.g., graph and term rewriting, narrowing, lambda-calculus) and semantics (e.g., normalization, computation of values, infinitary normalization, head-normalization) to implementations of programming languages. Therefore any progress in this area is likely to be of interest not only to the rewriting community, but also to neighbouring fields like functional programming, functional-logic programming, and termination proofs of algorithms. WRS 2002 is the second edition in a series of workshops intended to stimulate and promote research and progress in this important field. The workshop wants to provide a forum for the presentation and discussion of new ideas and results, recent developments, new research directions, as well as of surveys on existing knowledge in this area. Furthermore we aim at fostering interaction and exchange between researchers and students actively working on such topics. WRS 2001 took place in Utrecht, The Netherlands, on May 26, 2001. Topics of interest for the workshop included, but were not restricted to, theoretical foundations for the definition and semantic description of reduction strategies, strategies in different frameworks (term rewriting, graph rewriting, infinitary rewriting, lambda calculi, higher order rewriting and explicit substitutions, conditional rewriting, rewriting with built-ins, narrowing, constraint solving, etc.) and their application in (equational, functional, functional-logic) programming (languages), properties of reduction strategies/computations under strategies (e.g., completeness, computability, decidability, complexity, optimality, (hyper-)normalization, cofinality, fairness, perpetuality, context-freeness, neededness, laziness, eagerness, strictness), interrelations, combinations and applications of reduction under different strategies (e.g., equivalence conditions for fundamental properties like termination and confluence, applications in modularity analysis, connections between strategies of different frameworks, etc.), program analysis and other semantics-based optimization techniques dealing with reduction strategies, rewrite systems/tools/implementations with flexible/programmable strategies as essential concept/ingredient, specification of reduction strategies in (real) languages, data structures and implementation techniques for reduction strategies. The program committee received ten submissions. Based on the careful refereeing process for WRS 2002, the following regular papers have been accepted for inclusion in the final post-workshop proceedings, published in this volume of Electronic Notes in Theoretical Computer Science: An Operational Semantics for Declarative Multi-Paradigm Languages by Elvira Albert, Michael Hanus, Frank Huch, Javier Oliver, and Germán Vidal Applying ELAN Strategies in Simulating Processors over Simple Architectures by Mauricio Ayala-Rincón, Rinaldi Maya Neto, Ricardo P. Jacobi, Carlos H. Llanos, and Reiner W. Hartenstein Term Rewriting with Type-safe Traversal Functions by Mark G.J. van den Brand, Paul Klint, and Jurgen J. Vinju An Abstract Böhm-normalization by John Glauert and Zurab Khasidashvili The Sketch of a Polymorphic Symphony by Ralf Lämmel Strategies for Source-to-Source Constant Progagation by Karina Olmos and Eelco Visser Regular Sets of Descendants by Leftmost Strategy by Pierre Réty and Julie Vuotto Furthermore, this volume also contains the following invited papers Approximations for Strategies and Termination by Aart Middeldorp Optimal Strategies in Higher-Order Rewriting by Vincent van Oostrom and Roel de Vrijer The program committee of WRS 2002 consisted of program committee Sergio Antoy Portland State University (USA) Roberto di Cosmo Université de Paris VII (France) Bernhard Gramlich (co-chair) TU Wien (Austria) Michael Hanus Christian-Albrechts-Universität zu Kiel (Germany) Claude Kirchner LORIA Paul Klint CWI Amsterdam (The Netherlands) Salvador Lucas (co-chair) TU Valencia (Spain) Manfred Schmidt-Schauss Johann Wolfgang Goethe-Universität, Frankfurt a.M. (Germany) Yoshihito Toyama U Tohoku (Japan) Regarding the refereeing process we are very grateful to the program committee and to the additional external referees: María Alpuente, César Ferri, Matthias Mann, Huy Nguyen, and Ricardo Peña. Furthermore we would like to thank Michael Mislove, Managing Editor of the ENTCS series, for his technical assistance with using the ENTCS format. December 10, 2002 Bernhard Gramlich and Salvador Lucas

Academic research paper on topic "Preface"

Available online atwww.sciencedirect.com

Electronic Notes in Theoretical Computer Science

ELSEVIER Electronic Notes in Theoretical Computer Science

www.elsevier.com/locate/entcs

Preface

Volume 70, Issue 6

Bernhard Grämlich andSalvador Lucas

Abstract

2nd International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2002) - Final ProceedingsThis volume contains the final post-workshop proceedings of the 2nd International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2002). The workshop was held in conjunction withRTA 2002 in Copenhagen, Denmark, on July 21, 2002.

Reduction strategies in rewriting and programming have attracted an increasing attention within the last years. New types of reduction strategies have been invented and investigated, and new results on rewriting/computation under particular strategies have been obtained. Research in this field ranges from primarily theoretical questions about reduction strategies to very practical application and implementation issues. The need for a deeper understanding of reduction strategies in rewriting and programming, both in theory and practice, is obvious, since they bridge the gap between unrestricted general rewriting (computation) and (more deterministic) rewriting with particular strategies (programming). Moreover, reduction strategies provide a natural way to go from operational principles (e.g., graph and term rewriting, narrowing, lambda-calculus) and semantics (e.g., normalization, computation of values, infinitary normalization, head-normalization) to implementations of programming languages. Therefore any progress in this area is likely to be of interest not only to the rewriting community, but also to neighbouring fields like functional programming, functional-logic programming, and termination proofs of algorithms. WRS 2002 is the second edition in a series of workshops intended to stimulate and promote research and progress in this important field. The workshop wants to provide a forum for the presentation and discussion of new ideas and results, recent developments, new research directions, as well as of surveys on existing knowledge in this area. Furthermore we aim at fostering interaction and exchange between researchers and students actively working on such topics. WRS 2001 took place in Utrecht, The Netherlands, on May 26, 2001.

Topics of interest for the workshop included, but were not restricted to,

theoretical foundations for the definition and semantic description of reduction strategies,

strategies in different frameworks (term rewriting, graph rewriting, infinitary rewriting, lambda calculi, higher order rewriting and explicit substitutions, conditional rewriting, rewriting with built-ins, narrowing, constraint solving, etc.) and their application in (equational, functional, functional-logic) programming (languages),

properties of reduction strategies/computations under strategies (e.g., completeness, com-putability, decidability, complexity, optimality, (hyper-)normalization, cofinality, fairness, perpetuality, context-freeness, neededness, laziness, eagerness, strictness), interrelations, combinations and applications of reduction under different strategies (e.g., equivalence conditions for fundamental properties like termination and confluence, applications in modularity analysis, connections between strategies of different frameworks, etc.),

1571-0661/$ - see front matter ©

10.1016/S1571-0661(05)80607-3

Volume • Number

program analysis and other semantics-based optimization techniques dealing with reduction strategies,

rewrite systems/tools/implementations with flexible/programmable strategies as essential concept/ingredient, specification of reduction strategies in (real) languages, data structures and implementation techniques for reduction strategies.

The program committee received ten submissions. Based on the careful refereeing process for WRS 2002, the following regular papers have been accepted for inclusion in the final post-workshop proceedings, published in this volume of Electronic Notes in Theoretical Computer Science:

An Operational Semantics for Declarative Multi-Paradigm Languages

by Elvira Albert, Michael Hanus, Frank Huch, Javier Oliver, and German Vidal Applying ELAN Strategies in Simulating Processors over Simple Architectures

by Mauricio Ayala-Rincon, Rinaldi Maya Neto, Ricardo P. Jacobi, Carlos H. Llanos, and Reiner W. Hartenstein

Term Rewriting with Type-safe Traversal Functions

by Mark G.J. van den Brand, Paul Klint, and Jurgen J. Vinju An Abstract Bohm-normalization

by John Glauert and Zurab Khasidashvili The Sketch of a Polymorphic Symphony

by Ralf Lammel Strategies for Source-to-Source Constant Progagation by Karina Olmos and Eelco Visser

Regular Sets of Descendants by Leftmost Strategy

by Pierre Rety and Julie Vuotto

Furthermore, this volume also contains the following invited papers

Approximations for Strategies and Termination

by Aart Middeldorp Optimal Strategies in Higher-Order Rewriting

by Vincent van Oostrom and Roel de Vrijer

The program committee of WRS 2002 consisted of program committee

Sergio Antoy Portland State University (USA)

Roberto di Cosmo Universite de Paris VII (France)

Bernhard Gramlich (co-chair) TU Wien (Austria) Michael Hanus Christian-Albrechts-Universitat zu Kiel (Germany)

Claude Kirchner LORIA

Paul Klint CWI Amsterdam (The Netherlands)

Salvador Lucas (co-chair) TU Valencia (Spain)

Manfred Schmidt-Schauss Johann Wolfgang Goethe-Universitat, Frankfurt a.M. (Germany)

Yoshihito Toyama U Tohoku (Japan)

Regarding the refereeing process we are very grateful to the program committee and to the additional external referees: Maria Alpuente, Cesar Ferri, Matthias Mann, Huy Nguyen, and Ricardo Pena. Furthermore we would like to thank Michael Mislove, Managing Editor of the ENTCS series, for his technical assistance with using the ENTCS format. December 10, 2002

Bernhard Gramlich and Salvador Lucas