[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
Springer Nature Link
Log in

Term Rewriting and Applications

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

  • Conference proceedings
  • © 2006

Overview

Editors:
  1. Frank Pfenning

    1. Carnegie Mellon University,  

    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 4098)

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

Included in the following conference series:

Conference proceedings info: RTA 2006.

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

Access this book

Log in via an institution
Softcover Book GBP 44.99
Price includes VAT (United Kingdom)
  • 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

Keywords

Table of contents (30 papers)

  1. Front Matter

    Download chapter PDF

  2. FLoC Plenary Talk

    1. Formal Verification of Infinite State Systems Using Boolean Methods

      • Randal E. Bryant
      Pages 1-3

  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. Syntactic Descriptions: A Type System for Solving Matching Equations in the Linear λ-Calculus

      • Sylvain Salvati
      Pages 151-165

    2. A Terminating and Confluent Linear Lambda Calculus

      • Yo Ohta, Masahito Hasegawa
      Pages 166-180

    3. A Lambda-Calculus with Constructors

      • Ariel Arbiser, Alexandre Miquel, Alejandro Ríos
      Pages 181-196

    4. Structural Proof Theory as Rewriting

      • J. Espírito Santo, M. J. Frade, L. Pinto
      Pages 197-211

  9. Session 6. System Descriptions

    1. TPA: Termination Proved Automatically

      • Adam Koprowski
      Pages 257-266
Back to top

Other volumes

  1. Term Rewriting and Applications

Editors and Affiliations

  • Carnegie Mellon University,  

    Frank Pfenning

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation