Proof Pearl--A Mechanized Proof of GHC's Mergesort

Authors:
Christian Sternagel
Affiliations:
School of Information Science, Japan Advanced Institute of Science and Technology, Nomi, Japan
Venue:
Journal of Automated Reasoning
Year:
2013

Citing 5
Cited 0

ML for the working programmer (2nd ed.)

ML for the working programmer (2nd ed.)
Certification of Termination Proofs Using CeTA

TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Partial and Nested Recursive Function Definitions in Higher-order Logic

Journal of Automated Reasoning
Isabelle/HOL: a proof assistant for higher-order logic

Isabelle/HOL: a proof assistant for higher-order logic
Code generation via higher-order rewrite systems

FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present our Isabelle/HOL formalization of GHC's sorting algorithm for lists, proving its correctness and stability. This constitutes another example of applying a state-of-the-art proof assistant to real-world code. Furthermore, it allows users to take advantage of the formalized algorithm in generated code.