Efficient and Type-Safe Generic Data Storage

Authors:
Sjaak Smetsers;Arjen van Weelden;Rinus Plasmeijer
Affiliations:
Institute for Computing and Information Sciences, Radboud University Nijmegen, The Netherlands;Institute for Computing and Information Sciences, Radboud University Nijmegen, The Netherlands;Institute for Computing and Information Sciences, Radboud University Nijmegen, The Netherlands
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 8
Cited 0

Amber

Proc. of the thirteenth spring school of the LITP on Combinators and functional programming languages
PolyP—a polytypic programming language extension

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A new approach to generic functional programming

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Polytypic data conversion programs

Science of Computer Programming
Scrap your boilerplate: a practical design pattern for generic programming

Proceedings of the 2003 ACM SIGPLAN international workshop on Types in languages design and implementation
A Generic Programming Extension for Clean

IFL '02 Selected Papers from the 13th International Workshop on Implementation of Functional Languages
iTasks: executable specifications of interactive work flow systems for the web

ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
Lazy dynamic input/output in the lazy functional language clean

IFL'02 Proceedings of the 14th international conference on Implementation of functional languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present an elegant method for sequentializing arbitrary data using the generic language extension of the functional programming language Clean. We show how the proposed operations can be used to store values of any concrete data type in several kinds of IO containers (such as files or arrays of characters), and how to manipulate stored data efficiently. Moreover, by extending stored data with encoded type information, data manipulation will be type-safe. Defining these operations generically has the advantage that specific instances for user defined data types can be generated fully automatically. Compared to traditional sequentialization methods (or to common data manipulation, using relational data bases) our operations are an order of magnitude faster.