Rewriting Techniques and Applications
Editat de Sophie Tisonen Limba Engleză Paperback – 10 iul 2002
Preț: 327.74 lei
Preț vechi: 409.67 lei
-20%
Puncte Express: 492
Carte tipărită la comandă
Livrare economică 11-25 iulie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540439165
ISBN-10: 3540439161
Pagini: 404
Ilustrații: XII, 392 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.61 kg
Ediția:2002
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540439161
Pagini: 404
Ilustrații: XII, 392 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.61 kg
Ediția:2002
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Talks.- Combining Shostak Theories.- Multiset Rewriting and Security Protocol Analysis.- Engineering of Logics for the Content-Based Representation of Information.- Regular Papers, Application Papers.- Axiomatic Rewriting Theory VI: Residual Theory Revisited.- Static Analysis of Modularity of ?-Reduction in the Hyperbalanced ?-Calculus.- Exceptions in the Rewriting Calculus.- Deriving Focused Lattice Calculi.- Layered Transducing Term Rewriting System and Its Recognizability Preserving Property.- Decidability and Closure Properties of Equational Tree Languages.- Regular Sets of Descendants by Some Rewrite Strategies.- Rewrite Games.- An Extensional Böhm Model.- A Weak Calculus with Explicit Operators for Pattern Matching and Substitution.- Tradeoffs in the Intensional Representation of Lambda Terms.- Improving Symbolic Model Checking by Rewriting Temporal Logic Formulae.- Conditions for Efficiency Improvement by Tree Transducer Composition.- Rewriting Strategies for Instruction Selection.- Probabilistic Rewrite Strategies. Applications to ELAN.- Loops of Superexponential Lengths in One-Rule String Rewriting.- Recursive Derivational Length Bounds for Confluent Term Rewrite Systems Research Paper.- Termination of (Canonical) Context-Sensitive Rewriting.- Atomic Set Constraints with Projection.- Currying Second-Order Unification Problems.- A Decidable Variant of Higher Order Matching.- Combining Decision Procedures for Positive Theories Sharing Constructors.- System Descriptions.- JITty: A Rewriter with Strategy Annotations.- Autowrite: A Tool for Checking Properties of Term Rewriting Systems.- TTSLI: An Implementation of Tree-Tuple Synchronized Languages.- in2: A Graphical Interpreter for Interaction Nets.