Skip to main content
SpringerLink
Log in

Conditional Term Rewriting Systems

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

  • Conference proceedings
  • © 1993

Overview

Editors:
  1. Michaël Rusinowitch
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Jean-Luc Rémy
    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 656)

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

  1. Front Matter

    Download chapter PDF

  2. Algebraic semantics of rewriting terms and types

    • Karl Meinke
    Pages 1-20

  3. Context rewriting

    • Stefan Kahrs
    Pages 21-35

  4. Explicit cyclic substitutions

    • Kristoffer Høgsbro Rose
    Pages 36-50

  5. Simple type inference for term graph rewriting systems

    • R. Banach
    Pages 51-66

  6. Consistency and semantics of equational definitions over predefined algebras

    • Valentin Antimirov, Anatoli Degtyarev
    Pages 67-81

  7. Completeness of combinations of conditional constructor systems

    • Aart Middeldorp
    Pages 82-96

  8. Collapsed tree rewriting: Completeness, confluence, and modularity

    • Detlef Plump
    Pages 97-112

  9. Combinations of simplifying conditional term rewriting systems

    • Enno Ohlebusch
    Pages 113-127

  10. Sufficient conditions for modular termination of conditional term rewriting systems

    • Bernhard Gramlich
    Pages 128-142

  11. Termination of combined (rewrite and λ-calculus) systems

    • Carlos Loria-Saenz, Joachim Steinbach
    Pages 143-147

  12. Type removal in term rewriting

    • H. Zantema
    Pages 148-154

  13. Termination of term rewriting by interpretation

    • H. Zantema
    Pages 155-167

  14. Path orderings for termination of associative-commutative rewriting

    • Nachum Dershowitz, Subrata Mitra
    Pages 168-174

  15. Generic induction proofs

    • Peter Padawitz
    Pages 175-197

  16. A constructor-based approach for positive/negative-conditional equational specifications

    • Claus-Peter Wirth, Bernhard Gramlich
    Pages 198-212

  17. Semantics for positive/negative conditional rewrite systems

    • Klaus Becker
    Pages 213-225

  18. Inductive theorem proving by consistency for first-order clauses

    • Harald Ganzinger, Jürgen Stuber
    Pages 226-241

  19. Reduction techniques for first-order reasoning

    • Francois Bronsard, Uday S. Reddy
    Pages 242-256

  20. Conditional term rewriting and first-order theorem proving

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

Keywords

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

Publish with us

Policies and ethics

Back to top

Search

Navigation