Towards orthogonal Haskell data serialisation

Jost Berthold

Abstract

This paper investigates a novel approach to serialisation of Haskell data structures with a high degree of flexibility, based on runtime support for parallel Haskell on distributed memory platforms. This serialisation has highly desirable and so-far unrivalled properties: it is truly orthogonal to evaluation and does not require any type class mechanisms. Especially, (almost) any kind of value can be serialised, including functions and IO actions. We outline the runtime support on which our serialisation is based, and present different versions of the wrapper code in Haskell which can ensure type safety of the serialisation process, as well as application ideas.
Original languageEnglish
Title of host publicationPreproceedings of the 22nd Symposium on Implementation and Application of Functional Languages (IFL 2010)
EditorsJurriaan Hage
Number of pages10
VolumeUU-CS-2010-020
Place of PublicationUtrecht, NL
PublisherUtrecht University
Publication date2010
EditionTechnical Report
Pages329-338
Publication statusPublished - 2010
Event22nd International Symposium on Implementation and Application of Functional Languages - Alphen aan den Rijn, Netherlands
Duration: 1 Sept 20103 Sept 2010
Conference number: 22

Conference

Conference22nd International Symposium on Implementation and Application of Functional Languages
Number22
Country/TerritoryNetherlands
CityAlphen aan den Rijn
Period01/09/201003/09/2010
SeriesTechnical Report UU-CS
Number020
Volume2010
ISSN0924-3275

Fingerprint

Dive into the research topics of 'Towards orthogonal Haskell data serialisation'. Together they form a unique fingerprint.

Cite this