Proof Pearl : Playing with the Tower of Hanoi Formally - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2021

Proof Pearl : Playing with the Tower of Hanoi Formally

Preuve : Jouer avec les tours d'Hanoï formellement

Résumé

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.
Fichier non déposé

Dates et versions

hal-03324274 , version 1 (23-08-2021)

Identifiants

Citer

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⟩
26 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More