Cambridge Term Rewriting & All That - Mathematics Textbook - Image 1

£52.66

Cambridge University Press Cambridge Term Rewriting & All That - Mathematics Textbook

Name: Cambridge Term Rewriting & All That - Mathematics Textbook
Brand: Cambridge University Press
Price: 52.66 GBP
Availability: InStock

Reference

Pricier than usual. £2 more than the 30-day average — we'd wait.

£53 today · 30-day average £51 · all-time low £48

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 90 days · 90 data points

Historical

Generating forecast…

Price Distribution

Price distribution over 90 days • 5 price levels

Days at Price

Current Price

Price Analysis

Most common price: £48 (35 days, 38.9%)

Price range: £48 - £53

Price levels: 5 different prices over 90 days

Description

Expand your mathematical knowledge with Term Rewriting & All That, a comprehensive textbook from Cambridge University Press. This volume provides a unified and self-contained introduction to the field of term rewriting, making it an essential resource for students and researchers in mathematics and computer science. The text covers all fundamental material, including abstract reduction systems, termination, confluence, completion, and combination problems. To provide a well-rounded perspective, the book also explores connected subjects such as universal algebra, unification theory, Grobner bases, and Buchberger's algorithm. Designed for practical application, the main algorithms are presented through both informal explanations and functional programming in Standard ML. For those new to the language, an appendix provides a quick and easy introduction to ML. This textbook serves as a complete guide for understanding complex processes like unification and congruence closure in a structured, academic format.

Key Features

Comprehensive coverage of term rewriting basics including abstract reduction systems, termination, and confluence.

Explores connected mathematical subjects such as universal algebra, unification theory, and Grobner bases.

Includes practical algorithm presentations using the Standard ML functional programming language.

Features a dedicated appendix providing a quick and easy introduction to the ML programming language.

Covers essential mathematical processes such as unification and congruence closure algorithms.

Product Specifications

Brand: Cambridge University Press
Format: paperback
ASIN: 0521779200
Category: Books > Subjects > Science, Nature & Maths > Mathematics > Reference
Domain: Amazon UK
Release Date: 21 August 2008
Listed Since: 03 January 2007

Barcode

No barcode data available

Cambridge University Press Cambridge Term Rewriting & All That - Mathematics Textbook

Pricier than usual. £2 more than the 30-day average — we'd wait.

Price History & Forecast

Price Distribution

Price Analysis

Description

Key Features

Product Specifications

Barcode

Similar Products You Might Like

Advanced Topics in Term Rewriting

Fundamentals of Logic and Computation: With Practical Automated Reasoning and Verification (Texts in Computer Science)

Springer - Reverse Mathematics: Problems, Reductions, and Proofs

Decidability of Logical Theories and Their Combination (Studies in Universal Logic)

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity

String-Rewriting Systems (Monographs in Computer Science)

Relational and Kleene-Algebraic Methods in Computer Science: 7th International Seminar on Relational Methods in Computer Science and 2nd International ... (Lecture Notes in Computer Science, 3051)

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)

Constructive Models (Siberian School of Algebra and Logic)

Constructive Models (Siberian School of Algebra and Logic)

Reverse Mathematics: Problems, Reductions, and Proofs (Theory and Applications of Computability)

Concise Guide to Formal Methods: Theory, Fundamentals and Industry Applications (Undergraduate Topics in Computer Science)

Mathematical Logic and Formalized Theories: A Survey of Basic Concepts and Results

Turing Computability: Theory and Applications (Theory and Applications of Computability)

Mathematical Aspects of Logic Programming Semantics (Chapman & Hall/CRC Studies in Informatics Series)

Processes, Terms and Cycles: Steps on the Road to Infinity: Essays Dedicated to Jan Willem Klop on the Occasion of his 60th Birthday: 3838 (Lecture Notes in Computer Science, 3838)

Logique mathématique - Tome 2 - Fonctions récursives, théorème de Gödel, théorie des ensembles: T 2 - Fonctions récursives, théorème de Gödel, théorie des ensembles

Mathematics of Discrete Structures for Computer Science

Mathematical Logic: Exercises and Solutions (Problem Books in Mathematics)

Combinators, λ-Terms and Proof Theory: 42 (Synthese Library, 42)

Introduction to Mathematical Logic: Set Theory Computable Functions Model Theory (Undergraduate Texts in Mathematics)

Mathematical Logic: 291 (Graduate Texts in Mathematics, 291)

Derivation and Computation: Taking the Curry-Howard Correspondence Seriously: 51 (Cambridge Tracts in Theoretical Computer Science, Series Number 51)