Skip to main content
  • Conference proceedings
  • © 2002

Rewriting Techniques and Applications

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

Editors:

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

Conference series link(s): RTA: International Conference on Rewriting Techniques and Applications

Conference proceedings info: RTA 2002.

Buy it now

Buying options

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

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

Table of contents (29 papers)

  1. Front Matter

    Pages I-XI
  2. Invited Talks

    1. Combining Shostak Theories

      • Natarajan Shankar, Harald Rueß
      Pages 1-18
  3. Regular Papers, Application Papers

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

      • Richard Kennaway, Zurab Khasidashvili, Adolfo Piperno
      Pages 51-65
    2. Exceptions in the Rewriting Calculus

      • Germain Faure, Claude Kirchner
      Pages 66-82
    3. Deriving Focused Lattice Calculi

      • Georg Struth
      Pages 83-97
    4. Layered Transducing Term Rewriting System and Its Recognizability Preserving Property

      • Hiroyuki Seki, Toshinori Takai, Youhei Fujinaka, Yuichi Kaji
      Pages 98-113
    5. Decidability and Closure Properties of Equational Tree Languages

      • Hitoshi Ohsaki, Toshinori Takai
      Pages 114-128
    6. Regular Sets of Descendants by Some Rewrite Strategies

      • Pierre Réty, Julie Vuotto
      Pages 129-143
    7. Rewrite Games

      • Johannes Waldmann
      Pages 144-158
    8. An Extensional Böhm Model

      • Paula Severi, Fer-Jan de Vries
      Pages 159-173
    9. Tradeoffs in the Intensional Representation of Lambda Terms

      • Chuck Liang, Gopalan Nadathur
      Pages 192-206
    10. Improving Symbolic Model Checking by Rewriting Temporal Logic Formulae

      • David Déharbe, Anamaria Martins Moreira, Christophe Ringeissen
      Pages 207-221
    11. Rewriting Strategies for Instruction Selection

      • Martin Bravenboer, Eelco Visser
      Pages 237-251
    12. Probabilistic Rewrite Strategies. Applications to ELAN

      • Olivier Bournez, Claude Kirchner
      Pages 252-266

Other Volumes

  1. Rewriting Techniques and Applications

Editors and Affiliations

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

    Sophie Tison

Bibliographic Information

Buy it now

Buying options

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