Publication details

Saarland University Computer Science

Generic Pickling and Minimization

Guido Tack, Leif Kornstaedt, Gert Smolka

Proceedings of the ACM-SIGPLAN Workshop on ML (ML 2005), Vol. 148/2 of Electronic Notes in Theoretical Computer Science, pp. 79-103, Elsevier, March 2006

This paper presents generic pickling and minimization mechanisms that are provided as services similar to garbage collection. Pickling is used to externalize and internalize data. Minimization means to maximize the sharing in arbitrary data structures. The paper introduces the notion of an abstract store as a formal basis for the algorithms, and analyzes design decisions for the implementation aspects of pickling and minimization. The mechanisms presented here are fully implemented in the Alice programming system.

Download PDF        Show BibTeX               

Login to edit

Legal notice, Privacy policy