tarix is a simple indexer for GNU and POSIX tar files. The indexes allow fast extraction of files in the archive, especially on seekable tape devices. The index format is simple enough to be used from a rescue disk with only mt, dd, and tar (though grep and sed would be very useful there).
xmltvdb creates a database from a set of xmltv listings and then provides a Web interface to view the TV listings in a grid format similar to many Web-based listings providers, but with user customization and no advertising. It supports explicit and bayesian classification of shows to highlight items you like and de-emphasize ones you don't.
> The fibo example proves that even
> propagation techiques are not always
> possible (what if the entire program is
> about find_prime_no (10^10)? This is a
> constant that could be computed at
> compile time, but unfortunatelly it will
> take several years for the compiler to
> compute it)
This is trivially dealt with. Any system to do recursive constant propogation like this generally has (implcitly or explicitly) a limit to the depth of evaluation. Explicit can be in the sense of rules like "only do recursive function constant evaluation up to a depth N". Implicit can be in the sense of the compiler using recursive functions to do the expansion and stack overflowing itself when it gets too deep. The latter of course would trigger a bug report by someone and probably get translated to the former.
The one (unlikely?) possibility is if the compiler's evaluation technique uses tail recursion or some other method that won't trigger a stack overflow, in which case it will, as you said, run for several years. Personally I would file that behavior as either a bug that can be fixed with the explicit recursion limit, or under the general heading of GIGO (Garbage In ...)