License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ITP.2021.31
URN: urn:nbn:de:0030-drops-139267
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/13926/
Théry, Laurent
Proof Pearl : Playing with the Tower of Hanoi Formally
Abstract
The Tower of Hanoi is a typical example that is used in computer science courses to illustrate all the power of recursion. In this paper, we show that it is also a very nice example for inductive proofs and formal verification. We present some non-trivial results that have been formalised in the {Coq} proof assistant.
BibTeX - Entry
@InProceedings{thery:LIPIcs.ITP.2021.31,
author = {Th\'{e}ry, Laurent},
title = {{Proof Pearl : Playing with the Tower of Hanoi Formally}},
booktitle = {12th International Conference on Interactive Theorem Proving (ITP 2021)},
pages = {31:1--31:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-188-7},
ISSN = {1868-8969},
year = {2021},
volume = {193},
editor = {Cohen, Liron and Kaliszyk, Cezary},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/13926},
URN = {urn:nbn:de:0030-drops-139267},
doi = {10.4230/LIPIcs.ITP.2021.31},
annote = {Keywords: Mathematical logic, Formal proof, Hanoi Tower}
}
