## Conditional Term Rewriting Systems: Third International Workshop, CTRS-92, Pont-a-Mousson, France, July 8-10, 1992. ProceedingsMichael Rusinowitch, Jean-Luc Remy 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. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

I | 1 |

II | 21 |

III | 36 |

IV | 51 |

V | 67 |

VI | 82 |

VII | 97 |

VIII | 113 |

XXII | 302 |

XXIII | 307 |

XXIV | 315 |

XXV | 328 |

XXVI | 343 |

XXVII | 357 |

XXVIII | 363 |

XXIX | 378 |

IX | 128 |

X | 143 |

XI | 148 |

XII | 155 |

XIII | 168 |

XIV | 175 |

XV | 198 |

XVI | 213 |

XVII | 226 |

XVIII | 242 |

XIX | 257 |

XX | 272 |

XXI | 287 |

XXX | 393 |

XXXI | 408 |

XXXII | 424 |

XXXIII | 429 |

XXXIV | 430 |

XXXV | 438 |

XXXVI | 448 |

XXXVII | 458 |

XXXVIII | 468 |

XXXIX | 483 |

XL | 498 |

### Other editions - View all

### Common terms and phrases

algebra algorithm allow applied approach assume atom axioms basic called canonical clauses collapsed combinator complete Computer Science conclusion condition confluent consider consists construction constructor contains context corresponding critical pair decidable defined Definition denoted derivation equality equations equivalent example exists expression extended finite given goal graph ground ground terms Hence holds implies induction inference infinite instance interpretation introduced language Lemma linear literals logic means method modular multiset narrowing node normal form Note notion object obtained occur operation ordering position possible present problem procedure proof Proposition proving reduction relation replaced require respect restriction rewrite rule satisfies semantics sequence side signature simple simplifying sort specification step structure substitution subterm Suppose term rewriting systems terminating theorem theory trace transformation tree true unifier University valid variables