Frank Pfenning (ed.)

Term Rewriting and Applications

17th International Conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006, Proceedings
Herausgegeben:Pfenning, Frank

• Broschiertes Buch

Produktbeschreibung

This book constitutes the refereed proceedings of the 17th International Conference on Rewriting Techniques and Applications, RTA 2006, held in Seattle, WA, USA in August 2006. The book presents 23 revised full papers and 4 systems description papers together with 2 invited talks and a plenary talk of the hosting FLoC conference. Topics include equational reasoning, system verification, lambda calculus, theorem proving, system descriptions, termination, higher-order rewriting and unification, and more.

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Theoretical Computer Science and General Issues 4098
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 11805618, 978-3-540-36834-2
• 2006
• Seitenzahl: 436
• Erscheinungstermin: 26. Juli 2006
• Englisch
• Abmessung: 235mm x 155mm x 24mm
• Gewicht: 608g
• ISBN-13: 9783540368342
• ISBN-10: 3540368345
• Artikelnr.: 20946993

Autorenporträt

Frank Pfenning, Carnegie Mallon University, Pittsburgh, PA, USA

Inhaltsangabe

FLoC Plenary Talk.- Formal Verification of Infinite State Systems Using Boolean Methods.- Session 1. Constraints and Optimization.- Solving Partial Order Constraints for LPO Termination.- Computationally Equivalent Elimination of Conditions.- On the Correctness of Bubbling.- Propositional Tree Automata.- Session 2. Equational Reasoning.- Generalizing Newman's Lemma for Left-Linear Rewrite Systems.- Unions of Equational Monadic Theories.- Modular Church-Rosser Modulo.- Session 3. System Verification.- Hierarchical Combination of Intruder Theories.- Feasible Trace Reconstruction for Rewriting Approximations.- Invited Talk.- Rewriting Models of Boolean Programs.- Session 4. Lambda Calculus.- Syntactic Descriptions: A Type System for Solving Matching Equations in the Linear ?-Calculus.- A Terminating and Confluent Linear Lambda Calculus.- A Lambda-Calculus with Constructors.- Structural Proof Theory as Rewriting.- Session 5. Theorem Proving.- Checking Conservativity of Overloaded Definitions in Higher-Order Logic.- Certified Higher-Order Recursive Path Ordering.- Dealing with Non-orientable Equations in Rewriting Induction.- Session 6. System Descriptions.- TPA: Termination Proved Automatically.- RAPT: A Program Transformation System Based on Term Rewriting.- The CL-Atse Protocol Analyser.- Slothrop: Knuth-Bendix Completion with a Modern Termination Checker.- Invited Talk.- Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages.- Session 7. Termination.- Predictive Labeling.- Termination of String Rewriting with Matrix Interpretations.- Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related Systems.- Proving Positive Almost Sure Termination Under Strategies.- Session 8. Higher-Order Rewriting andUnification.- A Proof of Finite Family Developments for Higher-Order Rewriting Using a Prefix Property.- Higher-Order Orderings for Normal Rewriting.- Bounded Second-Order Unification Is NP-Complete.