Playing with the Tower of Hanoi Formally - Inria - Institut national de recherche en sciences et technologies du numérique
Pré-Publication, Document De Travail Année : 2020

Playing with the Tower of Hanoi Formally

Résumé

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
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

  • HAL Id : hal-02903548 , version 2

Citer

Laurent Théry. Playing with the Tower of Hanoi Formally. 2020. ⟨hal-02903548⟩
171 Consultations
1147 Téléchargements

Partager

More