Release Name: 0.3.0

Notes:
Major Reimplementation Release

Take care...


Changes:
2007-05-05 * 0.3.0 * Major work on the implementation: 
                      - Supports list comprehensions for infinite list like
                        Haskell does by offering a simple DSL.
                      - Added cartesian products to LazyList.
                     Many thanks to Reginald Braithwaite <reg@braythwayt.com>
                     for his interesting ideas & email discussion about this
                     topic. Be sure to check out his blog under
                     http://weblog.raganwald.com/, where he writes about all
                     kinds of other interesting stuff.
                   * A nice side effect of the changes necessary for the
                     new implementation is that the first value of a list is
                     not forced until requested. This also causes a bit of
                     space&time waste, but hardware is getting better and
                     cheaper, isn't it?
                   * Now there is more than one Empty object, be careful not to
                     use equal? to compare them. It's better to use LazyList#empty?
                     for this.
                   * Switched from the continuation based ReadQueue to a Thread
                     based one, that should be a bit faster.
                   * Better organization of the file structure.
                   * Added version information.