Hostname: page-component-848d4c4894-pftt2 Total loading time: 0 Render date: 2024-05-23T17:13:43.519Z Has data issue: false hasContentIssue false

FUNCTIONAL PEARL Pickler combinators

Published online by Cambridge University Press:  27 October 2004

ANDREW J. KENNEDY
Affiliation:
Microsoft Research, 7 J J Thomson Avenue, Cambridge CB3 0FB, UK (email: akenn@microsoft.com)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The tedium of writing pickling and unpickling functions by hand is relieved using a combinator library similar in spirit to the well-known parser combinators. Picklers for primitive types are combined to support tupling, alternation, recursion, and structure sharing. Code is presented in Haskell; an alternative implementation in ML is discussed.

Type
Functional pearls
Copyright
© 2004 Cambridge University Press
Submit a response

Discussions

No Discussions have been published for this article.