Term Rewriting and Applications

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Confluent Term Rewriting Systems
3. Altmetric Badge
   Chapter 2 Generalized Innermost Rewriting
4. Altmetric Badge
   Chapter 3 Orderings for Innermost Termination
5. Altmetric Badge
   Chapter 4 Leanest Quasi-orderings
6. Altmetric Badge
   Chapter 5 Abstract Modularity
7. Altmetric Badge
   Chapter 6 Union of Equational Theories: An Algebraic Approach
8. Altmetric Badge
   Chapter 7 Equivariant Unification
9. Altmetric Badge
   Chapter 8 Faster Basic Syntactic Mutation with Sorts for Some Separable Equational Theories
10. Altmetric Badge
    Chapter 9 Unification in a Class of Permutative Theories
11. Altmetric Badge
    Chapter 10 Dependency Pairs for Simply Typed Term Rewriting
12. Altmetric Badge
    Chapter 11 Universal Algebra for Termination of Higher-Order Rewriting
13. Altmetric Badge
    Chapter 12 Quasi-interpretations and Small Space Bounds
14. Altmetric Badge
    Chapter 13 A Sufficient Completeness Reasoning Tool for Partial Specifications
15. Altmetric Badge
    Chapter 14 Tyrolean Termination Tool
16. Altmetric Badge
    Chapter 15 Call-by-Value Is Dual to Call-by-Name – Reloaded
17. Altmetric Badge
    Chapter 16 λμ-Calculus and Duality: Call-by-Name and Call-by-Value
18. Altmetric Badge
    Chapter 17 Reduction in a Linear Lambda-Calculus with Applications to Operational Semantics
19. Altmetric Badge
    Chapter 18 Higher-Order Matching in the Linear Lambda Calculus in the Absence of Constants Is NP-Complete
20. Altmetric Badge
    Chapter 19 Localized Fairness: A Rewriting Semantics
21. Altmetric Badge
    Chapter 20 Partial Inversion of Constructor Term Rewriting Systems
22. Altmetric Badge
    Chapter 21 Natural Narrowing for General Term Rewriting Systems
23. Altmetric Badge
    Chapter 22 The Finite Variant Property: How to Get Rid of Some Algebraic Properties
24. Altmetric Badge
    Chapter 23 Intruder Deduction for AC-Like Equational Theories with Homomorphisms
25. Altmetric Badge
    Chapter 24 Proving Positive Almost-Sure Termination
26. Altmetric Badge
    Chapter 25 Termination of Single-Threaded One-Rule Semi-Thue Systems
27. Altmetric Badge
    Chapter 26 On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems
28. Altmetric Badge
    Chapter 27 Twenty Years Later
29. Altmetric Badge
    Chapter 28 Open. Closed. Open.
30. Altmetric Badge
    Chapter 29 A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying Code
31. Altmetric Badge
    Chapter 30 Extending the Explicit Substitution Paradigm
32. Altmetric Badge
    Chapter 31 Arithmetic as a Theory Modulo
33. Altmetric Badge
    Chapter 32 Infinitary Combinatory Reduction Systems
34. Altmetric Badge
    Chapter 33 Proof-Producing Congruence Closure
35. Altmetric Badge
    Chapter 34 The Algebra of Equality Proofs
36. Altmetric Badge
    Chapter 35 On Computing Reachability Sets of Process Rewrite Systems
37. Altmetric Badge
    Chapter 36 Automata and Logics for Unranked and Unordered Trees