Functional pearl

DOI10.1145/1596550.1596555MaRDI QIDQ2936797zbMATH OpenOpenAlexFDO

Authors Ralf Hinze

Publication date 6 January 2015

Published in Proceedings of the 14th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1596550.1596555

zbMATH Keywords

Gray codeHanoi graphprojective programmingSierpiński gasket graphSierpiński graphTowers of Hanoiwholemeal programming

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Combinatorics in computer science (68R05)

Recommendations

• Functional pearl: every bit counts
• All sorts of permutations (functional pearl)
• FUNCTIONAL PEARL: Enumerating the rationals
• Hanoi revisited
• Functional Pearls
• Functional pearl: streams and unique fixed points
• Scrap your nameplate (functional pearl)

Cited in

(2)

• Solving the snake cube puzzle in Haskell
• Hanoi revisited

This page was built for publication: Functional pearl

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2936797)