Search Results for: Term Rewriting Systems
Term Rewriting Systems
Author: Terese
Publisher: Cambridge University Press
ISBN: 0521391156
Category: Computers
Page: 926
View: 249
Download NowLanguage: en
Pages: 926
Pages: 926
Term rewriting systems developed out of mathematical logic and are an important part of theoretical computer science. They consist of sequences of discrete transformation steps where one term is replaced with another and have applications in many areas, from functional programming to automatic theorem proving and computer algebra. This 2003
Language: en
Pages: 520
Pages: 520
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
Language: en
Pages: 318
Pages: 318
Unified and self-contained introduction to term-rewriting; suited for students or professionals.
Language: en
Pages: 392
Pages: 392
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
Language: en
Pages: 500
Pages: 500
In recent years, extensions of rewriting techniques that go beyond the traditional untyped algebraic rewriting framework have been investigated and developed. Among these extensions, conditional and typed systems are particularly important, as are higher-order systems, graph rewriting systems, etc. The international CTRS (Conditional and Typed Rewriting Systems) workshops are intended