Rewriting Techniques and Applications

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 42 On some mathematical logic contributions to rewriting techniques: Lost heritage
3. Altmetric Badge
   Chapter 43 Modularity of completeness revisited
4. Altmetric Badge
   Chapter 44 Automatic termination proofs with transformation orderings
5. Altmetric Badge
   Chapter 45 A termination ordering for higher order rewrite systems
6. Altmetric Badge
   Chapter 46 A complete characterization of termination of 0 p 1 q →1 r 0 s
7. Altmetric Badge
   Chapter 47 On narrowing, refutation proofs and constraints
8. Altmetric Badge
   Chapter 48 Completion for multiple reduction orderings
9. Altmetric Badge
   Chapter 49 Towards an efficient construction of test sets for deciding ground reducibility
10. Altmetric Badge
    Chapter 50 Term rewriting in contemporary resolution theorem proving
11. Altmetric Badge
    Chapter 51 δ ο!∈=1 Optimizing optimal λ-calculus implementations
12. Altmetric Badge
    Chapter 52 Substitution tree indexing
13. Altmetric Badge
    Chapter 53 Concurrent garbage collection for concurrent rewriting
14. Altmetric Badge
    Chapter 54 Lazy rewriting and eager machinery
15. Altmetric Badge
    Chapter 55 A rewrite mechanism for logic programs with negation
16. Altmetric Badge
    Chapter 56 Level-confluence of conditional rewrite systems with extra variables in right-hand sides
17. Altmetric Badge
    Chapter 57 A polynomial algorithm testing partial confluence of basic semi-Thue systems
18. Altmetric Badge
    Chapter 58 Problems in rewriting applied to categorical concepts by the example of a computational comonad
19. Altmetric Badge
    Chapter 59 Relating two categorical models of term rewriting
20. Altmetric Badge
    Chapter 60 Towards a domain theory for termination proofs
21. Altmetric Badge
    Chapter 61 Higher-order rewrite systems
22. Altmetric Badge
    Chapter 62 Infinitary lambda calculi and böhm models
23. Altmetric Badge
    Chapter 63 Proving the genericity lemma by leftmost reduction is simple
24. Altmetric Badge
    Chapter 64 (Head-)normalization of typeable rewrite systems
25. Altmetric Badge
    Chapter 65 Explicit substitutions with de bruijn's levels
26. Altmetric Badge
    Chapter 66 A restricted form of higher-order rewriting applied to an HDL semantics
27. Altmetric Badge
    Chapter 67 Rewrite systems for integer arithmetic
28. Altmetric Badge
    Chapter 68 General solution of systems of linear diophantine equations and inequations
29. Altmetric Badge
    Chapter 69 Combination of constraint solving techniques: An algebraic point of view
30. Altmetric Badge
    Chapter 70 Some independence results for equational unification
31. Altmetric Badge
    Chapter 71 Regular substitution sets: A means of controlling E-unification
32. Altmetric Badge
    Chapter 72 DISCOUNT: A system for distributed equational deduction
33. Altmetric Badge
    Chapter 73 ASTRE: Towards a fully automated program transformation system
34. Altmetric Badge
    Chapter 74 Parallel ReDuX → PaReDuX
35. Altmetric Badge
    Chapter 75 STORM: A many-to-one associative-commutative matcher
36. Altmetric Badge
    Chapter 76 LEMMA: A system for automated synthesis of recursive programs in equational theories
37. Altmetric Badge
    Chapter 77 Generating polynomial orderings for termination proofs
38. Altmetric Badge
    Chapter 78 Disguising recursively chained rewrite rules as equational theorems, as implemented in the prover EFTTP Mark 2
39. Altmetric Badge
    Chapter 79 Prototyping completion with constraints using computational systems
40. Altmetric Badge
    Chapter 80 Guiding term reduction through a neural network: Some preliminary results for the group theory
41. Altmetric Badge
    Chapter 81 Studying quasigroup identities by rewriting techniques: Problems and first results
42. Altmetric Badge
    Chapter 82 Problems in rewriting III