Rewriting Techniques and Applications
Springer Berlin (Verlag)
978-3-540-42117-7 (ISBN)
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.
Invited Talks.- Computing and Proving.- Rewriting for Deduction and Verification.- Regular Papers.- Universal Interaction Systems with Only Two Agents.- General Recursion on Second Order Term Algebras.- Beta Reduction Constraints.- From Higher-Order to First-Order Rewriting.- Combining Pattern E-Unification Algorithms.- Matching Power.- Dependency Pairs for Equational Rewriting.- Termination Proofs by Context-Dependent Interpretations.- Uniform Normalisation beyond Orthogonality.- Verifying Orientability of Rewrite Rules Using the Knuth-Bendix Order.- Relating Accumulative and Non-accumulative Functional Programs.- Context Unification and Traversal Equations.- Weakly Regular Relations and Applications.- On the Parallel Complexity of Tree Automata.- Transfinite Rewriting Semantics for Term Rewriting Systems.- Goal-Directed E-Unification.- The Unification Problem for Confluent Right-Ground Term Rewriting Systems.- On Termination of Higher-Order Rewriting.- Matching with Free Function Symbols - A Simple Extension of Matching?.- Deriving Focused Calculi for Transitive Relations.- A Formalised First-Order Con uence Proof for the ?-Calculus Using One-Sorted Variable Names (Barendregt Was Right after all ... almost).- A Normal Form for Church-Rosser Language Systems.- Confluence and Termination of Simply Typed Term Rewriting Systems.- Parallel Evaluation of Interaction Nets with MPINE.- Stratego: A Language for Program Transformation Based on Rewriting Strategies System Description of Stratego 0.5.
| Erscheint lt. Verlag | 9.5.2001 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science |
| Zusatzinfo | XII, 368 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 531 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Programmiersprachen / -werkzeuge |
| Informatik ► Theorie / Studium ► Compilerbau | |
| Schlagworte | algorithm • algorithms • Automata • automated deduction • Beta • Complexity • Explicite substitution • formal methods • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • HC/Informatik, EDV/Programmiersprachen • reduction • Rewriting • Rewriting Systems • termination • Term Rewriting • theorem proving • unification • Variable • verification |
| ISBN-10 | 3-540-42117-3 / 3540421173 |
| ISBN-13 | 978-3-540-42117-7 / 9783540421177 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
