Skip to main content
  • Conference proceedings
  • © 2009

Rewriting Techniques and Applications

20th International Conference, RTA 2009, Brasília, Brazil, June 29 - July 1, 2009 Proceedings

Editors:

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

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

Conference proceedings info: RTA 2009.

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 (27 papers)

  1. Front Matter

  2. Automatic Termination

    • Johannes Waldmann
    Pages 1-16
  3. Loops under Strategies

    • René Thiemann, Christian Sternagel
    Pages 17-31
  4. Proving Termination of Integer Term Rewriting

    • Carsten Fuhs, Jürgen Giesl, Martin Plücker, Peter Schneider-Kamp, Stephan Falke
    Pages 32-47
  5. Dependency Pairs and Polynomial Path Orders

    • Martin Avanzini, Georg Moser
    Pages 48-62
  6. Unique Normalization for Shallow TRS

    • Guillem Godoy, Florent Jacquemard
    Pages 63-77
  7. Proving Confluence of Term Rewriting Systems Automatically

    • Takahito Aoto, Junichi Yoshida, Yoshihito Toyama
    Pages 93-102
  8. A Proof Theoretic Analysis of Intruder Theories

    • Alwen Tiu, Rajeev Goré
    Pages 103-117
  9. YAPA: A Generic Tool for Computing Intruder Knowledge

    • Mathieu Baudet, Véronique Cortier, Stéphanie Delaune
    Pages 148-163
  10. Well-Definedness of Streams by Termination

    • Hans Zantema
    Pages 164-178
  11. A Heterogeneous Pushout Approach to Term-Graph Transformation

    • Dominique Duval, Rachid Echahed, Frédéric Prost
    Pages 194-208
  12. An Explicit Framework for Interaction Nets

    • Marc de Falco
    Pages 209-223
  13. Dual Calculus with Inductive and Coinductive Types

    • Daisuke Kimura, Makoto Tatsuta
    Pages 224-238
  14. Comparing Böhm-Like Trees

    • Jeroen Ketema
    Pages 239-254
  15. The Derivational Complexity Induced by the Dependency Pair Method

    • Georg Moser, Andreas Schnabl
    Pages 255-269
  16. Local Termination

    • Jörg Endrullis, Roel de Vrijer, Johannes Waldmann
    Pages 270-284

Other Volumes

  1. Rewriting Techniques and Applications

Editors and Affiliations

  • Laboratoire PPS, Université Paris Diderot - Paris 7, CNRS, Paris, France

    Ralf Treinen

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