Functional pearl: la tour d'Hanoï

Authors:
Ralf Hinze
Affiliations:
University of Oxford, Oxford, United Kingdom
Venue:
Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
Year:
2009

Citing 4
Cited 0

Algebra of programming

Algebra of programming
The associativity of equivalence and the Towers of Hanoi problem

Information Processing Letters - Special issue in honor of Edsger W. Dijkstra
The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations (Art of Computer Programming)

The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations (Art of Computer Programming)
Functional pearl: streams and unique fixed points

Proceedings of the 13th ACM SIGPLAN international conference on Functional programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

This pearl aims to demonstrate the ideas of wholemeal and projective programming using the Towers of Hanoi puzzle as a running example. The puzzle has its own beauty, which we hope to expose along the way.