Uncurrying for Termination

Authors:
Nao Hirokawa;Aart Middeldorp;Harald Zankl
Affiliations:
School of Information Science, Japan Advanced Institute of Science and Technology, Japan;Institute of Computer Science, University of Innsbruck, Austria;Institute of Computer Science, University of Innsbruck, Austria
Venue:
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Year:
2008

Citing 15
Cited 5

Comparing curried and uncurried rewriting

Journal of Symbolic Computation
Term rewriting and all that

Term rewriting and all that
Termination of term rewriting using dependency pairs

Theoretical Computer Science - Trees in algebra and programming
Towards Automated Termination Proofs through "Freezing"

RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
Examples of Termination

Term Rewriting, French Spring School of Theoretical Computer Science, Advanced Course
Polymorphic higher-order recursive path orderings

Journal of the ACM (JACM)
Mechanizing and Improving Dependency Pairs

Journal of Automated Reasoning
Tyrolean termination tool: Techniques and features

Information and Computation
Enhancing dependency pair method using strong computability in simply-typed term rewriting

Applicable Algebra in Engineering, Communication and Computing
Matrix Interpretations for Proving Termination of Term Rewriting

Journal of Automated Reasoning
Automating the dependency pair method

Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Termination of simply typed term rewriting by translation and labelling

RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
HORPO with computability closure: a reconstruction

LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Proving and disproving termination of higher-order functions

FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
Dependency pairs for simply typed term rewriting

RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications

Tyrolean Termination Tool 2

RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Automated termination proofs for haskell by term rewriting

ACM Transactions on Programming Languages and Systems (TOPLAS)
Simplifying algebraic functional systems

CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Harnessing first order termination provers using higher order dependency pairs

FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Generalized and formalized uncurrying

FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

First-order applicative term rewrite systems provide a natural framework for modeling higher-order aspects. In this paper we present a transformation from untyped applicative term rewrite systems to functional term rewrite systems that preserves and reflects termination. Our transformation is less restrictive than other approaches. In particular, head variables in right-hand sides of rewrite rules can be handled. To further increase the applicability of our transformation, we present a version for dependency pairs.