Skip to main content
SpringerLink
Log in
Book cover

Rewriting Techniques and Applications

10th International Conference, RTA'99, Trento, Italy, July 2-4, 1999, Proceedings

  • Conference proceedings
  • © 1999

Overview

Editors:
  1. Paliath Narendran

    1. Department of Computer Science, University at Albany — SUNY, Albany, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Michael Rusinowitch

    1. LORIA — INRIA Lorraine 615, rue du Jardin Botanique, Cedex, France

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

Included in the following conference series:

Conference proceedings info: RTA 1999.

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

Access this book

Log in via an institution
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

Licence this eBook for your library

Institutional subscriptions

Table of contents (30 papers)

  1. Front Matter

    Pages I-X
    Download chapter PDF

  2. Session 1

    1. Solved Forms for Path Ordering Constraints

      • Robert Nieuwenhuis, José Miguel Rivero
      Pages 1-15

    2. Jeopardy

      • Nachum Dershowitz, Subrata Mitra
      Pages 16-29

    3. Strategic Pattern Matching

      • Eelco Visser
      Pages 30-44

  3. Session 2:

    1. On the Strong Normalization of Natural Deduction with Permutation-Conversions

      • Philippe de Groote
      Pages 45-59

    2. Normalisation in Weakly Orthogonal Rewriting

      • Vincent van Oostrom
      Pages 60-74

    3. Strong Normalization of Proof Nets Modulo Structural Congruences

      • Roberto Di Cosmo, Stefano Guerrini
      Pages 75-89

  4. Session 3: Invited Talk

    1. Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas

      • Bruno Courcelle
      Pages 90-91

  6. Session 5:

    1. A Fully Syntactic AC-RPO

      • Albert Rubio
      Pages 133-147

    2. Theory Path Orderings

      • Jürgen Stuber
      Pages 148-162

    3. A Characterisation of Multiply Recursive Functions with Higman’s Lemma

      • Héléne Touzet
      Pages 163-174

  7. Session 6:

    1. Deciding the Word Problem in the Union of Equational Theories Sharing Constructors

      • Franz Baader, Cesare Tinelli
      Pages 175-189

    2. Normalization via Rewrite Closures

      • L. Bachmair, C. R. Ramakrishnan, I. V. Ramakrishnan, A. Tiwari
      Pages 190-204

    3. Test Sets for the Universal and Existential Closure of Regular Tree Languages

      • Dieter Hofbauer, Maria Huber
      Pages 205-219

  8. Session 7: Invited Tutorial

    1. Higher-Order Rewriting

      • Femke van Raamsdonk
      Pages 220-239

  9. Session 8: System Descriptions

    1. The Maude System

      • M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer et al.
      Pages 240-243

    2. TOY: A Multiparadigm Declarative System

      • F. J. López Fraguas, J. Sánchez Hernández
      Pages 244-247
Back to top

Other volumes

  1. Rewriting Techniques and Applications

Keywords

Editors and Affiliations

  • Department of Computer Science, University at Albany — SUNY, Albany, USA

    Paliath Narendran

  • LORIA — INRIA Lorraine 615, rue du Jardin Botanique, Cedex, France

    Michael Rusinowitch

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation