> "Simon" == Simon Marlow <[EMAIL PROTECTED]> writes:
Simon> If I understand this right, you're suggesting essentially
Simon> dumping out part of the Haskell heap to a file. Assuming
Simon> the data you want to dump out is closed (i.e. has no
Simon> external references) and i
> "Malcolm" == Malcolm Wallace <[EMAIL PROTECTED]> writes:
Malcolm> With our current design, it is possible to map binary
Malcolm> files into memory and vice versa, in a completely
Malcolm> orthogonal fashion.
Do you mean "map" as in mmap or just flattening into and out of binary
I'd be delighted if a programming-language-aware person applied for this
(tenured) post. Deadline 13 March.
Simon
Lectureship in Computing Science
University of Glasgow
The University invites applications for a permanent lectureship in the
Department of Computi
Tim Barbour writes
>> "Tony" == Tony Davie <[EMAIL PROTECTED]> writes:
>
>Tony> This has well know disadvantages. Simon has already pointed
>Tony> out that it's not relocatable. It's also limited to the size
>Tony> of virtual memory and takes up that amount of space even
>Tony
> "Tony" == Tony Davie <[EMAIL PROTECTED]> writes:
Tony> This has well know disadvantages. Simon has already pointed
Tony> out that it's not relocatable. It's also limited to the size
Tony> of virtual memory and takes up that amount of space even
Tony> though most of it may no
The debate about heavy or light-weight saving sounds a lot like the debate
in traditional programming languages of how users should implement
persistent state.
Java comes with a serialization mechanism that allows the user to save
and load all objects reachable from a particular object root. It
Timothy Robin BARBOUR <[EMAIL PROTECTED]> writes:
> No need to relocate on an Alpha - just use a different high 32-bits
> for each persistent store. Not that I've got an Alpha yet...
Sure - not a portable solution, though.
> BTW I will probably get an Alpha sometime for running ghc, but it
> wi
