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 …
Superposition for lambda-free higher-order logic
We introduce refutationally complete superposition calculi for intentional and extensional
clausal λ-free higher-order logic, two formalisms that allow partial application and applied …
clausal λ-free higher-order logic, two formalisms that allow partial application and applied …
[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 …
Nagoya termination tool
A Yamada, K Kusakari, T Sakabe - International Conference on Rewriting …, 2014 - Springer
This paper describes the implementation and techniques of the Nagoya Termination Tool, a
termination prover for term rewrite systems. The main features of the tool are: the first …
termination prover for term rewrite systems. The main features of the tool are: the first …
Superposition for higher-order logic
We recently designed two calculi as step** stones towards superposition for full higher-
order logic: Boolean-free λ-superposition and superposition for first-order logic with …
order logic: Boolean-free λ-superposition and superposition for first-order logic with …
A transfinite Knuth–Bendix order for lambda-free higher-order terms
Abstract We generalize the Knuth–Bendix order (KBO) to higher-order terms without λ-
abstraction. The restriction of this new order to first-order terms coincides with the traditional …
abstraction. The restriction of this new order to first-order terms coincides with the traditional …
The certification problem format
C Sternagel, R Thiemann - arxiv preprint arxiv:1410.8220, 2014 - arxiv.org
We provide an overview of CPF, the certification problem format, and explain some design
decisions. Whereas CPF was originally invented to combine three different formats for …
decisions. Whereas CPF was originally invented to combine three different formats for …
[HTML][HTML] A unified ordering for termination proving
A Yamada, K Kusakari, T Sakabe - Science of Computer Programming, 2015 - Elsevier
We introduce a reduction order called the weighted path order (WPO) that subsumes many
existing reduction orders. WPO compares weights of terms as in the Knuth–Bendix order …
existing reduction orders. WPO compares weights of terms as in the Knuth–Bendix order …
A lambda-free higher-order recursive path order
JC Blanchette, U Waldmann, D Wand - International Conference on …, 2017 - Springer
We generalize the recursive path order (RPO) to higher-order terms without λ-abstraction.
This new order fully coincides with the standard RPO on first-order terms also in the …
This new order fully coincides with the standard RPO on first-order terms also in the …
[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 …