Spider Spinning for Dummies
Spider spinning is a snappy name for the problem of listing the ideals of a totally acyclic poset in such a way that each ideal is computed from its predecessor in constant time. Such an algorithm is said to be loopless. Our aim in these lectures is to show how to calculate a loopless algorithm for spider spinning. The calculation makes use of the fundamental laws of functional programming and the real purpose of the exercise is to show these laws in action.
KeywordsLinear Time Binary Tree Transition Code Functional Programming Gray Code
Unable to display preview. Download preview PDF.
- 4.Knuth, D.E.: SPIDERS: (2001), http://www-cs-faculty.stanford.edu/~knuth/programs.html