Rewriting Techniques and Applications (häftad)
Fler böcker inom
Format
Häftad (Paperback / softback)
Språk
Engelska
Antal sidor
368
Utgivningsdatum
2001-05-01
Upplaga
2001 ed.
Förlag
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Medarbetare
Middeldorp, Aart (ed.)
Illustratör/Fotograf
Mit Abb
Illustrationer
XII, 368 p.
Volymtitel
Rewriting Techniques and Applications 12th International Conference, RTA 2001, Utrecht, The Netherlands, May 22-24, 2001 - Proceedings
Dimensioner
279 x 216 x 20 mm
Vikt
881 g
Antal komponenter
1
Komponenter
1 Paperback / softback
ISBN
9783540421177

Du kanske gillar

Rewriting Techniques and Applications (häftad)

Rewriting Techniques and Applications

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

av Aart Middeldorp
Häftad Engelska, 2001-05-01
1111
Köp
Spara som favorit
  • 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 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.
Visa hela texten

Passar bra ihop

  1. Rewriting Techniques and Applications
  2. +
  3. 12 Rules for Life

De som köpt den här boken har ofta också köpt 12 Rules for Life av Jordan B Peterson (häftad).

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

Kundrecensioner

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

Fler böcker av Aart Middeldorp

Innehållsförteckning

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.