A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Extracting Imperative Programs from Proofs: In-place Quicksort
2014
Types for Proofs and Programs
The process of program extraction is primarily associated with functional programs with less focus on imperative program extraction. In this paper we consider a standard problem for imperative programming: In-place Quicksort. We formalize a proof that every array of natural numbers can be sorted and apply a realizability interpretation to extract a program from the proof. Using monads we are able to exhibit the inherent imperative nature of the extracted program. We see this as a first step
doi:10.4230/lipics.types.2013.84
dblp:conf/types/BergerSW13
fatcat:ofhtwmjlsjb5nau5y3lqrkxspa