Term rewriting techniques are applicable to various fields of computer science, including software engineering, programming languages, computer algebra, program verification, automated theorem proving and Boolean algebra. These powerful techniques can besuccessfully applied in all areas that demand efficient methods for reasoning with equations. One of the major problems encountered is the characterization of classes of rewrite systems that have a desirable property, like confluence or termination. In a system that is both terminating and confluent, every computation leads to a result that is unique, regardless of the order in which the rewrite rules are applied. This new text/reference provides a comprehensive and unified presentation of termination and confluence, as well as related properties. Topics and features: * Unified presentation and notation for important advanced topics * Comprehensive coverage of conditional term-rewriting systems * State-of-the-art...

Под заказ:
	OZON.ru - 13080 руб.	Перейти

Рейтинг книги: 4 из 5, 1 голос(-ов).