Books Other

Rewriting Techniques and Applications (Lecture Notes in Computer Science)

5 stars - 10406 reviews / Write a review

Pages: 512

Book format: An electronic version of a printed book that can be read on a computer or handheld device designed specifically for this purpose.

Publisher: Date:10/12/2007 - Springer

By: Unknown

This volume contains the proceedings of RTA-93, the Fifth International Conference on Rewriting Techniques and Applications, held in Montreal, Canada, in June 1993. The volume includes three invited lectures, "Rewrite Techniques in Theorem Proving" (L. Bachmair): "Proving Properties of Typed Lambda Terms: Realizability, Covers, and Sheaves", (J. Gallier): and "On Some Algorithmic Problems for Groups and Monoids", (S.J. Adian). It also features full versions of 29 papers selected from 91 submissions, 6 system descriptions, and a list of open problems in the field. The papers cover many topics: term rewriting: termination: graph rewriting: constraint solving: semantic unification, disunification and combination: higher-order logics: and theorem proving, with several papers on distributed theorem proving, theorem proving with constraints and completion.  


Read online or download a free book: Rewriting Techniques and Applications (Lecture Notes in Computer Science).pdf

Read online book - Rewriting Techniques and Applications (Lecture Notes in Computer Science)Download book - Rewriting Techniques and Applications (Lecture Notes in Computer Science).pdf


Name:
The message text:

Other books