Rewriting Techniques and Applications : 3rd International Conference, RTA-89, Chapel Hill, North Carolina, USA, April 3-5, 1989, Proceedings. 1st ed. 1989

種類:

電子ブック

責任表示:

edited by Nachum Dershowitz

出版情報:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1989

著者名:

• Dershowitz, Nachum.
• SpringerLink (Online service)

シリーズ名:

Lecture Notes in Computer Science ; 355

ISBN:

9783540461494 [3540461493]    

注記:

Term rewriting and universal algebra in historical perspective -- Characterizations of unification type zero -- Proof normalization for resolution and paramodulation -- Complete sets of reductions modulo associativity, commutativity and identity -- Completion-time optimization of rewrite-time goal solving -- Computing ground reducibility and inductively complete positions -- Inductive proofs by specification transformations -- Narrowing and unification in functional programming —An evaluation mechanism for absolute set abstraction -- Simulation of Turing machines by a left-linear rewrite rule -- Higher-order unification with dependent function types -- An overview of LP, the Larch Prover -- Graph grammars, a new paradigm for implementing visual languages -- Termination proofs and the length of derivations -- Abstract rewriting with concrete operators -- On how to move mountains ‘associatively and commutatively’ -- Generalized Gröbner bases: Theory and applications. A condensation -- A local termination proper
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 intereste

ローカル注記:

学内専用E-BOOKS (local access only)