Hostname: page-component-74656f9884-j7cmm Total loading time: 0 Render date: 2026-11-10T12:46:52.430Z Has data issue: false hasContentIssue false
  • English
  • Français

Producing all ideals of a forest, functionally

Published online by Cambridge University Press:  27 August 2003

JEAN-CHRISTOPHE FILLIÂTRE  and
FRANÇOIS POTTIER
JEAN-CHRISTOPHE FILLIÂTRE
Affiliation:
Laboratoire de Recherche en Informatique, Université Paris Sud, 91405 Orsay Cedex, France (e-mail: Jean-Christophe.Filliatre@lri.fr)
FRANÇOIS POTTIER
Affiliation:
INRIA Rocquencourt, B.P. 105, 78153 Le Chesnay Cedex, France (e-mail: Francois.Pottier@inria.fr)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
FUNCTIONAL PEARL
Information
Journal of Functional Programming , Volume 13 , Issue 5 , September 2003 , pp. 945 - 956
Copyright
2003 Cambridge University Press
Submit a response

Discussions

No Discussions have been published for this article.