Proof pearl: Mechanizing the textbook proof of Huffman's algorithm

DOI10.1007/S10817-009-9116-YMaRDI QIDQ839031zbMATH OpenOpenAlexFDO

Authors Jasmin Christian Blanchette

Publication date 1 September 2009

Published in Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10817-009-9116-y

zbMATH Keywords

higher-order logicHuffman codinginteractive theorem provers

Mathematics Subject Classification ID

Recommendations

• Constructing binary Huffman tree
• Proof pearl: A mechanized proof of GHC's mergesort
• A New Proof of the T-C Algorithm
• Minimal Huffman trees
• scientific article; zbMATH DE number 3885303

Cites work

• scientific article; zbMATH DE number 3767009 (Why is no real title available?)
• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• scientific article; zbMATH DE number 234014 (Why is no real title available?)
• A Method for the Construction of Minimum-Redundancy Codes
• Finding Lexicographic Orders for Termination Proofs in Isabelle/HOL
• Introduction to algorithms
• Isabelle/HOL. A proof assistant for higher-order logic

Cited in

(1)

• Proof pearl: A mechanized proof of GHC's mergesort

Describes a project that uses

Uses Software

• Isabelle
• ML
• Isabelle/HOL
• HOL
• Archive Formal Proofs
• Huffman

This page was built for publication: Proof pearl: Mechanizing the textbook proof of Huffman's algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q839031)