D. Wakeling. The dynamic compilation of lazy functional programs. Journal of Functional Programming, 8(1):61--82, January 1998. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
The Bits Between The Lambdas: Binary Data in a Lazy.. - Wallace, Runciman (1998) (2 citations) (Correct)
....cannot be compressed, since a machine address cannot easily be reduced in size. However, it is certainly possible to compress the code itself, expanding it only when it is needed. Just in time dynamic compilation is showing good results in this area see for instance Wakeling s recent work [20]. 3. Except when reading binary values lazily, data is accessed in a sequential left to right order. For instance, in a compressed binary tree one locates the right subtree by first deciphering the left subtree. This is fine if the left subtree will be used in the same computation anyway, but in ....
D. Wakeling. The dynamic compilation of lazy functional programs. Journal of Functional Programming, 8(1):61--82, January 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC