Proof Pearl: Mechanizing the Textbook Proof of Huffman’s Algorithm
- First Online:
- Cite this article as:
- Blanchette, J.C. J Autom Reasoning (2009) 43: 1. doi:10.1007/s10817-009-9116-y
- 51 Downloads
Huffman’s algorithm is a procedure for constructing a binary tree with minimum weighted path length. Our Isabelle/HOL proof closely follows the sketches found in standard algorithms textbooks, uncovering a few snags in the process. Another distinguishing feature of our formalization is the use of custom induction rules to help Isabelle’s automatic tactics, leading to very short proofs for most of the lemmas.