Cantitate/Preț
Produs

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 Oostrom
en Limba Engleză Paperback – 24 mai 2004

Din seria Lecture Notes in Computer Science

Preț: 33420 lei

Preț vechi: 41775 lei
-20% Nou

Puncte Express: 501

Preț estimativ în valută:
6396 6637$ 5346£

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

Public țintă

Research

Cuprins

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