Heap Compression and Binary I/O in Haskell (1997)
| Venue: | In 2nd ACM Haskell Workshop |
| Citations: | 7 - 1 self |
BibTeX
@INPROCEEDINGS{Wallace97heapcompression,
author = {Malcolm Wallace and Colin Runciman},
title = {Heap Compression and Binary I/O in Haskell},
booktitle = {In 2nd ACM Haskell Workshop},
year = {1997}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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 retrieval of heap data structures smooth and painless. The combination of heap compression and binary I/O allows data transfer to be both fast and space-efficient. All the facilities described have been implemented in a variant of R ojemo's nhc compiler. Example applications are demonstrated, with performance results for space and speed. 1 Introduction 1.1 Data representation Implementors of lazy functional languages tend to use an internal representation of data which is uniform, based on graphs of...
Citations
No citations identified.
