Access Restriction

Author Hu, Zhenjiang ♦ Iwasaki, Hideya ♦ Takeichi, Masato ♦ Takano, Akihiko
Source CiteSeerX
Content type Text
Publisher ACM Press
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Common Data Structure ♦ Multiple Data Traversal ♦ Recursive Function ♦ Fold Unfold Transformation ♦ Recursive Definition ♦ New Efficient Recursive Function ♦ Efficient Program ♦ Structural Information ♦ Recursive Structure ♦ Calculation Eliminates Multiple Data Traversal ♦ Calculation Algorithm ♦ Infinite Unfolding ♦ Previous Approach ♦ Major Difficulty ♦ Multiple Traversal ♦ High Cost ♦ Tupled Function ♦ New Method ♦ Introduction Tupli ♦ Well-known Transformation
Description Tupling is a well-known transformation tactic to obtain new efficient recursive functions by grouping some recursive functions into a tuple. It may be applied to eliminate multiple traversals over the common data structure. The major difficulty in tupling transformation is to find what functions are to be tupled and how to transform the tupled function into an efficient one. Previous approaches to tupling transformation are essentially based on fold/unfold transformation. Though general, they suffer from the high cost of keeping track of function calls to avoid infinite unfolding, which prevents them from being used in a compiler. To remedy this situation, we propose a new method to expose recursive structures in recursive definitions and show how this structural information can be explored for calculating out efficient programs by means of tupling. Our new tupling calculation algorithm can eliminate most of multiple data traversals and is easy to be implemented. 1 Introduction Tupli...
In ACM SIGPLAN International Conference on Functional Programming
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Learning Resource Type Article
Publisher Date 1997-01-01