Conditional and Typed Rewriting Systems: 4th International Workshop, CTRS-94 Jerusalem, Israel, July 13–15, 1994 Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This book presents throroughly revised full versions of the 21 papers accepted for the Fourth International Workshop on Conditional and Typed Rewriting Systems, CTRS-94, held in conjunction with ICALP '94 in Jerusalem, Israel, in July 1994.
The volume reports the research advances in the area of rewriting in general achieved since the predecessor workshop held in July 1992. Among the topics addressed are conditional term rewriting, typed systems, higher-order rewriting, graph rewriting, combinator-based languages, and constrained rewriting.

Author(s): Leo Bachmair, Harald Ganzinger (auth.), Nachum Dershowitz, Naomi Lindenstrauss (eds.)
Series: Lecture Notes in Computer Science 968
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1995

Language: English
Pages: 384
Tags: Mathematical Logic and Formal Languages; Programming Languages, Compilers, Interpreters; Artificial Intelligence (incl. Robotics); Logics and Meanings of Programs

Associative-commutative superposition....Pages 1-14
A calculus for rippling....Pages 15-30
Equation solving in geometrical theories....Pages 31-50
LSE narrowing for decreasing conditional term rewrite systems....Pages 51-70
Preserving confluence for rewrite systems with built-in operations....Pages 71-88
Hierarchical termination....Pages 89-105
Well-foundedness of term orderings....Pages 106-123
A new characterisation of AC-termination and application....Pages 124-143
Relative normalization in orthogonal expression reduction systems....Pages 144-165
On termination and confluence of conditional rewrite systems....Pages 166-185
How to transform canonical decreasing CTRSs into equivalent canonical TRSs....Pages 186-205
Termination for restricted derivations and conditional rewrite systems....Pages 206-222
Rewriting for preorder relations....Pages 223-234
Strong sequentiality of left-linear overlapping rewrite systems....Pages 235-246
A conflict between call-by-need computation and parallelism....Pages 247-261
The complexity of testing ground reducibility for linear word rewriting systems with variables....Pages 262-275
Coherence for cartesian closed categories: A sequential approach....Pages 276-295
Modular properties of constructor-sharing conditional term rewriting systems....Pages 296-315
Church-Rosser property and unique normal form property of non-duplicating term rewriting systems....Pages 316-331
The transformation of term rewriting systems based on well-formedness preserving mappings....Pages 332-352
Abstract notions and inference systems for proofs by mathematical induction....Pages 353-373