The pack-graph algorithms can be greatly improved and clarified by using dynamic rules, especially the ‘extended’ features. For instance, a work list can be extended using :+ and consumed using once-, etc.

Submitted on 24 July 2004 at 18:29