2026-07-23T18:53:47Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:13926 2024-03-06T10:53:09Z ddc:004 open_access

Proof Pearl : Playing with the Tower of Hanoi Formally Théry, Laurent Mathematical logic Formal proof Hanoi Tower 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Laurent Théry 2021 Is Part Of LIPIcs, Volume 193, 12th International Conference on Interactive Theorem Proving (ITP 2021) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ITP.2021.31 urn:nbn:de:0030-drops-139267 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITP.2021.31 eng https://creativecommons.org/licenses/by/4.0/legalcode