Skip to Main content Skip to Navigation
Conference papers

Proof Pearl : Playing with the Tower of Hanoi Formally

Laurent Théry 1 
1 STAMP - Sûreté du logiciel et Preuves Mathématiques Formalisées
CRISAM - Inria Sophia Antipolis - Méditerranée
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.
Document type :
Conference papers
Complete list of metadata
Contributor : Laurent Théry Connect in order to contact the contributor
Submitted on : Monday, August 23, 2021 - 2:35:40 PM
Last modification on : Monday, March 21, 2022 - 11:29:08 AM




Laurent Théry. Proof Pearl : Playing with the Tower of Hanoi Formally. ITP 2021 - 12th International Conference on Interactive Theorem Proving, Jun 2021, Rome / Virtual, Italy. ⟨10.4230/LIPIcs.ITP.2021.31⟩. ⟨hal-03324274⟩



Record views