• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Term Rewriting Systems

Term Rewriting Systems

Hardcover

Series: Cambridge Tracts in Theoretical Computer Science, Book 55

Programming

ISBN10: 0521391156
ISBN13: 9780521391153
Publisher: Cambridge University Press
Published: Mar 20 2003
Pages: 908
Weight: 3.56
Height: 1.81 Width: 6.12 Depth: 9.18
Language: English
Term rewriting systems, which developed out of mathematical logic, consist of sequences of discrete steps where one term is replaced with another. Their many applications range from automatic theorem proving systems to computer algebra. This book begins with several examples, followed by a chapter on basic notions that provides a foundation for the rest of the work. First-order and higher-order theories are presented, with much of the latter material appearing for the first time in book form. Subjects treated include orthogonality, termination, lambda calculus and term graph rewriting. There is also a chapter detailing the required mathematical background.

Also in

Programming