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

DOI10.1007/S10817-009-9116-YzbMATH Open1187.68523OpenAlexW2026960838MaRDI QIDQ839031FDOQ839031

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

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

zbMATH Keywords

higher-order logicHuffman codinginteractive theorem provers

Mathematics Subject Classification ID

Cites Work

• Title not available (Why is that?)
• Introduction to algorithms
• Isabelle/HOL. A proof assistant for higher-order logic
• Title not available (Why is that?)
• A Method for the Construction of Minimum-Redundancy Codes
• Title not available (Why is that?)
• Finding Lexicographic Orders for Termination Proofs in Isabelle/HOL

Cited In (1)

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

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)