Rewriting Techniques and Applications (häftad)
Format
Häftad (Paperback / softback)
Språk
Engelska
Antal sidor
518
Utgivningsdatum
2003-05-01
Upplaga
2003 ed.
Förlag
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Medarbetare
Nieuwenhuis, Robert (ed.)
Illustrationer
XI, 518 p.
Dimensioner
234 x 156 x 27 mm
Vikt
735 g
Antal komponenter
1
Komponenter
1 Paperback / softback
ISSN
0302-9743
ISBN
9783540402541
Rewriting Techniques and Applications (häftad)

Rewriting Techniques and Applications

14th International Conference, RTA 2003, Valencia, Spain, June 9-11, 2003, Proceedings

Häftad Engelska, 2003-05-01
1399
  • Skickas inom 7-10 vardagar.
  • Gratis frakt inom Sverige över 199 kr för privatpersoner.
The refereed proceedings of the 14th International Conference on Rewriting Techniques and Applications, RTA 2003, held in Valencia, Spain in June 2003. The 26 revised regular papers and 6 system descriptions presented together with 3 invited contributions were carefully reviewed and selected from 61 submissions. All current aspects of rewriting are addressed.
Visa hela texten

Passar bra ihop

  1. Rewriting Techniques and Applications
  2. +
  3. Java How to Program, Late Objects, Global Edition

De som köpt den här boken har ofta också köpt Java How to Program, Late Objects, Global Edition av Paul Deitel (häftad).

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

Kundrecensioner

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

Fler böcker av Robert Nieuwenhuis

  • Automated Deduction - CADE-20

    Robert Nieuwenhuis

    This volume contains the proceedings of the 20th International Conference on AutomatedDeduction (CADE-20).ItwasheldJuly22-27,2005inTallinn,Es- nia,togetherwiththeWorkshoponConstraintsinFormalVeri?cation(CFV'05), the Workshop on Empirically Success...

  • Logic for Programming, Artificial Intelligence, and Reasoning

    Robert Nieuwenhuis, Andrei Voronkov

    This volume contains the papers presented at the Eighth International C- ference on Logic for Programming, Arti?cial Intelligence and Reasoning (LPAR 2001), held on December 3-7, 2001, at the University of Havana (Cuba), together with the Second I...

Innehållsförteckning

Invited Talk.- Symbolic Systems Biology.- Confluence as a Cut Elimination Property.- Associative-Commutative Rewriting on Large Terms.- A Rule-Based Approach for Automated Generation of Kinetic Chemical Mechanisms.- Efficient Reductions with Director Strings.- Rewriting Logic and Probabilities.- The Maude 2.0 System.- Diagrams for Meaning Preservation.- Expression Reduction Systems with Patterns.- Residuals in Higher-Order Rewriting.- Rewriting UNITY.- New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols.- An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation.- Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties.- Rule-Based Analysis of Dimensional Safety.- Invited Talk.- Topological Collections, Transformations and Their Application to the Modeling and the Simulation of Dynamical Systems.- On the Complexity of Higher-Order Matching in the Linear ?-Calculus.- XML Schema, Tree Logic and Sheaves Automata.- Size-Change Termination for Term Rewriting.- Monotonic AC-Compatible Semantic Path Orderings.- Relating Derivation Lengths with the Slow-Growing Hierarchy Directly.- Tsukuba Termination Tool.- Liveness in Rewriting.- Validation of the JavaCard Platform with Implicit Induction Techniques.- "Term Partition" for Mathematical Induction.- Equational Prover of Theorema.- Termination of Simply Typed Term Rewriting by Translation and Labelling.- Rewriting Modulo in Deduction Modulo.- Termination of String Rewriting Rules That Have One Pair of Overlaps.- Environments for Term Rewriting Engines for Free!.- Joint RTA-TLCA Invited Talk.- A Logical Algorithm for ML Type Inference.- A Rewriting Alternative to Reidemeister-Schreier.- Stable Computational Semantics of Conflict-Free Rewrite Systems (Partial Orders with Duplication).- Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting Mechanism.- Testing Extended Regular Language Membership Incrementally by Rewriting.