License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.TYPES.2013.84
URN: urn:nbn:de:0030-drops-46274
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2014/4627/
Go to the corresponding LIPIcs Volume Portal

Berger, Ulrich ; Seisenberger, Monika ; Woods, Gregory J. M.

Extracting Imperative Programs from Proofs: In-place Quicksort

pdf-format:
p084-05-berger.pdf (0.5 MB)

Abstract

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 towards an automated extraction of imperative programs. The case study is carried out in the interactive proof assistant Minlog.

BibTeX - Entry

@InProceedings{berger_et_al:LIPIcs:2014:4627,
  author =	{Ulrich Berger and Monika Seisenberger and Gregory J. M. Woods},
  title =	{{Extracting Imperative Programs from Proofs: In-place Quicksort}},
  booktitle =	{19th International Conference on Types for Proofs and Programs (TYPES 2013)},
  pages =	{84--106},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-72-9},
  ISSN =	{1868-8969},
  year =	{2014},
  volume =	{26},
  editor =	{Ralph Matthes and Aleksy Schubert},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2014/4627},
  URN =		{urn:nbn:de:0030-drops-46274},
  doi =		{10.4230/LIPIcs.TYPES.2013.84},
  annote =	{Keywords: Program Extraction, Verification, Realizability, Imperative Programs, In-Place Quicksort,Computational Monads, Minlog}
}

Keywords: Program Extraction, Verification, Realizability, Imperative Programs, In-Place Quicksort,Computational Monads, Minlog
Collection: 19th International Conference on Types for Proofs and Programs (TYPES 2013)
Issue Date: 2014
Date of publication: 25.07.2014

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI