Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Analysing the complexity of functional programs: higher-order meets first-order
We show how the complexity of higher-order functional programs can be analysed
automatically by applying program transformations to a defunctionalised versions of them …
automatically by applying program transformations to a defunctionalised versions of them …
[HTML][HTML] A combination framework for complexity
In this paper we present a combination framework for the automated polynomial complexity
analysis of term rewrite systems. The framework covers both derivational and runtime …
analysis of term rewrite systems. The framework covers both derivational and runtime …
Automated complexity analysis based on context-sensitive rewriting
N Hirokawa, G Moser - Rewriting and Typed Lambda Calculi: Joint …, 2014 - Springer
In this paper we present a simple technique for analysing the runtime complexity of rewrite
systems. In complexity analysis many techniques are based on reduction orders. We show …
systems. In complexity analysis many techniques are based on reduction orders. We show …
[PDF][PDF] Analyzing Runtime Complexity via Innermost Runtime Complexity.
Analyzing Runtime Complexity via Innermost Runtime Complexity Page 1 Analyzing Runtime
Complexity via Innermost Runtime Complexity Florian Frohn1 Jürgen Giesl1 1RWTH Aachen …
Complexity via Innermost Runtime Complexity Florian Frohn1 Jürgen Giesl1 1RWTH Aachen …
[HTML][HTML] From **ja bytecode to term rewriting: a complexity reflecting transformation
G Moser, M Schaper - Information and Computation, 2018 - Elsevier
In this paper we show how the runtime complexity of imperative programs can be analysed
fully automatically by a transformation to term rewrite systems, the complexity of which can …
fully automatically by a transformation to term rewrite systems, the complexity of which can …
On Basic Feasible Functionals and the Interpretation Method
The class of basic feasible functionals (BFF) is the analog of FP (polynomial time functions)
for type-2 functionals, that is, functionals that can take (first-order) functions as arguments …
for type-2 functionals, that is, functionals that can take (first-order) functions as arguments …
An implicit characterization of the polynomial-time decidable sets by cons-free rewriting
We define the class of constrained cons-free rewriting systems and show that this class
characterizes P, the set of languages decidable in polynomial time on a deterministic Turing …
characterizes P, the set of languages decidable in polynomial time on a deterministic Turing …
Complexity of conditional term rewriting
We propose a notion of complexity for oriented conditional term rewrite systems satisfying
certain restrictions. This notion is realistic in the sense that it measures not only successful …
certain restrictions. This notion is realistic in the sense that it measures not only successful …
A new order-theoretic characterisation of the polytime computable functions
We propose a new order-theoretic characterisation of the class of polytime computable
functions. To this avail we define the small polynomial path order (sPOP* for short). This …
functions. To this avail we define the small polynomial path order (sPOP* for short). This …
Complexity hierarchies and higher-order cons-free rewriting
Constructor rewriting systems are said to be cons-free if, roughly, constructor terms in the
right-hand sides of rules are subterms of constructor terms in the left-hand side; the …
right-hand sides of rules are subterms of constructor terms in the left-hand side; the …