Towards an intermediate language based on graph rewriting
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Term rewriting and all that
Term Rewriting, French Spring School of Theoretical Computer Science, Advanced Course
Analysing the implicit complexity of programs
Information and Computation - Special issue: ICC '99
Automated Complexity Analysis Based on the Dependency Pair Method
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Dependency Pairs and Polynomial Path Orders
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
On Constructor Rewrite Systems and the Lambda-Calculus
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Complexity analysis by rewriting
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Derivational complexity is an invariant cost model
FOPARA'09 Proceedings of the First international conference on Foundational and practical aspects of resource analysis
POP and semantic labeling using SAT
ESSLLI'08/09 Proceedings of the 2008 international conference on Interfaces: explorations in logic, language and computation
A dependency pair framework for innermost complexity analysis of term rewrite systems
CADE'11 Proceedings of the 23rd international conference on Automated deduction
The Cost of Usage in the ?-Calculus
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
Recently, many techniques have been introduced that allow the (automated) classification of the runtime complexity of term rewrite systems (TRSs for short). In this paper we show that polynomial (innermost) runtime complexity of TRSs induces polytime computability of the functions defined. In this way we show a tight correspondence between the number of steps performed in a given rewrite system and the computational complexity of an implementation of rewriting. The result uses graph rewriting as a first step towards the implementation of term rewriting. In particular, we prove the adequacy of (innermost) graph rewriting for (innermost) term rewriting.