Computer Science – Logic in Computer Science
Scientific paper
2011-02-18
EPTCS 49, 2011, pp. 46-57
Computer Science
Logic in Computer Science
In Proceedings HOR 2010, arXiv:1102.3465
Scientific paper
10.4204/EPTCS.49.4
First-order applicative term rewriting systems provide a natural framework for modeling higher-order aspects. In earlier work we introduced an uncurrying transformation which is termination preserving and reflecting. In this paper we investigate how this transformation behaves for innermost termination and (innermost) derivational complexity. We prove that it reflects innermost termination and innermost derivational complexity and that it preserves and reflects polynomial derivational complexity. For the preservation of innermost termination and innermost derivational complexity we give counterexamples. Hence uncurrying may be used as a preprocessing transformation for innermost termination proofs and establishing polynomial upper and lower bounds on the derivational complexity. Additionally it may be used to establish upper bounds on the innermost derivational complexity while it neither is sound for proving innermost non-termination nor for obtaining lower bounds on the innermost derivational complexity.
Hirokawa Nao
Middeldorp Aart
Zankl Harald
No associations
LandOfFree
Uncurrying for Innermost Termination and Derivational Complexity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Uncurrying for Innermost Termination and Derivational Complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Uncurrying for Innermost Termination and Derivational Complexity will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-211411