FUNCTIONAL PEARL Pickler combinators

  • Authors:
  • Andrew J. Kennedy

  • Affiliations:
  • Microsoft Research, 7 J J Thomson Avenue, Cambridge CB3 0FB, UK (email: akenn@microsoft.com)

  • Venue:
  • Journal of Functional Programming
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.