This is the first release after importing from 1997 sources.

The objectives for this release are:

  • Verifying existing features
  • Minor bug fixes.
  • Solidifying ASDF support for compiling and loading the package.

Milestone: Reorganization and clean up

11 years late (Mar 1, 2009, 12:00:00 AM)

The goals for this milestone are:

  • Move from flat source code structure to a tree structure.
  • Reorganize existing files into logical components.
  • Organize the existing test suite into unit tests.

Milestone: A rewrite using CLOS

10 years late (Jun 1, 2009, 12:00:00 AM)

When the package was conceived, CLOS was not an option. Currently, it appears that CLOS is solid enough to be used throughout the project.

Specific objectives

There are several versions of the Grobner basis algorithm. They use slightly different representation of polynomials and polynomial ideas. Inheritance can be used to have a cleaner design, by using a number of generic functions, such as:

  • polynomial arithmetic
  • division and normal form

Moreover, "sugar" can be handled in an aspect-oriented style, as manipulating sugar is naturally an :after method for several generic functions. Handling "sugar" in this manner should eliminate code duplication.

Note: See TracRoadmap for help on using the roadmap.