Reference. Certified, total serialisers with an application to Huffman encoding
The other day, I was assembling lecture material for a course on Agda. Pursuing an application-driven approach, I was looking for correctness proofs of popular algorithms. One of my all-time favourites is Huffman data compression (Huffman, 1952). Even though it is probably safe to assume that you are familiar with this algorithmic gem, a brief reminder of the essential idea may not be amiss.
Cite
Cites 6 works (1 here)
With notes (1)
agdarsec — total parser combinators allais_2018
External (5)
- Verified Functional Programming in Agda (2016)
- Formalising Huffman's algorithm (2004)
- Polytypic data conversion programs (2002)
- A novel representation of lists and its application to the function “reverse” (1986)
- A method for the construction of minimum-redundancy codes (1952)