Del 2051 - Lecture Notes in Computer Science

Rewriting Techniques and Applications

12th International Conference, RTA 2001, Utrecht, The Netherlands, May 22-24, 2001. Proceedings

Häftad, Engelska, 2001

Av Aart Middeldorp

739 kr

Beställningsvara. Skickas inom 7-10 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

This book constitutes the refereed proceedings of the 12th International Conference on Rewriting Techniques and Applications, RTA 2001, held in Utrecht, The Netherlands, in May 2001.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.

Produktinformation

Utgivningsdatum2001-05-09
Mått155 x 235 x 21 mm
Vikt575 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor368
Upplaga2001
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540421177

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it
Artificiell intelligens inom Data och it
Programspråk inom Data och it
Programmeringsböcker inom Data och it

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.