Producing All Ideals of a Forest, Functionally

We present a functional implementation of Koda and Ruskey's algorithm for generating all ideals of a forest poset as a Gray code. Using a continuation-based approach, we give an extremely concise formulation of the algorithm's core. Then, in a number of steps, we derive a rst-order version whose eciency is comparable to a C implementation given by Knuth