Pickler Combinators, Andrew Kennedy 2004.
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.
This is a very pretty functional pearl, which is both useful and illustrates some nice semantic principles.
Recent comments
4 weeks 3 days ago
44 weeks 5 days ago
44 weeks 5 days ago
44 weeks 5 days ago
1 year 14 weeks ago
1 year 19 weeks ago
1 year 20 weeks ago
1 year 20 weeks ago
1 year 23 weeks ago
1 year 28 weeks ago