Term Rewriting and Applications
Editat de Jürgen Gieslen Limba Engleză Paperback – 7 apr 2005
Preț: 635.97 lei
Preț vechi: 794.97 lei
-20%
Puncte Express: 954
Carte tipărită la comandă
Livrare economică 10-24 iulie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit pentru acest produs 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: 9783540255963
ISBN-10: 3540255966
Pagini: 536
Ilustrații: XIII, 517 p.
Dimensiuni: 155 x 235 x 29 mm
Greutate: 0.8 kg
Ediția:2005
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540255966
Pagini: 536
Ilustrații: XIII, 517 p.
Dimensiuni: 155 x 235 x 29 mm
Greutate: 0.8 kg
Ediția:2005
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Confluent Term Rewriting Systems.- Generalized Innermost Rewriting.- Orderings for Innermost Termination.- Leanest Quasi-orderings.- Abstract Modularity.- Union of Equational Theories: An Algebraic Approach.- Equivariant Unification.- Faster Basic Syntactic Mutation with Sorts for Some Separable Equational Theories.- Unification in a Class of Permutative Theories.- Dependency Pairs for Simply Typed Term Rewriting.- Universal Algebra for Termination of Higher-Order Rewriting.- Quasi-interpretations and Small Space Bounds.- A Sufficient Completeness Reasoning Tool for Partial Specifications.- Tyrolean Termination Tool.- Call-by-Value Is Dual to Call-by-Name – Reloaded.- ??-Calculus and Duality: Call-by-Name and Call-by-Value.- Reduction in a Linear Lambda-Calculus with Applications to Operational Semantics.- Higher-Order Matching in the Linear Lambda Calculus in the Absence of Constants Is NP-Complete.- Localized Fairness: A Rewriting Semantics.- Partial Inversion of Constructor Term Rewriting Systems.- Natural Narrowing for General Term Rewriting Systems.- The Finite Variant Property: How to Get Rid of Some Algebraic Properties.- Intruder Deduction for AC-Like Equational Theories with Homomorphisms.- Proving Positive Almost-Sure Termination.- Termination of Single-Threaded One-Rule Semi-Thue Systems.- On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems.- Twenty Years Later.- Open. Closed. Open..- A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying Code.- Extending the Explicit Substitution Paradigm.- Arithmetic as a Theory Modulo.- Infinitary Combinatory Reduction Systems.- Proof-Producing Congruence Closure.- The Algebra of Equality Proofs.- On Computing Reachability Sets of Process Rewrite Systems.- Automata andLogics for Unranked and Unordered Trees.