Rewriting Techniques and Applications [electronic resource] : 3rd International Conference, RTA-89 Chapel Hill, North Carolina, USA April 3–5, 1989 Proceedings /

Rewriting has always played an important role in symbolic manipulation and automated deduction systems. The theory of rewriting is an outgrowth of Combinatory Logic and the Lambda Calculus. Applications cover broad areas in automated reasoning, programming language design, semantics, and implementations, and symbolic and algebraic manipulation. The proceedings of the third International Conference on Rewriting Techniques and Applications contain 34 regular papers, covering many diverse aspects of rewriting (including equational logic, decidability questions, term rewriting, congruence-class rewriting, string rewriting, conditional rewriting, graph rewriting, functional and logic programming languages, lazy and parallel implementations, termination issues, compilation techniques, completion procedures, unification and matching algorithms, deductive and inductive theorem proving, Gröbner bases, and program synthesis). It also contains 12 descriptions of implemented equational reasoning systems. Anyone interested in the latest advances in this fast growing area should read this volume.

Bibliographic Details

Main Authors:	Dershowitz, Nachum. editor., SpringerLink (Online service)
Format:	Texto biblioteca
Language:	eng
Published:	Berlin, Heidelberg : Springer Berlin Heidelberg, 1989
Subjects:	Mathematics., Programming languages (Electronic computers)., Algorithms., Mathematical logic., Computer science, Artificial intelligence., Mathematical Logic and Foundations., Mathematical Logic and Formal Languages., Symbolic and Algebraic Manipulation., Programming Languages, Compilers, Interpreters., Algorithm Analysis and Problem Complexity., Artificial Intelligence (incl. Robotics).,
Online Access:	http://dx.doi.org/10.1007/3-540-51081-8
Tags:	Add Tag No Tags, Be the first to tag this record!