Playing with the Tower of Hanoi Formally - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2020

Playing with the Tower of Hanoi Formally


The Tower of Hanoi is a typical example that illustrates all the power of recursion in programming. 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 about it that have been formalised in the Coq proof assistant.
Fichier principal
Vignette du fichier
Note.pdf (316.26 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02903548 , version 2 (21-07-2020)


  • HAL Id : hal-02903548 , version 2


Laurent Théry. Playing with the Tower of Hanoi Formally. 2020. ⟨hal-02903548⟩
140 View
1026 Download


Gmail Facebook X LinkedIn More