Putting the Spine back in the Spineless Tagless G-Machine: An Implementation of Resumable Black-Holes (1998)
| Venue: | In Proc. IFL'98 (selected papers), volume 1595 of LNCS |
| Citations: | 8 - 2 self |
BibTeX
@INPROCEEDINGS{Reid98puttingthe,
author = {Alastair Reid},
title = {Putting the Spine back in the Spineless Tagless G-Machine: An Implementation of Resumable Black-Holes},
booktitle = {In Proc. IFL'98 (selected papers), volume 1595 of LNCS},
year = {1998},
pages = {186--199},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. Interrupt handling is a tricky business in lazy functional languages: we have to make sure that thunks that are being evaluated can be halted and later restarted if and when they are required. This is a particular problem for implementations which use black-holing. Black-Holing deliberately makes it impossible to revert such thunks to their original state to avoid a serious space leak. Interactive Haskell implementations such as Hugs and hbi catch interrupts and avoid the problem by omitting or disabling black-holing. Batch mode Haskell implementations such as HBC and the Glasgow Haskell Compiler (GHC) avoid this problem by disabling black-holing or by providing no way to catch interrupts. This paper describes a modification to GHC's abstract machine (the Spineless Tagless G-Machine) which simultaneously supports both interrupts and black-holing. 1 Introduction Black-Holing [6] is an important technique for avoiding space leaks in lazy functional languages. When a program starts to ...
