731

Isabelle/HOL: a proof assistant for higherorder logic, volume 2283
–
 2002

4

Formalising Huffmanâ€™s Algorithm
–
 2004

3

A Correctness Proof of Huffman Algorithm. http://coq. inria.fr/contribs/Huffman.html
–
 2003

948

A method for construction of minimumredundancy codes
–
 1952

707

Data structures and algorithms
–
 1983

40

Random testing in isabelle/hol
–
 2004

15

Finding lexicographic orders for termination proofs in Isabelle/HOL
–
 2007

4

Automated methods for formal proofs in simple arithmetics and algebra
–

86

Theorem Proving with the Real Numbers
–
 1996

48

Executing higher order logic
–
 2002

1312

Monads for functional programming
–
 1995

4

A Compiled Implementation of Normalization by Evaluation
–

24

The Definition of Standard ML, Revised edition
–
 1997

5

Defining Recursive Functions in Isabelle/HOL
–

8

Automating Recursive Definitions and Termination Proofs in HigherOrder Logic
–
 2009

32

The Isabelle/Isar Reference Manual
–
 2007

108

Generalized Kraft inequality and arithmetic coding
–

198

Melham, editors. Introduction to HOL: A Theorem Proving Environment for Higher Order Logic
–
 1993

712

Introduction to Algorithms, second edition
–
 2001
