Abstract
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.
Publisher
Cambridge University Press (CUP)
Reference6 articles.
1. Polytypic data conversion programs;Jansson;Sci. Comput. Program.,2002
2. Allais, G. (2018). agdarsec — Total parser combinators. Journées Francophones des Langages Applicatifs. Available at: http://gallais.github.io/index.html.
3. Stump, A. (2016). Verified Functional Programming in Agda. Association for Computing Machinery and Morgan & Claypool.
4. Théry, L. (2004). Formalising Huffman’s algorithm. Research report. Università degli Studi dell’Aquila.
5. A method for the construction of minimum-redundancy codes.;Huffman;Proc. IRE,1952