source: CGBLisp/src/RCS/cgb.asd,v@ 1

head    1.9;
access;
symbols;
locks; strict;
comment @# @;


1.9
date    2009.01.24.21.41.56;    author marek;   state Exp;
branches;
next    1.8;

1.8
date    2009.01.24.21.28.59;    author marek;   state Exp;
branches;
next    1.7;

1.7
date    2009.01.24.10.56.55;    author marek;   state Exp;
branches;
next    1.6;

1.6
date    2009.01.22.03.43.49;    author marek;   state Exp;
branches;
next    1.5;

1.5
date    2009.01.21.23.47.37;    author marek;   state Exp;
branches;
next    1.4;

1.4
date    2009.01.21.19.42.16;    author marek;   state Exp;
branches;
next    1.3;

1.3
date    2009.01.21.19.17.35;    author marek;   state Exp;
branches;
next    1.2;

1.2
date    2009.01.21.19.16.28;    author marek;   state Exp;
branches;
next    1.1;

1.1
date    2009.01.21.19.15.39;    author marek;   state Exp;
branches;
next    ;


desc
@@


1.9
log
@*** empty log message ***
@
text
@;;; -*- Mode: Lisp; Syntax: Common-Lisp; Package: Grobner; Base: 10 -*-
(defpackage cgb-system
  (:use :common-lisp :asdf))

(in-package :cgb-system)

;;----------------------------------------------------------------
;; Various features which affect the functioning of the package
;;----------------------------------------------------------------

;;Use pseudodivision to keep the size of integer coefficients 
;;as small as possible
(pushnew :pseudodivide *features*)

;;Use the grobner package within colored-poly package
(pushnew :colored-poly-use-grobner *features*)

;;colored-poly package
;;Compute saturation of green lists with respect to
;;red lists in order to eliminate cases early
(pushnew :use-saturation *features*)

;;Print tracing and debugging output
(pushnew :debug *features*)

;;Use gcd of integers to keep the size of integer coefficients
;; of S-polynomials and normal forms down
(pushnew :use-gcd *features*)

;;grobner package
;;Use the algorithm of Gebauer and Moeller (1988) to
;;calculate Grobner bases
;;(pushnew :use-gebauer-moeller *features*)

;;Use pair reordering according to some heuristic in the
;;Grobner algorithm
(pushnew :reorder-pairs *features*)

;; ----------------------------------------------------------------
;; End of feature setup
;; ----------------------------------------------------------------

(defsystem "cgb"
  :description "Comprehensive Grobner Basis Lisp system"
  :version "1.0"
  :author "Marek Rychlik <rychlik@@u.arizona.edu>"
  :licence "Custom"
  :serial t
  :components ((:file "infix")
               (:file "makelist")
               (:file "order")
               (:file "monom")
               (:file "xgcd")
               (:file "modular")
               (:file "coefficient-ring")
               (:file "term")
               (:file "poly")
               (:file "modular-poly")
               (:file "division")
               (:file "parse")
               (:file "printer")
               (:file "poly-with-sugar")
               (:file "grobner")
               (:file "colored-poly")
               (:file "poly-gcd")
               (:file "rat")
               (:file "ratpoly")
               (:file "string-grobner")
               (:file "dynamics")
               (:file "prover")
               (:file "cgb-lisp")))
            @


1.8
log
@*** empty log message ***
@
text
@d7 30
a36 1
;; Set up globals
d39 4
@


1.7
log
@*** empty log message ***
@
text
@d7 3
@


1.6
log
@*** empty log message ***
@
text
@d12 1
@


1.5
log
@*** empty log message ***
@
text
@d12 2
a13 2
  :components ((:file "makelist")
               (:file "infix")
@


1.4
log
@*** empty log message ***
@
text
@d13 1
a33 1
               (:file "infix")
@


1.3
log
@*** empty log message ***
@
text
@d34 1
a34 1
               (:file "CGB-LISP")))
@


1.2
log
@*** empty log message ***
@
text
@d2 1
a2 1
(defpackage cgb
d5 1
a5 1
(in-package :cgb)
@


1.1
log
@Initial revision
@
text
@a34 3

            
            
@