Skip to main content
SpringerLink
Log in

Rewriting Techniques and Applications

13th International Conference, RTA 2002, Copenhagen, Denmark, July 22-24, 2002 Proceedings

  • Conference proceedings
  • © 2002

Overview

Editors:
  1. Sophie Tison

    1. LIFL Bâtiment M3, Université de Lille 1, Villeneuve d’Ascq cedex, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 2378)

Included in the following conference series:

Conference proceedings info: RTA 2002.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (29 papers)

  1. Front Matter

    Pages I-XI
    Download chapter PDF

  2. Invited Talks

    1. Combining Shostak Theories

      • Natarajan Shankar, Harald Rueß
      Pages 1-18

    2. Multiset Rewriting and Security Protocol Analysis

      • John C. Mitchell
      Pages 19-22

    3. Engineering of Logics for the Content-Based Representation of Information

      • Franz Baader
      Pages 23-23

  3. Regular Papers, Application Papers

    1. Axiomatic Rewriting Theory VI: Residual Theory Revisited

      • Paul-André Melliès
      Pages 24-50

    2. Static Analysis of Modularity of β-Reduction in the Hyperbalanced λ-Calculus

      • Richard Kennaway, Zurab Khasidashvili, Adolfo Piperno
      Pages 51-65

    3. Exceptions in the Rewriting Calculus

      • Germain Faure, Claude Kirchner
      Pages 66-82

    4. Deriving Focused Lattice Calculi

      • Georg Struth
      Pages 83-97

    5. Layered Transducing Term Rewriting System and Its Recognizability Preserving Property

      • Hiroyuki Seki, Toshinori Takai, Youhei Fujinaka, Yuichi Kaji
      Pages 98-113

    6. Decidability and Closure Properties of Equational Tree Languages

      • Hitoshi Ohsaki, Toshinori Takai
      Pages 114-128

    7. Regular Sets of Descendants by Some Rewrite Strategies

      • Pierre Réty, Julie Vuotto
      Pages 129-143

    8. Rewrite Games

      • Johannes Waldmann
      Pages 144-158

    9. An Extensional Böhm Model

      • Paula Severi, Fer-Jan de Vries
      Pages 159-173

    10. A Weak Calculus with Explicit Operators for Pattern Matching and Substitution

      • Julien Forest
      Pages 174-191

    11. Tradeoffs in the Intensional Representation of Lambda Terms

      • Chuck Liang, Gopalan Nadathur
      Pages 192-206

    12. Improving Symbolic Model Checking by Rewriting Temporal Logic Formulae

      • David Déharbe, Anamaria Martins Moreira, Christophe Ringeissen
      Pages 207-221

    13. Conditions for Efficiency Improvement by Tree Transducer Composition

      • Janis Voigtländer
      Pages 222-236

    14. Rewriting Strategies for Instruction Selection

      • Martin Bravenboer, Eelco Visser
      Pages 237-251

    15. Probabilistic Rewrite Strategies. Applications to ELAN

      • Olivier Bournez, Claude Kirchner
      Pages 252-266

    16. Loops of Superexponential Lengths in One-Rule String Rewriting

      • Alfons Geser
      Pages 267-280
Back to top

Other volumes

  1. Rewriting Techniques and Applications

Keywords

Editors and Affiliations

  • LIFL Bâtiment M3, Université de Lille 1, Villeneuve d’Ascq cedex, France

    Sophie Tison

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation