Proof Pearl: Mechanizing the Textbook Proof of Huffman’s Algorithm


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… (More)
DOI: 10.1007/s10817-009-9116-y