Rewriting Techniques and Applications
Springer Berlin (Verlag)
978-3-540-59200-6 (ISBN)
The 27 full revised papers were selected from a total of 87 submissions. In addition there are 9 system descriptions and two problem sets, one contributed by Mark E. Stickel and Hantao Zhang and another by Nachum Dershowitz, Jean-Pierre Jouannaud and Jan Willem Klop.
The volume addresses all current aspects of rewriting techniques and their applications and thus defines the state-of-the-art in this active field of research.
On some mathematical logic contributions to rewriting techniques: Lost heritage.- Modularity of completeness revisited.- Automatic termination proofs with transformation orderings.- A termination ordering for higher order rewrite systems.- A complete characterization of termination of 0p 1q?1r 0s.- On narrowing, refutation proofs and constraints.- Completion for multiple reduction orderings.- Towards an efficient construction of test sets for deciding ground reducibility.- Term rewriting in contemporary resolution theorem proving.- ??!?=1 Optimizing optimal ?-calculus implementations.- Substitution tree indexing.- Concurrent garbage collection for concurrent rewriting.- Lazy rewriting and eager machinery.- A rewrite mechanism for logic programs with negation.- Level-confluence of conditional rewrite systems with extra variables in right-hand sides.- A polynomial algorithm testing partial confluence of basic semi-Thue systems.- Problems in rewriting applied to categorical concepts by the example of a computational comonad.- Relating two categorical models of term rewriting.- Towards a domain theory for termination proofs.- Higher-order rewrite systems.- Infinitary lambda calculi and böhm models.- Proving the genericity lemma by leftmost reduction is simple.- (Head-)normalization of typeable rewrite systems.- Explicit substitutions with de bruijn's levels.- A restricted form of higher-order rewriting applied to an HDL semantics.- Rewrite systems for integer arithmetic.- General solution of systems of linear diophantine equations and inequations.- Combination of constraint solving techniques: An algebraic point of view.- Some independence results for equational unification.- Regular substitution sets: A means of controlling E-unification.- DISCOUNT: A system fordistributed equational deduction.- ASTRE: Towards a fully automated program transformation system.- Parallel ReDuX ? PaReDuX.- STORM: A many-to-one associative-commutative matcher.- LEMMA: A system for automated synthesis of recursive programs in equational theories.- Generating polynomial orderings for termination proofs.- Disguising recursively chained rewrite rules as equational theorems, as implemented in the prover EFTTP Mark 2.- Prototyping completion with constraints using computational systems.- Guiding term reduction through a neural network: Some preliminary results for the group theory.- Studying quasigroup identities by rewriting techniques: Problems and first results.- Problems in rewriting III.
| Erscheint lt. Verlag | 22.3.1995 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science |
| Zusatzinfo | XII, 480 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 663 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Programmiersprachen / -werkzeuge |
| Informatik ► Theorie / Studium ► Compilerbau | |
| Schlagworte | algorithm • algorithms • automated deduction • Automatische Deduktion • Calculus • equational unification • Ersetzung höherer Ordnung • Ersetzungssysteme • E-Unifikation • formale Sprachen • Higher-Order Rewriting • Lambda Calculus • Logic • Mathematische Logik • Programmiersprache • proving • Resolution • rewrite systems • Semantics • Termersetzung • Term Rewriting |
| ISBN-10 | 3-540-59200-8 / 3540592008 |
| ISBN-13 | 978-3-540-59200-6 / 9783540592006 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
