Please use this identifier to cite or link to this item:
|Title:||Bounds inference method for vector-based memo-ization||Authors:||Chin, Wei-Ngan
|Issue Date:||1997||Citation:||Chin, Wei-Ngan,Hagiya, Masami (1997). Bounds inference method for vector-based memo-ization. Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP : 176-187. ScholarBank@NUS Repository.||Abstract:||The dynamic-sized tabulation method can be used to eliminate redundant calls for certain classes of recursive programs. An innovative aspect of the method is the use of lambda abstractions that may subsequently be converted to bounded vectors, in order to share redundant calls via vector lookup. To facilitate this conversion to vector form, we propose a new inference method to conservatively determine the bounds for arithmetic parameters of recursive functions. Suitable techniques for inferring the safe bounds of these parameters are introduced, together with supporting transformations. The resulting method can obtain efficient vector-based programs without the need for run-time bounds checking.||Source Title:||Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP||URI:||http://scholarbank.nus.edu.sg/handle/10635/99479|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 16, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.