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
5 days 12 hours ago
41 weeks 6 hours ago
41 weeks 10 hours ago
41 weeks 10 hours ago
1 year 11 weeks ago
1 year 15 weeks ago
1 year 16 weeks ago
1 year 16 weeks ago
1 year 19 weeks ago
1 year 24 weeks ago