Spider spinning for dummies

Authors:
Richard S. Bird
Affiliations:
Oxford University, Computing Laboratory, Oxford, UK
Venue:
AFP'08 Proceedings of the 6th international conference on Advanced functional programming
Year:
2008

Citing 4
Cited 0

A Gray code for the ideals of a forest poset

Journal of Algorithms
Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations

Journal of the ACM (JACM)
Producing all ideals of a forest, functionally

Journal of Functional Programming
The Art of Computer Programming, Volume 4, Fascicle 3: Generating All Combinations and Partitions

The Art of Computer Programming, Volume 4, Fascicle 3: Generating All Combinations and Partitions

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.