Term Rewriting and Applications (häftad)
Format
Häftad (Paperback / softback)
Språk
Engelska
Antal sidor
418
Utgivningsdatum
2006-07-01
Upplaga
2006 ed.
Förlag
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Medarbetare
Pfenning, Frank (ed.)
Illustrationer
XIV, 418 p.
Dimensioner
235 x 154 x 25 mm
Vikt
631 g
Antal komponenter
1
Komponenter
1 Paperback / softback
ISBN
9783540368342
Term Rewriting and Applications (häftad)

Term Rewriting and Applications

17th International Conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006, Proceedings

Häftad Engelska, 2006-07-01
1284
  • Skickas inom 7-10 vardagar.
  • Gratis frakt inom Sverige över 199 kr för privatpersoner.
Finns även som
Visa alla 1 format & utgåvor
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.
Visa hela texten

Passar bra ihop

  1. Term Rewriting and Applications
  2. +
  3. On Fire

De som köpt den här boken har ofta också köpt On Fire av Naomi Klein (häftad).

Köp båda 2 för 1313 kr

Kundrecensioner

Har du läst boken? Sätt ditt betyg »

Fler böcker av Frank Pfenning

Innehållsförteckning

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.