Custom cover image
Custom cover image

Term Rewriting and Applications (vol. # 4098) : 17th International Conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006, Proceedings / edited by Frank Pfenning

Contributor(s): Resource type: Ressourcentyp: Buch (Online)Book (Online)Language: English Series: SpringerLink Bücher | Lecture notes in computer science ; 4098Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2006Description: Online-Ressource (XIII, 415 p. Also available online, digital)ISBN:
  • 9783540368359
Subject(s): Genre/Form: Additional physical formats: 9783540368342 | Buchausg. u.d.T.: Term rewriting and applications. Berlin : Springer, 2006. XIII, 414 S.MSC: MSC: *68-06 | 68Q42 | 68T15 | 00B25RVK: RVK: SS 4800LOC classification:
  • QA8.9-QA10.3
DOI: DOI: 10.1007/11805618Online resources: Summary: 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 and Unification -- 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.PPN: PPN: 1646693949Package identifier: Produktsigel: ZDB-2-SCS | ZDB-2-LNC | ZDB-2-SEB | ZDB-2-SCS | ZDB-2-SXCS | ZDB-2-SEB
No physical items for this record
KIT – The University in the Helmholtz Association                         Home | Impressum | Datenschutz | Barrierefreiheit | KIT