Pickler combinators

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. 
DOI: 10.1017/S0956796804005209

Topics

4 Figures and Tables

Slides referencing similar topics