Lecture Notes in Computer Science

12th International Conference, RTA 2001, Utrecht, The Netherlands, May 22-24, 2001. Proceedings

By: Aart Middeldorp (Editor)

Write A Review

Paperback | 9 May 2001

At a Glance

Paperback
380 Pages

Dimensions(cm)
22.86 x 15.24 x 1.91

Paperback

$84.99

or 4 interest-free payments of $21.25 with

Ships in 5 to 7 business days

This book constitutes the refereed proceedings of the 12th International Conference on Rewriting Techniques and Applications, RTA 2001, held in Utrecht, The Netherlands, in May 2001.
The 23 revised full papers presented together with two system descriptions were carefully reviewed and selected from 55 submissions. All current aspects of rewriting are addressed.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $89.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.

Defective items

If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.

For more info please visit our Help Centre.

You Can Find This Book In

Non-Fiction Computing & I.T.Computer Programming & Software Development Programming & Scripting Languages Medicine Medicine in General Compilers & Interpreters Computer Science Mathematical Theory of Computation Maths for Computer Scientists Artificial Intelligence Databases

Data Capture & Analysis

Invited Talks
Computing and Proving	p. 1
Rewriting for Deduction	p. 2
Regular Papers
Universal Interaction Systems with Only Two Agents	p. 3
General Recursion on Second Order Term Algebras	p. 15
Beta Reduction Constraints	p. 31
From Higher-Order to First-Order Rewriting	p. 47
Combining Pattern E-Unification Algorithms	p. 63
Matching Power	p. 77
Dependency Pairs for Equational Rewriting	p. 93
Termination Proofs by Context-Dependent Interpretations	p. 108
Uniform Normalisation beyond Orthogonality	p. 122
Verifying Orientability of Rewrite Rules Using the Knuth-Bendix Order	p. 137
Relating Accumulative and Non-accumulative Functional Programs	p. 154
Context Unification and Traversal Equations	p. 169
Weakly Regular Relations and Applications	p. 185
On the Parallel Complexity of Tree Automata	p. 201
Transfinite Rewriting Semantics for Term Rewriting Systems	p. 216
Goal-Directed E-Unification	p. 231
The Unification Problem for Confluent Right-Ground Term Rewriting
Systems	p. 246
On Termination of Higher-Order Rewriting	p. 261
Matching with Free Function Symbols - A Simple Extension of Matching?	p. 276
Deriving Focused Calculi for Transitive Relations	p. 291
A Formalised First-Order Confluence Proof for the ?-Calculus Using One-Sorted Variable Names (Barendregt Was Right after all ... almost)	p. 306
A Normal Form for Church-Rosser Language Systems	p. 322
Confluence and Termination of Simply Typed Term Rewriting Systems	p. 338
System Descriptions
Parallel Evaluation of Interaction Nets with MPINE	p. 353
Stratego: A Language for Program Transformation Based on Rewriting Strategies (System Description of Stratego 0.5)	p. 357
Author Index	p. 363
Table of Contents provided by Publisher. All Rights Reserved.

Lecture Notes in Computer Science

12th International Conference, RTA 2001, Utrecht, The Netherlands, May 22-24, 2001. Proceedings

At a Glance

Paperback

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Maths for Computer Scientists

Graphical Models and Causal Discovery with R

100 Exercises for Building Logic

Statistical Atlases and Computational Models of the Heart. Regular and CMRxRecon Challenge Papers

16th International Workshop, STACOM 2025, Held in Conjunction with MICCAI 2025, Daejeon, South Korea, September 27, 2025, Revised Selected Papers

Discrete Mathematics for Computing

Grassroots

Beading With Algorithms

Cellular Automata In Peyote Stitch

Machine Learning with Julia

An Algorithmic Exploration

Applied Mathematics with F#

Rigorous Software Development

An Introduction to Program Verification

Why Don t Rabbits Rule The World?

Mathematical answers to life s key questions

A Mathematical Introduction to Data Science with Python

Linear Algebra with Applications in Machine Learning

From Intuitive Understanding to Python Coding

Guide to Graph Algorithms

Sequential, Parallel and Distributed

Introduction to Numerical Mathematics

Theory, Practice and Numerous Examples

Active Inference

6th International Workshop, IWAI 2025, Montreal, QC, Canada, October 15â"17, 2025, Revised Selected Papers

Graphical Models and Causal Discovery with Python

100 Exercises for Building Logic

Contemporary Research in Mathematics from India

Indian National Science Academy

Tools for High Performance Computing 2023

Proceedings of the 14th International Workshop on Parallel Tools for High Performance Computing

Beading With Algorithms

Cellular Automata In Peyote Stitch

Python Essentials

Symbolic and Numeric Problem-Solving in Engineering

Applications of Computational Intelligence

8th IEEE Colombian Conference, ColCACI 2025, Armenia, Colombia, August 27â"29, 2025, Revised Selected Papers

Mathematics and Intelligent Systems in Industry

MISI'25 Conference, Safi, Morocco, July 9â"10, 2025

Scientific Computing and Software

Go20 CSCS, Ghajnsielem, Malta, May 20-24, 2024

High-Performance Computing Systems and Technologies in Scientific Research, Automation of Control and Production

14th International Conference, HPCST 2024, Barnaul, Russia, May 17â"18, 2024, Revised Selected Papers

Surveys in Combinatorics 2026

London Mathematical Society Lecture Note Series

Quantum Computing Paperback

Foundations and Practice

This product is categorised by