Journal of Automated Reasoning

, Volume 51, Issue 4, pp 357–370

Proof Pearl—A Mechanized Proof of GHC’s Mergesort

Open Access
Article

DOI: 10.1007/s10817-012-9260-7

Cite this article as:
Sternagel, C. J Autom Reasoning (2013) 51: 357. doi:10.1007/s10817-012-9260-7

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.

Keywords

Mergesort Theorem proving Code generation 
Download to read the full article text

Copyright information

© The Author(s) 2012

Authors and Affiliations

  1. 1.School of Information ScienceJapan Advanced Institute of Science and TechnologyNomiJapan

Personalised recommendations