Advertisement

Term Rewriting and Applications

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

  • Frank Pfenning

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

Table of contents

  1. Front Matter
  2. FLoC Plenary Talk

  3. Session 1. Constraints and Optimization

    1. Michael Codish, Vitaly Lagoon, Peter J. Stuckey
      Pages 4-18
    2. Traian Florin Şerbănuţă, Grigore Roşu
      Pages 19-34
    3. Sergio Antoy, Daniel W. Brown, Su-Hui Chiang
      Pages 35-49
    4. Joe Hendrix, Hitoshi Ohsaki, Mahesh Viswanathan
      Pages 50-65
  4. Session 2. Equational Reasoning

    1. Bernhard Gramlich, Salvador Lucas
      Pages 66-80
    2. Piotr Hoffman
      Pages 81-95
    3. Jean-Pierre Jouannaud
      Pages 96-107
  5. Session 3. System Verification

    1. Yannick Chevalier, Michaël Rusinowitch
      Pages 108-122
    2. Yohan Boichut, Thomas Genet
      Pages 123-135
  6. Invited Talk

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

    1. Yo Ohta, Masahito Hasegawa
      Pages 166-180
    2. Ariel Arbiser, Alexandre Miquel, Alejandro Ríos
      Pages 181-196
    3. J. Espírito Santo, M. J. Frade, L. Pinto
      Pages 197-211
  8. Session 5. Theorem Proving

  9. Session 6. System Descriptions

    1. Adam Koprowski
      Pages 257-266
    2. Yuki Chiba, Takahito Aoto
      Pages 267-276
    3. Mathieu Turuani
      Pages 277-286
    4. Ian Wehrman, Aaron Stump, Edwin Westbrook
      Pages 287-296
  10. Invited Talk

    1. Jürgen Giesl, Stephan Swiderski, Peter Schneider-Kamp, René Thiemann
      Pages 297-312
  11. Session 7. Termination

    1. Nao Hirokawa, Aart Middeldorp
      Pages 313-327
    2. Dieter Hofbauer, Johannes Waldmann
      Pages 328-342
    3. Olivier Bournez, Florent Garnier
      Pages 357-371
  12. Session 8. Higher-Order Rewriting and Unification

    1. Jean-Pierre Jouannaud, Albert Rubio
      Pages 387-399
    2. Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret
      Pages 400-414
  13. Back Matter

About these proceedings

Keywords

Constraint lambda calculus logic optimization proving term rewriting theorem proving verification

Editors and affiliations

  • Frank Pfenning
    • 1
  1. 1.Carnegie Mellon University 

Bibliographic information

  • DOI https://doi.org/10.1007/11805618
  • Copyright Information Springer-Verlag Berlin Heidelberg 2006
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-36834-2
  • Online ISBN 978-3-540-36835-9
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site