Text compression
Information Processing Letters - Special issue on the calculational method
Algebra of programming
PolyP—a polytypic programming language extension
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
PLILP '96 Proceedings of the 8th International Symposium on Programming Languages: Implementations, Logics, and Programs
Deterministic, Error-Correcting Combinator Parsers
Advanced Functional Programming, Second International School-Tutorial Text
Advanced Functional Programming, Second International School-Tutorial Text
Out-of-Core Functional Programming with Type-Based Primitives
PADL '00 Proceedings of the Second International Workshop on Practical Aspects of Declarative Languages
Automatically Restructuring Programs for the Web
Proceedings of the 16th IEEE international conference on Automated software engineering
Invertible syntax descriptions: unifying parsing and pretty printing
Proceedings of the third ACM Haskell symposium on Haskell
Bit-coded regular expression parsing
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Journal of Functional Programming - Dedicated to ICFP 2009
Polytypic syntax tree operations
IFL'05 Proceedings of the 17th international conference on Implementation and Application of Functional Languages
| Hi-index | 0.00 |
A generic compact printer and a corresponding parser are constructed. These programs transform values of any regular datatype to and from a bit stream. The algorithms are constructed along with a proof that printing followed by parsing is the identity. Since the binary representation is very compact, the printer can be used for compressing data - possibly supplemented with some standard algorithm for compressing bit streams. The compact printer and the parser are described in the polytypic Haskell extension PolyP.