Producing all ideals of a forest, functionally

Authors:
Jean-Christophe Filliâtre;François Pottier
Affiliations:
Laboratoire de Recherche en Informatique, Université Paris Sud, 91405 Orsay Cedex, France (e-mail: Jean-Christophe.Filliatre@lri.fr);INRIA Rocquencourt, B.P. 105, 78153 Le Chesnay Cedex, France (e-mail: Francois.Pottier@inria.fr)
Venue:
Journal of Functional Programming
Year:
2003

Citing 5
Cited 4

A Gray code for the ideals of a forest poset

Journal of Algorithms
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information

The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
Definitional Interpreters Revisited

Higher-Order and Symbolic Computation
Definitional Interpreters for Higher-Order Programming Languages

Higher-Order and Symbolic Computation
Defunctionalization at work

Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming

Refunctionalization at work

Science of Computer Programming
Who: a verifier for effectful higher-order programs

Proceedings of the 2009 ACM SIGPLAN workshop on ML
Spider spinning for dummies

AFP'08 Proceedings of the 6th international conference on Advanced functional programming
Loopless functional algorithms

MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present functional implementations 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 first-order version whose efficiency is comparable to that of a C implementation given by Knuth.