The following pages link to Term Rewriting and Applications (Q5703845):
Displayed 5 items.
- Closed-form upper bounds in static cost analysis (Q2429987) (← links)
- On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting (Q2502172) (← links)
- Proving Quadratic Derivational Complexities Using Context Dependent Interpretations (Q3522024) (← links)
- Automated Implicit Computational Complexity Analysis (System Description) (Q3541694) (← links)
- Complexity Analysis by Rewriting (Q5458433) (← links)