Skip to main content
  • Conference proceedings
  • © 2006

Term Rewriting and Applications

17th International Conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006, Proceedings

Editors:

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

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 2006.

Buying options

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (30 papers)

  1. Front Matter

  2. FLoC Plenary Talk

  3. Session 1. Constraints and Optimization

    1. Solving Partial Order Constraints for LPO Termination

      • Michael Codish, Vitaly Lagoon, Peter J. Stuckey
      Pages 4-18
    2. Computationally Equivalent Elimination of Conditions

      • Traian Florin Şerbănuţă, Grigore Roşu
      Pages 19-34
    3. On the Correctness of Bubbling

      • Sergio Antoy, Daniel W. Brown, Su-Hui Chiang
      Pages 35-49
    4. Propositional Tree Automata

      • Joe Hendrix, Hitoshi Ohsaki, Mahesh Viswanathan
      Pages 50-65
  4. Session 2. Equational Reasoning

    1. Generalizing Newman’s Lemma for Left-Linear Rewrite Systems

      • Bernhard Gramlich, Salvador Lucas
      Pages 66-80
    2. Unions of Equational Monadic Theories

      • Piotr Hoffman
      Pages 81-95
    3. Modular Church-Rosser Modulo

      • Jean-Pierre Jouannaud
      Pages 96-107
  5. Session 3. System Verification

    1. Hierarchical Combination of Intruder Theories

      • Yannick Chevalier, Michaël Rusinowitch
      Pages 108-122
    2. Feasible Trace Reconstruction for Rewriting Approximations

      • Yohan Boichut, Thomas Genet
      Pages 123-135
  6. Invited Talk

    1. Rewriting Models of Boolean Programs

      • Ahmed Bouajjani, Javier Esparza
      Pages 136-150
  7. Session 4. Lambda Calculus

    1. A Terminating and Confluent Linear Lambda Calculus

      • Yo Ohta, Masahito Hasegawa
      Pages 166-180
    2. A Lambda-Calculus with Constructors

      • Ariel Arbiser, Alexandre Miquel, Alejandro Ríos
      Pages 181-196
    3. Structural Proof Theory as Rewriting

      • J. Espírito Santo, M. J. Frade, L. Pinto
      Pages 197-211
  8. Session 6. System Descriptions

    1. TPA: Termination Proved Automatically

      • Adam Koprowski
      Pages 257-266

Other Volumes

  1. Term Rewriting and Applications

Keywords

  • Constraint
  • lambda calculus
  • logic
  • optimization
  • proving
  • term rewriting
  • theorem proving
  • verification

Editors and Affiliations

  • Carnegie Mellon University,  

    Frank Pfenning

Bibliographic Information

Buying options

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions