Heap compression and binary I/O in Haskell

@misc{citeulike:1137925, abstract = {Two new facilities for Haskell are described: compression of data values in memory, and a new scheme for binary I/O. These facilities, although they can be used individually, can also be combined because they use the same binary representations for values. Heap compression in memory is valuable because it enables programs to run on smaller machines, or conversely allows programs to store more data in the same amount of memory. Binary I/O is valuable because it makes the file storage and...}, author = {Wallace, M. and Runciman, C. }, citeulike-article-id = {1137925}, keywords = {haskell}, posted-at = {2007-03-03 16:42:51}, priority = {2}, title = {Heap compression and binary I/O in Haskell}, url = {http://citeseer.ist.psu.edu/wallace97heap.html}, year = {1997} }

TY - GEN ID - citeulike:1137925 L3 - citeulike-article-id:1137925 TI - Heap compression and binary I/O in Haskell N2 - Two new facilities for Haskell are described: compression of data values in memory, and a new scheme for binary I/O. These facilities, although they can be used individually, can also be combined because they use the same binary representations for values. Heap compression in memory is valuable because it enables programs to run on smaller machines, or conversely allows programs to store more data in the same amount of memory. Binary I/O is valuable because it makes the file storage and... KW - haskell AU - Wallace, M AU - Runciman, C PY - 1997/// UR - http://citeseer.ist.psu.edu/wallace97heap.html ER -