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.
Publisher
Cambridge University Press (CUP)
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Bidirectional Data Transformations;Proceedings of the 2nd ACM SIGPLAN International Workshop on Functional Software Architecture;2024-08-28
2. Selective Symbolic Type-Guided Checkpointing and Restoration for Autonomous Vehicle Repair;Proceedings of the IEEE/ACM 42nd International Conference on Software Engineering Workshops;2020-06-27
3. A practical unification of multi-stage programming and macros;ACM SIGPLAN Notices;2020-04-07
4. Narcissus: correct-by-construction derivation of decoders and encoders from binary formats;Proceedings of the ACM on Programming Languages;2019-07-26
5. High-Performance Defunctionalisation in Futhark;Lecture Notes in Computer Science;2019