Rewriting Techniques and Applications: 15th International Conference, RTA 2004, Aachen, Germany, June 3-5, 2004, Proceedings: Lecture Notes in Computer Science, cartea 3091
Editat de Vincent van Oostromen Limba Engleză Paperback – 24 mai 2004
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 307.71 lei
- 20% Preț: 438.69 lei
- 20% Preț: 645.28 lei
- Preț: 410.88 lei
- 15% Preț: 580.46 lei
- 17% Preț: 427.22 lei
- 20% Preț: 596.46 lei
- Preț: 381.21 lei
- 20% Preț: 353.50 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 309.90 lei
- 20% Preț: 583.40 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 310.26 lei
- 20% Preț: 655.02 lei
- 20% Preț: 580.93 lei
- 20% Preț: 340.32 lei
- 15% Preț: 438.59 lei
- 20% Preț: 591.51 lei
- 20% Preț: 649.49 lei
- 20% Preț: 337.00 lei
- Preț: 449.57 lei
- 20% Preț: 607.39 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 579.30 lei
- 20% Preț: 763.23 lei
- 20% Preț: 453.32 lei
- 20% Preț: 575.48 lei
- 20% Preț: 585.88 lei
- 20% Preț: 825.93 lei
- 20% Preț: 763.23 lei
- 17% Preț: 360.19 lei
- 20% Preț: 1183.14 lei
- 20% Preț: 340.32 lei
- 20% Preț: 504.57 lei
- 20% Preț: 369.12 lei
- 20% Preț: 583.40 lei
- 20% Preț: 343.62 lei
- 20% Preț: 350.21 lei
- 20% Preț: 764.89 lei
- 20% Preț: 583.40 lei
- Preț: 389.48 lei
- 20% Preț: 341.95 lei
- 20% Preț: 238.01 lei
- 20% Preț: 538.29 lei
Preț: 334.20 lei
Preț vechi: 417.75 lei
-20% Nou
Puncte Express: 501
Preț estimativ în valută:
63.96€ • 66.37$ • 53.46£
63.96€ • 66.37$ • 53.46£
Carte tipărită la comandă
Livrare economică 17-31 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540221531
ISBN-10: 3540221530
Pagini: 328
Ilustrații: X, 315 p.
Dimensiuni: 155 x 233 x 17 mm
Greutate: 0.47 kg
Ediția:2004
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540221530
Pagini: 328
Ilustrații: X, 315 p.
Dimensiuni: 155 x 233 x 17 mm
Greutate: 0.47 kg
Ediția:2004
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Termination Analysis of the Untyped ?-Calculus.- A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems.- Termination of S-Expression Rewriting Systems: Lexicographic Path Ordering for Higher-Order Terms.- Monadic Second-Order Unification Is NP-Complete.- A Certified AC Matching Algorithm.- Matchbox: A Tool for Match-Bounded String Rewriting.- TORPA: Termination of Rewriting Proved Automatically.- Querying Unranked Trees with Stepwise Tree Automata.- A Verification Technique Using Term Rewriting Systems and Abstract Interpretation.- Rewriting for Fitch Style Natural Deductions.- Efficient ?-Evaluation with Interaction Nets.- Proving Properties of Term Rewrite Systems via Logic Programs.- On the Modularity of Confluence in Infinitary Term Rewriting.- mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting.- Automated Termination Proofs with AProVE.- An Approximation Based Approach to Infinitary Lambda Calculi.- Böhm-Like Trees for Term Rewriting Systems.- Dependency Pairs Revisited.- Inductive Theorems for Higher-Order Rewriting.- The Joinability and Unification Problems for Confluent Semi-constructor TRSs.- A Visual Environment for Developing Context-Sensitive Term Rewriting Systems.
Caracteristici
Includes supplementary material: sn.pub/extras