23 citations · 74 across the 18 of their papers we have counts for
4 papers · 1 filter
A New Term Rewriting Characterisation of ETIME functions
Martin Avanzini, Naohi Eguchi
Adopting former term rewriting characterisations of polytime and exponential-time computable functions, we introduce a new reduction order, the Path Order for ETIME (POE* for short…
Polynomial Path Orders
Martin Avanzini, Georg Moser
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 m…
A Haskell Library for Term Rewriting
Bertram Felgenhauer, Martin Avanzini, Christian Sternagel
We present a Haskell library for first-order term rewriting covering basic operations on positions, terms, contexts, substitutions and rewrite rules. This effort is motivated by th…
A Combination Framework for Complexity
Martin Avanzini, Georg Moser
In this paper we present a combination framework for polynomial complexity analysis of term rewrite systems. The framework covers both derivational and runtime complexity analysis.…