A code generator framework for Isabelle/HOL (2007)

by Florian Haftmann , Tobias Nipkow
Venue:Department of Computer Science, University of Kaiserslautern
Citations:10 - 4 self

Documents Related by Co-Citation

724 M.: Isabelle/HOL - A Proof Assistant for HigherOrder Logic – T Nipkow, L C Paulson, Wenzel - 2002
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
14 Finding lexicographic orders for termination proofs in Isabelle/HOL – Lukas Bulwahn, Er Krauss, Tobias Nipkow - 2007
42 Random testing in isabelle/hol – Stefan Berghofer, Tobias Nipkow, Technische Universität München - 2004
942 A method for the construction of minimum-redundancy codes – D Huffman - 1952
702 Data Structures and Algorithms – Alfred V Aho, John E Hopcroft, Jeffrey D Ullman - 1983
84 Theorem Proving with the Real Numbers – John Robert Harrison - 1996
4 Automated methods for formal proofs in simple arithmetics and algebra – Amine Chaieb
5 A Compiled Implementation of Normalization by Evaluation – Klaus Aehlig, Florian Haftmann, Tobias Nipkow
1312 Monads for functional programming – Philip Wadler - 1995
7 The Isabelle/Isar Reference Manual. http://isabelle.in.tum.de/doc/isar-ref.pdf – Makarius Wenzel
199 Melham, editors. Introduction to HOL: A theorem proving environment for higher order logic – M J C Gordon, T F - 1993
24 The Definition of Standard ML, Revised edition – R Milner, M Tofte, R Harper, D MacQueen - 1997
5 Defining Recursive Functions in Isabelle/HOL – Alexander Krauss
8 Automating Recursive Definitions and Termination Proofs in Higher-Order Logic – A Krauss - 2009
707 Introduction to Algorithms, second edition – Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein - 2001
107 Generalized Kraft’s inequality and arithmetic coding – J Rissanen - 1976
33 The Isabelle/Isar Reference Manual – Markus Wenzel - 2007