Skip to main content
  • Conference proceedings
  • © 1993

Conditional Term Rewriting Systems

Third International Workshop, CTRS-92, Pont-a-Mousson, France, July 8-10, 1992. Proceedings

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

Buy it now

Buying options

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

  1. Front Matter

  2. Context rewriting

    • Stefan Kahrs
    Pages 21-35
  3. Explicit cyclic substitutions

    • Kristoffer Høgsbro Rose
    Pages 36-50
  4. Consistency and semantics of equational definitions over predefined algebras

    • Valentin Antimirov, Anatoli Degtyarev
    Pages 67-81
  5. Termination of combined (rewrite and λ-calculus) systems

    • Carlos Loria-Saenz, Joachim Steinbach
    Pages 143-147
  6. Type removal in term rewriting

    • H. Zantema
    Pages 148-154
  7. Path orderings for termination of associative-commutative rewriting

    • Nachum Dershowitz, Subrata Mitra
    Pages 168-174
  8. Generic induction proofs

    • Peter Padawitz
    Pages 175-197
  9. Inductive theorem proving by consistency for first-order clauses

    • Harald Ganzinger, Jürgen Stuber
    Pages 226-241
  10. Reduction techniques for first-order reasoning

    • Francois Bronsard, Uday S. Reddy
    Pages 242-256
  11. Conditional term rewriting and first-order theorem proving

    • David A. Plaisted, Geoffrey D. Alexander, Heng Chu, Shie-Jue Lee
    Pages 257-271

About this book

This volume contains the papers preesented at the Third International Workshop on Conditional Term Rewriting Systems, held in Pont- -Mousson, France, July 8-10, 1992. Topics covered include conditional rewriting and its applications to programming languages, specification languages, automated deduction, constrained rewriting, typed rewriting, higher-order rewriting, and graph rewriting. The volume contains 40 papers, including four invited talks: Algebraic semantics of rewriting terms and types, by K. Meinke; Generic induction proofs, by P. Padawitz; Conditional term rewriting and first-order theorem proving, by D. Plaisted; and Decidability of finiteness properties (abstract), by L. Pacholski. The first CTRS workshop was held at the University of Paris in 1987 and the second at Concordia University, Montreal, in 1990. Their proceddings are published as Lecture Notes in Computer Science Volumes 308 and 516 respectively.

Bibliographic Information

Buy it now

Buying options

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