Functional Pearl: Pickler Combinators

  • Andrew Kennedy

Journal of Functional Programming | , Vol 14: pp. 727-739

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.