, Volume 51, Issue 4, pp 357-370,
Open Access This content is freely available online to anyone, anywhere at any time.

Proof Pearl—A Mechanized Proof of GHC’s Mergesort

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.

This research is supported by the Austrian Science Fund (FWF): J3202.