
Fully Ordered Finite Sets for ACL2
Change Log

Version 0.8b
Mar 23, 2004

  - Matt Kaufmann made some updates: (Thanks!)

    * Updated the build system to work nicely with ACL2's makefiles
 
    * Changed computed-hints helper functions to program mode to fix
      problems with more stringent guard-checking on function redef-
      inition in ACL2 2.8.

    * Updated the README file to be more accurate about what is built
      when make is invoked.

    * Cleaned up stray parens in membership.lisp



Version 0.8
Mar 18, 2004

  - Moved cardinality from primitive to outer level. 

  - Added a mergesort for efficiently creating sets.

  - Eric Smith made many suggestions:  (Thanks!)

    * changed .acl2 files to not have include-book events within them,
      rather the .lisp files themselves have these events. 

    * changed sets.lisp to locally include all of the other books, and 
      redefine the theorems that should be exported. 

    * added package.lisp file, contains the defpkg command for using
      the sets package while certifying other books.  just ld it in 
      your own .acl2 files.

  - Added set-order.lisp file which can optionally be included to 
    help with reasoning about the set order. 

  - Added (disable-set-reasoning) macro, and now the enable/disable
    macros also enable/disable the strategy theorems appropriately.

  - Removed the double-containment strategy as a computed hint, added
    a new theorem named double-containment which explicitly rewrites
    equalities between sets into double subsets. 

  - Added some theorems about differences (difference-insert-X/Y, 
    difference-delete-X/Y).

  - Trivial cleanups of some theorem names. (weak-insert-induction-
    helper-X instead of referring to subgoal names.)



Version 0.7
Feb 19, 2004

  - Added weak insert induction scheme to membership.lisp

  - Added typed sets extension (typed.lisp)



Version 0.6
Feb 1, 2004

  - First "publically available" version

