("robby" "redex.plt" 3 1) 

  - adds the ability to have multi-colored terms, not just
    pink ones.

("robby" "redex.plt" 3 0)

This release changes the syntax of the reduction relations
to make it more consistent and more in line with the way
reduction relations are written in papers. This is the
precise set of removals and additions:

  - added extend-language
  - added reduction-rule & apply-reduction-relation
  - added union-reduction-relations
  - added define-language

  - changed compatible-closure & context-closure so that the
    pattern argument is not quoted, but is just the pattern
    in the last argument.

  - changed term-node-labels so that it can return #f (in
    the list) when a reduction doesn't have a label.

  - removed language->predicate, compile-pattern,
    match-pattern (use test-match instead)

  - removed reduction, reduction/name, reduction/context,
    reduction/context/name (use reduction-relation instead)

  - removed red? (use reduction-relation? instead)

  - removed reduce (use apply-reduction-relation instead)

  - removed reduce-all (use apply-reduction-relation* insetad)

  - removed reduce/tag-with-reduction (use
    apply-reduction-relation/tag-with-names instead)

  - removed red-name, reduction->name, give-name

  - removed language (use define-language instead)

  - removed helper.ss

Other improvements:

  - check syntax draws arrows for the non-terminals in a
    `language' now, both to the language and to the
    reduction rules.

("robby" "redex.plt" 2 6)

  - added reduce-all and note about bad parsing performance
    issues.

  - added `test-match' and note about how to debug redex
    programs to doc.txt
 
  - added redex-specific 'check' functions for use with
    schemeunit.

  - add `metafunction' for defining meta functions using the
    pattern matching notation used in reductions and grammars.

("robby" "redex.plt" 2 5) 

  - fixed bugs in compatible-closure & context-closure

("robby" "redex.plt" 2 4) 

  - reduced the amount of memory used for caching
    significantly (with some small speedup for 
    a largeish reduction semantics test suite)

  - added set-cache-size!

  - added variable-prefix pattern

  - added ..._<id> pattern that can be used to ensure matching
    lengths of repeated patterns.

  - added _!_ subscripts (both in ... and regular) to ensure
    that the matched things are different (or have different
    lengths in the case of ..._!_ subscripts)

("robby" "redex.plt" 2 3) 

  - added the ability to traverse the graph generated by
    traces in order to decide if a term should be
    highlighted in red. See the traces/pred documentation
    for details.

  - added term-node functions

  - added red-name function

  - removed make-plt.ss from archive

("robby" "redex.plt" 2 2)

  - added a blurb, fixed a typo in the docs.

("robby" "redex.plt" 2 1)

  - changed the way a contract is specified on the matcher
    to get a 30% speed up on the beginner test suite.
    Thanks, Matthew for spotting that!

("robby" "redex.plt" 2 0)

  - fixed a bug in compatible-closure handling that could
    result in duplicate matches when there should only have
    been a single match.

  - added labels to edges for reductions
    when shown in GUI. See docs for
    reduction/name

  - small performance improvement to matcher 
    (10-20% on non-trivial examples)

  - added letrec.ss example (and improved some
    of the examples to use labels)

("robby" "redex.plt" 1 3)

  - Fixed a bug in the the compatible closure function; otherwise the
    same as 1.1

("robby" "redex.plt" 1 2)

  - Obsolete'd version. It used to be a first attempt at the 2.0
    revision, but now should be avoided. 

    Use 2.0 instead of this version.

("robby" "redex.plt" 1 1)

  - fixed packaging error

("robby" "redex.plt" 1 0)

  - initial release to PLaneT