Tupling Calculation Eliminates Multiple Data Traversals

Tupling Calculation Eliminates Multiple Data Traversals (1997)

Cached

Download Links

[www.ipl.t.u-tokyo.ac.jp]

Other Repositories/Bibliography

DBLP

by Zhenjiang Hu , Hideya Iwasaki , Masato Takeichi , Akihiko Takano

Venue:	In ACM SIGPLAN International Conference on Functional Programming
Citations:	31 - 18 self

Versions

Version History

Metadata Version 2

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Tupling Calculation Eliminates Multiple Data Traversals	user correction - Legacy Corrections
AUTHOR NAME	Zhenjiang Hu	user correction - Legacy Corrections
AUTHOR AFFIL	Department of Information Engineering; University of Tokyo	user correction - Legacy Corrections
AUTHOR NAME	Hideya Iwasaki	user correction - Legacy Corrections
AUTHOR AFFIL	Department of Computer Science; Tokyo University of Agriculture and Technology	user correction - Legacy Corrections
AUTHOR NAME	Masato Takeichi	user correction - Legacy Corrections
AUTHOR AFFIL	Department of Information Engineering; University of Tokyo	user correction - Legacy Corrections
AUTHOR NAME	Akihiko Takano	user correction - Legacy Corrections
AUTHOR AFFIL	Advanced Research Laboratory; Hitachi, Ltd.	user correction - Legacy Corrections
ABSTRACT	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...	user correction - Legacy Corrections
YEAR	1997	INFERENCE
VENUE	In ACM SIGPLAN International Conference on Functional Programming	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	164--175	INFERENCE
CITATIONS	27 found	ParsCit 1.0