£48.39

Cambridge University Press Term Rewriting & All That

Name: Term Rewriting & All That
Brand: Cambridge University Press
Price: 48.36 GBP
Availability: InStock

Algorithms

Price History & Forecast

Last 51 days • 51 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 51 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £48 (31 days, 60.8%)

Price range: £48 - £48

Price levels: 2 different prices over 51 days

Description

This textbook offers a unified and self-contained introduction to the field of term rewriting. It covers all the basic material (abstract reduction systems, termination, confluence, completion, and combination problems), but also some important and closely connected subjects: universal algebra, unification theory, Gröbner bases and Buchberger's algorithm. The main algorithms are presented both informally and as programs in the functional language Standard ML (an appendix contains a quick and easy introduction to ML). Certain crucial algorithms like unification and congruence closure are covered in more depth and Pascal programs are developed. The book contains many examples and over 170 exercises. This text is also an ideal reference book for professional researchers: results that have been spread over many conference and journal articles are collected together in a unified notation, proofs of almost all theorems are provided, and each chapter closes with a guide to the literature.

Product Specifications

Brand: Cambridge University Press
Format: paperback
ASIN: 0521779200
Category: Books > Subjects > Computing & Internet > Programming > Algorithms
Domain: Amazon UK
Release Date: 21 August 2008
Listed Since: 03 January 2007

Barcode

No barcode data available

Cambridge University Press Term Rewriting & All That

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Advanced Topics in Term Rewriting

Formal Languages and Compilation (Texts in Computer Science)

Transitions and Trees: An Introduction to Structural Operational Semantics

Understanding Machine Learning: From Theory to Algorithms

ML for the Working Programmer

Computational Complexity: A Modern Approach

Automata Theory with Modern Applications

String-Rewriting Systems (Monographs in Computer Science)

Logic of Typed Feature Structures: With Applications to Unification Grammars, Logic Programs and Constraint Resolution: 32 (Cambridge Tracts in Theoretical Computer Science, Series Number 32)

Universal Algebra and Applications in Theoretical Computer Science

Introductory Algebraic Number Theory

Mathematical Analysis of Machine Learning Algorithms

Information Theory, Inference and Learning Algorithms

Set Theory: A First Course (Cambridge Mathematical Textbooks)

Automata Theory with Modern Applications

Transitions and Trees: An Introduction to Structural Operational Semantics

Machine Learning Refined: Foundations, Algorithms, and Applications

Mathematics in Programming

Type Theory and Formal Proof: An Introduction

Computational Complexity: A Conceptual Perspective

Logic for Mathematicians

Mathematical Foundations of Computer Science

Programming Languages: Build, Prove, and Compare

An Introduction to Formal Language Theory (Monographs in Computer Science)