Documents Related by Co-Citation

724 M.: Isabelle/HOL - A Proof Assistant for HigherOrder Logic – T Nipkow, L C Paulson, Wenzel - 2002
14 Finding lexicographic orders for termination proofs in Isabelle/HOL – Lukas Bulwahn, Er Krauss, Tobias Nipkow - 2007
4 Formalising Huffman’s Algorithm – Laurent Théry - 2004
3 A Correctness Proof of Huffman Algorithm. http://coq. inria.fr/contribs/Huffman.html – Laurent Théry - 2003
10 A code generator framework for Isabelle/HOL – Florian Haftmann, Tobias Nipkow - 2007
199 Melham, editors. Introduction to HOL: A theorem proving environment for higher order logic – M J C Gordon, T F - 1993
42 Random testing in isabelle/hol – Stefan Berghofer, Tobias Nipkow, Technische Universität München - 2004
24 The Definition of Standard ML, Revised edition – R Milner, M Tofte, R Harper, D MacQueen - 1997
8 Automating Recursive Definitions and Termination Proofs in Higher-Order Logic – A Krauss - 2009
942 A method for the construction of minimum-redundancy codes – D Huffman - 1952
707 Introduction to Algorithms, second edition – Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein - 2001
702 Data Structures and Algorithms – Alfred V Aho, John E Hopcroft, Jeffrey D Ullman - 1983
107 Generalized Kraft’s inequality and arithmetic coding – J Rissanen - 1976
33 The Isabelle/Isar Reference Manual – Markus Wenzel - 2007
12 Partial recursive functions in higher-order logic – Alexander Krauss - 2006
8 Partial and nested recursive function definitions in higher-order logic – A Krauss
1 Bjørner (2013): Domain Science and Engineering as a Foundation for Computation for Humanity, chapter 7 – Dines
1 Haftmann (2013): Code generation from Isabelle/HOL theories. Theorem Proving Group at TUM, Munich. Available at http://isabelle.in.tum.de/dist/Isabelle2013/doc/codegen. pdf. Part of the Isabelle distribution – Florian
1 Thèry (1998): A sceptic’s approach to combining HOL and Maple – John Harrison, Laurent