Please use this identifier to cite or link to this item:
|Title:||A transformation method for dynamic-sized tabulation|
|Authors:||Chin, W.-N. |
|Citation:||Chin, W.-N., Hagiya, M. (1995-02). A transformation method for dynamic-sized tabulation. Acta Informatica 32 (2) : 93-115. ScholarBank@NUS Repository. https://doi.org/10.1007/BF01177742|
|Abstract:||Tupling is a transformation tactic to obtain new functions, without redundant calls and/or multiple traversals of common inputs. It achieves this feat by allowing each set (tuple) of function calls to be computed recursively from its previous set. In previous works by Chin and Khoo [8,9], a safe (terminating) fold/unfold transformation algorithm was developed for some classes of functions which are guaranteed to be successfully tupled. However, these classes of functions currently use static-sized tables for eliminating the redundant calls. As shown by Richard Bird in , there are also other classes of programs whose redundant calls could only be eliminated by using dynamic-sized tabulation. This paper proposes a new solution to dynamic-sized tabulation by an extension to the tupling tactic. Our extension uses lambda abstractions which can be viewed as either dynamic-sized tables or applications of the higher-order generalisation technique to facilitate tupling. Significant speedups could be obtained after the transformed programs were vectorised, as confirmed by experiment. © 1995 Springer-Verlag.|
|Source Title:||Acta Informatica|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jul 21, 2018
WEB OF SCIENCETM
checked on Jun 18, 2018
checked on Jun 29, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.