Functional pearl

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Functional pearl: la tour d'Hanoï

Full text

Pdf (460 KB)

Source

International Conference on Functional Programming archive
Proceedings of the 14th ACM SIGPLAN international conference on Functional programming table of contents

Edinburgh, Scotland

SESSION: Session 1 table of contents

Pages 3-10

Year of Publication: 2009

ISBN:978-1-60558-332-7

Also published in ...

Author

Ralf Hinze

University of Oxford, Oxford, United Kingdom

Sponsors

ACM: Association for Computing Machinery
SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 50, Downloads (12 Months): 399, Citation Count: 0

Additional Information:

abstract references index terms

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1596550.1596555 What is a DOI?

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.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Backhouse, Roland, and Maarten Fokkinga. 2001. The associativity of equivalence and the Towers of Hanoi problem. Information Processing Letters 77:71--76.
	2	Bird, Richard, and Oege de Moor. 1997. Algebra of Programming. London: Prentice Hall Europe.
	3	Buneman, Peter, and Leon Levy. 1980. The Towers of Hanoi problem. Information Processing Letters 10(4-5):243--244.
	4	Er, M.C. 1983. An analysis of the generalized Towers of Hanoi problem. BIT 23:429--435.
	5	Gardner, Martin. 1972. Mathematical games: The curious properties of the Gray code and how it can be used to solve puzzles. Scientific American 227(2):106--109. Reprinted, with Answer, Addendum, and Bibliography, as Chapter 2 of Knotted Doughnuts and Other Mathematical Entertainments, W. H. Freeman and Co., New York, 1986.
	6	Hinze, Ralf. 2008. Functional Pearl: Streams and Unique Fixed Points. In Proceedings of the 2008 International Conference on Functional Programming, ed. Peter Thiemann, 189--200. ACM Press.
	7	Knuth, Donald E. 2005. The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations. Addison-Wesley Publishing Company.
	8	Korittky, Joachim. 1998. Functional METAPOST. Diplomarbeit, Universitat Bonn.
	9	Stockmeyer, Paul K. 2005. The Tower of Hanoi: A bibliography. Available from http://www.cs.wm.edu/~pkstoc/biblio2.pdf.