Polynomial Path Orders
This paper is concerned with the complexity analysis of constructor term rewrite systems and its ramification in implicit computational complexity. We introduce a path order with multiset status, the polynomial path order POP*, that is applicable in two related, but distinct contexts. On the one han...
| Published in: | Logical Methods in Computer Science |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Logical Methods in Computer Science e.V.
2013-11-01
|
| Subjects: | |
| Online Access: | https://lmcs.episciences.org/807/pdf |