Generic Pickling and Minimization

Authors:
Guido Tack;Leif Kornstaedt;Gert Smolka
Affiliations:
Programming Systems Lab, Saarland University, Saarbrücken, Germany;Programming Systems Lab, Saarland University, Saarbrücken, Germany;Programming Systems Lab, Saarland University, Saarbrücken, Germany
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2006

Citing 11
Cited 3

MULTILISP: a language for concurrent symbolic computation

ACM Transactions on Programming Languages and Systems (TOPLAS)
A simple and efficient implementation of a small database

SOSP '87 Proceedings of the eleventh ACM Symposium on Operating systems principles
Separate compilation for Standard ML

PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
A type-based compiler for standard ML

PLDI '95 Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation
Understanding Code Mobility

IEEE Transactions on Software Engineering
Implementing typed intermediate languages

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
A Value Transmission Method for Abstract Data Types

ACM Transactions on Programming Languages and Systems (TOPLAS)
A nonrecursive list compacting algorithm

Communications of the ACM
Global abstraction-safe marshalling with hash types

ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
FUNCTIONAL PEARL Pickler combinators

Journal of Functional Programming
A concurrent lambda calculus with futures

FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems

A concurrent lambda calculus with futures

Theoretical Computer Science - Applied semantics
Status report: hot pickles, and how to serve them

ML '07 Proceedings of the 2007 workshop on Workshop on ML
Instant pickles: generating object-oriented pickler combinators for fast and extensible serialization

Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.