% from 11.1.91 hk, version 0.3
% from 13.10.96 hk, version 1.0
 

\appendix

\chapter{Distribution}

\section{Distribution files} %------------------------------

The distribution is by means of gnuzip'ed tar files. Form the 
distribution files you need at least an executable, the tutorial 
and the examples. 

If you pick the source code we recommend to pick also the 
definition module and indexes document along with it. To compile 
the source code you will also need the Modula-2 to C translator "mtc", 
the "reuse" library, gnumake, and a C-compiler (preferably gcc). 
Further we recommend the GNU readline library and the kpathsea library.

The following files are available

\begin{verbatim}
- executables

	mas-hppa1.1-hp-hpux9.03-1.00.tar.gz	HP Version
	mas-i386-unknown-os2-1.00.tar.gz	OS/2 Version
	mas-i486-unknown-linux-1.00.tar.gz	Linux Version
	mas-mab-next-nextstep3-1.00.tar.gz	NeXT Version
	mas-rs6000-ibm-aix3.2.5-1.00.tar.gz	IBM Version
	mas-sparc-sun-sunos4.1.3C-1.00.tar.gz	SUN Version


- documentation:

	mastut.tar.gz	MAS tutorial and interactive users guide in LaTeX.
	mastut.ps.gz	as PostScript

	masdef.tar.gz	MAS Modula-2 definition modules, 3 indexes 
			and specifications in LaTeX.
	masdef.ps.gz	as PostScript


- examples and test files:

	masexam.tar.gz	examples, help files, test files. 


- Modula-2 source code:

	massrc.tar.gz
\end{verbatim}


\section{Installation} %------------------------------

\subsection{Unpack}

To install MAS unpack the respective files. E.g. with 
\begin{verbatim}
     gnutar xfvz masexam.tar.gz 
or 
     gzip -d -c masexam.tar.gz | tar -cvf -
\end{verbatim}
in some directory. The files will unpack into the following 
subdirectories:

{\small 
\begin{verbatim}
mas/doc	
       /mastut		Tutorial and Users Guide.
       /masdef		Definitions and indexes document.
       /massys  	System document.
   /<machine>		Executables in respective machine directory 
       mas		Unix executable. 
       mas.exe          OS2 executable, requires /dll.
       emx.exe mas.out	DOS extender and executable. 
   /exam		Examples *.in
                	Copying information   
        mas.ini		initialization file.
        spec.ini 	specification initialization file.
        helpup.in	Help initialization file.
        testall.mas	Driver file for /test directory.
        /help		Comments and module information.
        /spec		Example specifications.
        /test		Test files.
   /dll			emx dyn. link libs for OS2.
   /src			Modula-2 source code 
       /maskern		System dependent files, memory, IO, ... 
       /maslisp		LISP interpreter, parsers, ...
       /masmain 	Main program, interfaces, ...
       /masarith	Basic Arithmetic, integer, rational, ...
       /maspoly		Polynomial systems, recursive, distributive, ...
       /masring		Ideals, Groebner bases, algeb. geometry, ...
       /masmodul 	Linear algebra, diophantine equations, syzygies, ...
       /masnc		Non-commutative solvable polynomial rings, ...
       /sacring		Polynomial factorization, real roots, gcd, res, ...
       /masroot		Real root counting, ...
       /maslog		Logic formuals, Real Quantifier Elimination, ...  
       /masdom		Domain coefficients, comprehensive G bases, ...
       /masib		Involutive bases, ...
\end{verbatim}
}

File naming conventions: 
\begin{verbatim}
        *.md		Modula-2 definition modules.
        *.mi		Modula-2 implementation modules.
        *.h		C header files.
        *.c		C code files.
        *.o		object code files.
        *.a		library archives.

        *.ini 		MAS initialization files.
        *.hlp		MAS help information.
        *.in		MAS input files.
        *.mas		MAS input files.
        *.out		MAS output files.
\end{verbatim}


\subsection{Test}

Test the installation with the following command 
\begin{verbatim}
             [path]mas -m 4000 -f test-all.mas -e -omytest
\end{verbatim}
from the /exam directory. This produces a file 'mytest' which you can 
compare to the supplied 'test-all.orig' file. The warnings are intentional 
and only lines with timings should "diff"er.


\section{Start -- Stop} %------------------------------

Add the mas/bin directory to the PATH or use the complete pathname
in the following examples. 

\begin{verbatim}
 - start         'mas' or 'mas.exe' or 'emx mas.out'  
 - banner        'This is MAS the Modula-2 Algebra System, Version 1.xx.'
 - system prompt 'MAS: ' 
 - system answer 'ANS: '
 - input (e.g.)  'a:=2*3.' A statement is terminated by period '.' 
 - help with     'help.' or 'help(name).' or 'help(name,Loaded).'
 - interupt      ^C     CNTRL-C 
 - leave with    'EXIT.' or 'exit.' or 'quit.'
\end{verbatim}



\subsection{Path and Compile}

On all systems add the mas/<machine> directory to the PATH or use the 
complete pathname to call the MAS executables.

On OS2 systems also add the mas/dll directory to the LIBPATH and reboot 
or use your existing emx dlls. 

To compile MAS unpack the source code and create a directory "<machine>" 
for your machine type. From the directory mas/<machine> execute ../configure 
to generate the Makefile, then execute gnumake to compile a mas executable.

Further details can be found in the readme file accompanied with the 
source code. 


\subsection{Notes}

\begin{verbatim}
      - Some help facilities need an 'awk' program. 
      - The Makefiles for the source code may need an 
        'awk' or 'sed' program or other unix utilities.  
\end{verbatim}



\section{Release and Change Notes} %------------------------------

Major mathematical library changes of the current version 1.0 (June 1996) are:

\begin{verbatim}
     - added a package for counting real roots based on Hermites method 
       by F. Lippold, 
     - added a package on permutation invariant polynomials by M. Goebel, 
     - added an optimized Groebner base package 
       (including the "sugar"-method) by C. Rose, 
     - added a package to compute factorized Groebner bases by J. Pfeil, 
     - added a logic formula representation with simplification package  
       and real quantifier elimination package by A. Dolzmann, 
     - a package for involutive bases by R. Grosse-Gehling, 
     - Improved comprehensive Groebner Base algorithms using factorization 
       condition evaluation and case elimination by M.~Pesch, 
     - arbitrary domain polynomial system extended to a 
       generic Groebner base package.
\end{verbatim}


Major system changes of the current version 1.0 (June 1996) are:

\begin{verbatim}
     - MAS language accepts small letter key words 
       and braces {} to denote list expressions.
     - Improved error handling and user signal processing to 
       examine long running computations.
     - GNU readline for easier command line editing. 
     - Improved batch processing capabilities. 
     - Distribution now uses GNU autoconfig for easy compilation. 
     - Using Kpathsearch Library from K.~Berry.  
     - Generic garbage collection support for most architectures. 
\end{verbatim}


The major system changes between release 0.6 and 0.7 (April 1993) are:

\begin{verbatim}
     - Distribution based on Modula-2 to C translator and 
       a C distribution which will work on 'most' workstations. 
     - New support for PC 386 and higher (OS2 2.0 and higher) with 
       emx dll runtime libraries.   
     - New support for PC 386 and higher (DOS 5.0) with 
       emx DOS extender.
     - Dropped support for the Atari, Amiga and PC XT up to 286.
       That means, that we do no more distribute executables for 
       these systems, but if you have the maskern(el) you can get 
       the new source code (except maskern) and compile it on 
       your system. 
     - The HELP and help command has been changed to provide 
       name ranges and more information from the procedure comments. 
\end{verbatim}

Major mathematical library changes between release 0.6 and 0.7 are:

\begin{verbatim}
     - added comprehensive Groebner base package by E. Schoenfeld,
     - arbitrary domain polynomial system implemented, 
     - added several new basic arithmetic packages: 
       complex numbers, quaternion numbers, octonion numbers, 
       finite fields,
     - added package for computation in non-commutative polynomial 
       rings of solvable type: *-product, left Groebner base, 
       two-sided Groebner base, elements in the center,
     - added a package for the computation of generators for the 
       module of syzygies of systems of homogeneous polynomial 
       equations and Groebner bases for modules over polynomial rings 
       (also available for solvable polynomial rings) by J. Phillip,
     - added universal Groebner base package by T. Belkahia,
     - added d-Groebner base and e-Groebner base packages  
       for Groebner bases over the integers and univariate rational 
       polynomial rings by W. Mark. 
\end{verbatim}


The major changes between release 0.3 and 0.6 (March 1991) are:

\begin{verbatim}
     - added language extensions for specification capabilities,
     - added a parser for the ALDES language and 
       possibility for interpretation of ALDES programs,
     - added a linear algebra package,
     - added an interface between the MAS language 
       and the distributive polynomial system,
     - improved symbol handling by hash tables combined with 
       balanced trees,
     - EMS support for IBM PC implementations.
\end{verbatim}

The minor changes between release 0.3 and 0.6 are:

\begin{verbatim}
     - PRAGMA construct for the state definition of the 
       MAS executable.
     - Overloading of MAS arithmetical operators by 
       generic function names.
     - Typed string constants in MAS expressions.
     - VAR parameters in MAS procedure declarations in ALDES style.
     - Static scope analysis by the parser.
     - Explicit stack overflow check since not all compilers 
       handled stack overflow correctly.
\end{verbatim}

Release notes for Version 0.3 (November 1989): 

\begin{verbatim}
     - The MAS parser has been changed for better Modula-2 
       compatibility. 
     - MAS LISP has been made more robust against incorrect 
       user input.
     - The MAS main program has been enhanced to recognize 
       the following command line parameters: 
                -m number-of-KB     
                -f data-set-name
        - the memory option '-m' gives the number of Kilo-Byte
          storage, requested from the operating system. 
        - the file name option '-f' can be used to overwrite the
          default file name 'MAS.INI' during startup. With this
          option MAS can be run in batch mode if the EXIT 
          statement is contained in the data set.
\end{verbatim}

\section{Copyrights}

\begin{verbatim}
       MAS:         (c) 1989-1996, by H. Kredel, M. Pesch.
       ALDES/SAC-2: (c) 1982, by G.E.Collins, R.Loos.  
\end{verbatim}

All Rights Reserved. Permission is granted for unrestricted 
noncommercial use and noncommercial redistribution if and only if 
the copyright notice is retained when a copy is made. 
There are no known bugs, however I disclaim any usefulness and
make no warranty on the correctness of the Modula-2 Algebra System. 
For certain machines and/or operating systems further copying 
restrictions apply, e.g. see the files 
\begin{verbatim}
    copying.mas, copying.reuse, copying.mtc, 
    copying.emx, copying.gnu, copying.lib and copying.bsd
\end{verbatim}
in the \verb/exam/ directory. 
The C code has been generated from the Modula-2 sources of MAS
with the 'mtc' 'Modula-2 to C' translator by GMD Karlsruhe. 
Although it is not required, you should get a copy of it from some 
ftp site to have the sources of the used libraries. 
The executables for PC have been compiled using the GNU gcc compiler 
with the emx runtime system by Ernst Mattes. The latest versions and 
documentation of emx can also be found on ftp servers. 


%geht nicht \chapter*{Bibliography}
\addcontentsline{toc}{chapter}{Bibliography}

\begin{thebibliography}{KW88}

\bibitem[Apel, Lassner 1988]{AL88} J.\ Apel, W.\ Lassner,
        {\em An extension of Buchberger's algorithm and 
        calculations in enveloping fields of Lie algebras},
        J. Symb. Comp., {\bf 6}, pp 361--370, 1988.

\bibitem[Appel {\em et al.} 1988]{Appel88} 
        A.W.\ Appel, R.\ Milner, R.W.\ Harper, D.B.\ MacQueen,
        {\em Standard ML Reference Manual (preliminary draft)},
        University of Edinburgh, LFCS Report, 1988.

\bibitem[Armbruster, Kredel 1986]{AK86} D.\ Armbruster, H.\ Kredel,
        {\em Constructing universal unfoldings using 
        Gr\"obner bases},
        J. Symb. Comp., {\bf 2}, pp 383--388, 1986.

\bibitem[Bader 1994]{Bader94} I.\ Bader, 
        {\em Gr\"obner bases for non noetherian polynomial rings},
        Diplomarbeit, Universit\"at Passau, 1994.

\bibitem[Becker, Weispfenning 1993]{Becker93} T.\ Becker, V.\ Weispfenning, 
        in cooperation with H.\ Kredel, 
        {\em Gr\"obner Bases -- A Computational Approach to 
        Commutative Algebra},  
        Springer Verlag, Graduate Texts in Mathematics 141, 
        New York, 1993. 

\bibitem[Becker, W\"ormann 1991]{BEWO91}
        E.\ Becker, T.\ W\"ormann,
        {\em On the Trace Formula for Quadratic Forms and some Applications},
        Proc.~RAGSQUAD, 1991.

\bibitem[Belkahia 1992]{Belka92} T.\ Belkahia,
        {\em Implementierung eines Algorithmus zur Konstruktion
        universeller Gr\"obner Basen in SAC-2/ALDES}, 
        Diplomarbeit, Universit\"at Passau, 1992.

\bibitem[Ben-Or, Kozen, Reif 1986]{BKR86} M.\ Ben-Or, D.\ Kozen, J.\ Reif,
        {\em The Complexity of Elementary Algebra and Geometry},
        Journal of Computer and System Sciences 32, pp 251--264, 1986. 

\bibitem[Buchberger 1965]{Buchb65} B.\ Buchberger, 
        {\em Ein Algorithmus zum Auffinden der Basiselemente des
        Restklassenringes nach einem nulldimensionalen
        Polynomideal},
        Dissertation, University of Insbruck 1965.

\bibitem[Buchberger 1970]{Buchb70} B.\ Buchberger, 
        {\em Ein algorithmisches Kriterium f\"ur die L\"osbarkeit
        eines algebraischen Gleichungssystems},
        Aequ.\ Math.\ {\bf 4}, pp 374--383, 1970.

\bibitem[Buchberger 1979]{Buchb79} B.\ Buchberger, 
        {\em A criterion for detecting unneccessary reductions 
        in the reduction of Gr\"obner bases},
        Proc. EUROSAM'79, 
        Springer, Lect. Notes Comp. Sci. {\bf 72}, pp 3--21, 1979.

\bibitem[Buchberger {\em et al.} 1982]{BCL82} 
        B.\ Buchberger, G.E.\ Collins, R.G.\ Loos,
        {\em Computer algebra - symbolic and algebraic computation}
        Computing Supplement, Vienna: Springer, 1982.

\bibitem[Buchberger 1985]{Buchb85} B.\ Buchberger, 
        {\em Gr\"obner bases: An algorithmic method in
        polynomial ideal theory},
        In: (N.K.Bose ed.) Progress, directions and open problems
        in multidimensional systems theory. pp 184--232.
        Dordrecht: Reidel Publ.\ Comp., 1985.

\bibitem[B\"oge {\em et al.} 1985]{BGK85} 
        W.\ B\"oge, R.\ Gebauer, H.\ Kredel,
        {\em Gr\"obner bases using SAC-2},
        Proc.\ EUROCAL '85, European Conference on Computer Algebra,
        Linz 1985,
        Springer Lect. Notes Comp. Sci. {\bf 204}, pp 272--274, 1986.

\bibitem[B\"oge {\em et al.} 1986]{BGK86} 
        W.\ B\"oge, R.\ Gebauer, H.\ Kredel,
        {\em Some Examples for Solving Systems of Algebraic
        Equations by Calculating Gr\"obner Bases},
        J.\ Symbolic Computation, {\bf 1}, pp 83--98, 1986.

\bibitem[Butcher 1984]{Butcher84} C.J.\ Butcher,
        {\em An application of the Runge Kutta space},
        BIT Computer Science Numerical Mathematics 
        {\bf 24}, pp 425--440, 1984.

\bibitem[Calmet, Lugiez 1987]{CaL87} J.\ Calmet, D.\ Lugiez,
        {\em A knowledge--based system for Computer Algebra},
        SIGSAM Bulletin 1987, {\bf 21} / 1, pp 7--13, February 1987.

\bibitem[Carra-Ferro 1986]{CAF86} G.\ Carra-Ferro, 
        {\em Some Upper Bounds for the Multiplicity of an 
        Autoreduced Subset of $\N^m$ and their Application},
        AAECC-3, Grenoble 1985, Springer LNCS, Vol. 229, 1986.
 
\bibitem[Carra-Ferro 1987]{CAF87} G.\ Carra-Ferro, 
        {\em Some Properties of lattice points
        and their application to differential algebra},
        Communications in Algebra, 15(12), pp 2625--2632, 1987.

\bibitem[Chou, Collins 1982]{CC82} T.-W.J.\ Chou, G.E.\ Collins, 
        {\em Algorithms for the solution of systems of linear 
        diophantine equations},
        SIAM J. Computing, Vol. 11, No. 4, pp 687--708, 1982.

\bibitem[Collins 1971]{Collins71} G.E.\ Collins, 
        {\em SAC-1},
        Technical Reports 129, 115, 156, 135, 145. 
        Computer Sci. Dep., U. of Wisconsin, Madison, Wis., 1971.

\bibitem[Collins 1973]{Collins73} G.E.\ Collins, 
        {\em Computer algebra of polynomials and rational functions}, 
        American Math.\ Monthly, 80, pp 725--755, 1973.

\bibitem[Collins 1974]{Collins74} G.E.\ Collins, 
        {\em Quantifier Elimination for Real Closed Fields
        by Cylindrical Algebraic Decomposition}, 
        Preliminary Report,
        Proc. EUROSAM 1974, Stockholm, August 1974, pp 80--90.

\bibitem[Collins, Loos 1980]{CoL80} G.E.\ Collins, R.G.\ Loos,
        {\em ALDES/SAC-2 now available}, \\
        SIGSAM Bulletin 1982, and several reports distributed
        with the \\ ALDES/SAC-2 system.

\bibitem[Collins, Loos 1982]{CoL82} G.E.\ Collins, R.G.\ Loos, 
        {\em Real Zeros of Polynomials}, 
        in B.\ Buchberger, G.E.\ Collins, R.G.\ Loos, 
        {\em Computer algebra -- symbolic and algebraic computation}, 
        Vienna: Springer, pp 83--94, 1982. 

\bibitem[Davenport, Siret, Tournier 1988]{Davenp88}
         J.H.\ Davenport, Y.\ Siret, E.\ Tournier,
        {\em Computer Algebra -- Systems and Algorithms 
        for Algebraic Computation},
        Academic Press, 1988.

\bibitem[Davenport 1990]{Davenp90} J.H.\ Davenport, B.M.\ Trager,
        {\em Scratchpad's View of Algebra I:
        Basic Commutative Algebra},
        Proc. DISCO `90 Capri, LNCS 429, pp 40--54, Springer, 1990.

\bibitem[Dolzmann 1994]{Dolzmann94} A.\ Dolzmann,
        {\em Reelle Quantorenelimination durch 
        parametrisches Z\"ahlen von Nullstellen},
        Diplomarbeit, Fakult\"at f\"ur Mathematik und Informatik,
        Universit\"at Passau, 1994.

\bibitem[Engeln, Reutter 1988]{Engeln88} G.\ Engeln-M\"ullges, F.\ Reutter, 
        {\em Formelsammlung zur \\ Numerischen Mathematik
        mit Modula-2 Programmen}, 
        BI-Wissenschaftsverlag, Mannheim 1988.

\bibitem[Fitch, Norman 1977]{FiN77} J.P.\ Fitch, A.C.\ Norman,
        {\em Implementing LISP in a High-level Language},
        SOFTWARE-PRACTICE AND EXPERIENCE Vol.7, pp 713--725, 1977.

\bibitem[Garey, Johnson 1978]{GJ78} M.R.\ Garey, D.S.\ Johnson,
        {\em Computers and Intractability: A Guide to the Theory 
        of NP-Completeness}, 
        H. Freeman, San Francisco, 1978, printing 1984. 

\bibitem[Gebauer, Kredel 1983]{GK83} R.\ Gebauer, H.\ Kredel,
        {\em Distributive Polynomial System},
        Several Technical Reports,
        Institut f\"ur Angewandte Mathematik,
        Universit\"at Heidelberg, 1983.

\bibitem[Gebauer, Kredel 1983a]{GK83a} R.\ Gebauer, H.\ Kredel,
        {\em Buchberger algorithm system},
        Technical Report,
        Institut f\"ur Angewandte Mathematik,
        Universit\"at Heidelberg, 1983.
        (see also SIGSAM Bulletin Vol. 18, No. 1, p 19.)

\bibitem[Gebauer, M\"oller 1988]{GM88} R.\ Gebauer, H.-M.\ M\"oller, 
        {\em On an installation of Buchberger's algorithm}, 
        J. Symb. Comp., {\bf 6}/2/3, pp 275-286, 1988.

\bibitem[Geddes {\em et al.} 1986]{Geddes86} 
        B.W.\ Char, G.J.\ Fee, K.O.\ Geddes, G.H.\ Gonnet, M.B.\ Monagan,
        {\em A Tutorial Introduction to Maple},
        J.\ Symbolic Computation 2, pp 179--200, 1986.

\bibitem[Geddes {\em et al.} 1992]{Geddes92} 
        K.O.\ Geddes, S.R.\ Czapor, G.\ Labahn, 
        {\em Algorithms for Computer Algebra},
        Kluwer Academic Publishers, Boston, 1992. 

\bibitem[Gianni 1986]{Gianni86} P.\ Gianni, 
        {\em Using Gr\"obner to reduce solving equations to root finding}, 
        Meeting on Computer and Commutative Algebra, 
        Genova, May 1986. 

\bibitem[Gianni 1987]{Gianni87} P.\ Gianni, 
        {\em Properties of Gr\"obner bases under specialization}, 
        Proc. EUROCAL'87, European Conference on Computer Algebra,
        Leipzig, GDR, 1987, Springer LNCS 378, pp 293--297, 1989. 

\bibitem[Gianni {\em et al.} 1986]{GTZ86} 
        P.\ Gianni, B.\ Trager, G.\ Zacharias,
        {\em Gr\"obner Bases and Primary Decomposition of 
        Polynomial Ideals}, 
        J.\ Symbolic Computation, {\bf 6}, No 2/3, pp 149--167, 1988.

\bibitem[Giovini {\em et al.} 1991]{Sugar91} 
        A.\ Giovini, T.\ Mora, G.\ Niesi, L.\ Robbiano, C.\ Traverso,
        {\em ``One sugar cube, please'' 
        or Selection strategies in the Buchberger algorithm}, 
        J. of the ACM, pp 49--54, 1991.

\bibitem[Giusti 1984]{Giusti84} M.\ Giusti,
        {\em Some Effectivity Problems in Polynomial Ideal Theory},
        EUROSAM'84, Springer LNCS, Vol. 174, pp 159--171, 1984.

\bibitem[Goldberg 1981]{Goldb81} A.\ Goldberg,
        {\em Introducing the Smalltalk--80 System},
        Byte 6, 8 pp 14--35, August 1981.

\bibitem[G\"obel 1992]{Goebel92} M.\ G\"obel,
        {\em Reduktion G-symmetrischer Polynome f\"ur beliebige 
        Permutationsgruppe G},
        Diplomarbeit, Fakult\"at f\"ur Mathematik und Informatik,
        Universit\"at Passau, 1992.

\bibitem[G\"obel 1993]{Goebel93} M.\ G\"obel,
        {\em Using Buchberger's Algorithm in Invariant Theory}, \\
        ACM SIGSAM Bulletin 27/4, pp 3--9, 1993.

\bibitem[G\"obel 1995]{Goebel95} M.\ G\"obel,
        {\em Computing Bases for Permutation-Invariant Polynomials},
        Journal of Symbolic Computation 19, pp 285-291, 1995.

\bibitem[Gr\"abe, Lassner]{GL94} H.-G.~Gr\"abe, W.~Lassner, 
        {\em A Parallel Gr\"obner Factorizer}, 
        Universit\"at Leipzig, Preprint, 1994. 

\bibitem[Gr\"obner 1968/70]{G12} W.\ Gr\"obner, 
        {\em Algebraische Geometrie I, II},
        Bibliographisches Institut, Mannheim, 1968, 1970.

\bibitem[Gro{\ss}e-Gehling 1995]{GG95} R.\ Gro{\ss}e-Gehling,
        {\em Konstruktion involutiver Basen im \\ Computeralgebra-System MAS},
        Diplomarbeit, Fakult\"at f\"ur Mathematik und Informatik,
        Universit\"at Passau, 1995.

\bibitem[Hearn 1987]{Hearn87} A.C.\ Hearn,
        {\em REDUCE 3.3},
        The Rand Corporation, 1987.

\bibitem[Hermann 1926]{Hermann26} G.\ Hermann, 
        {\em Die Frage der endlich vielen Schritte in der Theorie 
        der Polynomideale}, 
        Math. Ann. Bd. 95, pp 736--788, 1926.

\bibitem[Jenks {\em et al.} 1984]{Jenks84} R.D.\ Jenks {\em et al.},
        {\em SCRATCHPAD II, An Experimental Computer Algebra System,
        Abbreviated Primer and Examples},
        Mathematical Sciences Department, IBM, Yorktown Heights, 1984.

\bibitem[Jenks {\em et al.} 1985]{Jenks85} R.D.\ Jenks {\em et al.},
        {\em Scratchpad II Programming Language Manual},
        Computer Algebra Group, IBM, Yorktown Heights, NY, 1985.

\bibitem[Kalkbrenner 1987]{Kalkb87} M.\ Kalkbrenner,
        {\em Solving systems of algebraic equations by using 
        Gr\"obner bases}, 
        Proc. EUROCAL'87, European Conference on Computer Algebra, 
        Leipzig, GDR, 1987, Springer LNCS 378, pp 282--292, 1989. 

\bibitem[Kandri-Rody 1984]{KaR84} A.\ Kandri-Rody, 
        {\em Effective Methods in the Theory of Polynomialideals},
        Ph.D.Thesis, RPI, Troy, NY, May 1984.

\bibitem[Kandri-Rody 1985]{KaR85} A.\ Kandri-Rody, 
        {\em Dimension of ideals in polynomial rings}, \\ 
        Proc. Combinatorial Algorithms in algebraic structures,
        Otzenhausen 1985, J.Avenhaus, K.Madlener Eds.,
        Fachbereich Informatik, University of Kaiserslautern, 1985.

\bibitem[Kandri-Rody, Weispfenning 1988]{KW88} 
        A.\ Kandri-Rody, V.\ Weispfenning, \\ 
        {\em Non-commutative Gr\"obner bases in algebras of 
        solvable type}, 
        J.\ Symb. Comp., {\bf 9}, pp 1--26, 1990. 
        also available as: 
        Technical Report University of Passau, MIP-8807, March 1988. 

\bibitem[Knuth 1981]{Knuth81} D.E.\ Knuth, 
        {\em The Art of Computer Programming}, 
        Vol. 2, {\em Seminumerical Algorithms (second edition)}, 
        Addison-Wesley, 1981.  

\bibitem[Kraft 1984]{Kraft84} H.-P.\ Kraft,  
        {\em Geometrische Methoden in der Invariantentheorie}, 
        Aspects of Mathematics,  
        Vieweg, Braunschweig/Wiesbaden, 1984.

\bibitem[Kredel 1985]{Kre85} H.\ Kredel,
        {\em \"Uber die Bestimmung der Dimension von Polynomidealen},
        Diplomarbeit, Fakult\"at f\"ur Mathematik 
        Universit\"at Heidelberg, 1985. 

\bibitem[Kredel 1987]{Kre87} H.\ Kredel,
        {\em Primary Ideal Decomposition},
        Proc. EUROCAL'87, European Conference on Computer Algebra, 
        Leipzig, GDR, 1987, Lecture Notes Computer Science {\bf 378},
        pp 270--281, 1989.

\bibitem[Kredel 1988]{Kre88} H.\ Kredel,
        {\em From SAC-2 to Modula-2},
        Proc. ISSAC'88 Rome, Lecture Notes Computer Science {\bf 358},
        pp 447--455, 1989.

\bibitem[Kredel 1989]{Kre89} H.\ Kredel,
        {\em Real Roots of Zero-dimensional Ideals},
        Manuscript, Universit\"at Passau, 1989. 

\bibitem[Kredel 1990]{Kre90} H.\ Kredel,
        {\em MAS Modula-2 Algebra System},
        Proc. DISCO 90 Capri, 
        Springer LNCS {\bf 429}, pp 270--271, 1990.

\bibitem[Kredel 1990a]{Kre90a} H.\ Kredel, 
        {\em Computing in polynomial rings of solvable type},
        Proc. IV. Int. Conv. Computer Algebra in Physical Research 1990,
        JINR, Dubna, Moscow UdSSR, May 1990, 
        World Scientific, Singapore, pp 211--221, 1991. 

\bibitem[Kredel 1991]{Kre91} H.\ Kredel,
        {\em The MAS Specification Component},
        Proc. PLILP `91, Passau, 1991, LNCS {\bf 528}, pp 39--50, 1991. 

\bibitem[Kredel 1992]{Kre92} H.\ Kredel,
        {\em Solvable Polynomial Rings},
        Dissertation Universit\"at Passau, 1992, 
        Verlag Shaker, Aachen 1993.  

\bibitem[Kredel, Weispfenning 1988]{KreW88} H.\ Kredel, V.\ Weispfenning,
        {\em Computing Dimension and Independent Sets for 
        Polynomial Ideals}, 
        J.\ Symbolic Computation (1988), {\bf 6}, pp 231--247, 1988. 
        See also MIP-8809, Universit\"at Passau, April 1988. 

\bibitem[Kronecker 1882]{Kronecker1882} L.\ Kronecker,
        {\em Grundz\"uge einer arithmetischen Theorie der 
        algebraischen Gr\"o\ss en}, 
        J. reine angew. Math. Bd. {\bf 92}, pp 1--122, 1882.

\bibitem[Kutzler, Stifter 1986]{KS86} B.\ Kutzler, S.\ Stifter, 
        {\em Automated geometry theorem proving using
        Buchberger's algorithm},
        CAMP--Publ.--Nr. 85--29.0, University of Linz 1986;
        Proc. SYMSAC '86, Waterloo, Canada, 1986.

\bibitem[Lasker 1905]{Lasker05}, E.\ Lasker, 
        {\em Zur Theorie der Moduln und Ideale},
        Math. Ann. Bd. 60, pp 20-116, 1905.

\bibitem[Lawrence 1987]{Law87} D.M.\ Lawrence,
        {\em micro EMACS 3.8 Editor}, 1987.

\bibitem[Lazard 1982]{Laz82} D.\ Lazard,
        {\em Commutative algebra and computer algebra}, 
        Springer Lect. Notes Comp. Sci. {\bf 144}, pp 40--48, 1982.

\bibitem[Lazard 1985]{Laz85} D.\ Lazard,
        {\em Ideal Bases and Primary Decomposition: 
        Case of Two Variables},
        J. Symbolic Computation {\bf 1}, pp 261--270, 1985.

\bibitem[Lippold 1993]{Lippold93} F.\ Lippold,
        {\em Implementierung eines Verfahrens zum Z\"ahlen 
        reeller Nullstellen multivariater Polynome},
        Diplomarbeit, Fakult\"at f\"ur Mathematik und Informatik,
        Universit\"at Passau, 1993.

\bibitem[Loos 1976]{Loos76} R.G.\ Loos,
        {\em The Algorithm Description Language ALDES (Report)},
        SIGSAM Bulletin {\bf 14}/1, pp 15--39, 1976.

\bibitem[Loos 1982]{Loos82} R.G.\ Loos,
        {\em Computing in Algebraic Extensions}, 
        in B.\ Buchberger, G.E.\ Collins, R.G.\ Loos, 
        {\em Computer algebra -- symbolic and algebraic computation}, 
        Vienna: Springer, pp 173--187, 1982.

\bibitem[Macaulay 1916]{Macaulay16} F.S.\ Macaulay, 
        {\em Algebraic theory of modular systems},
        Cambridge Tract. 1916.

\bibitem[Mark 1992]{Mark92} W.\ Mark,
        {\em Gr\"obner Basen \"uber Hauptidealringen und 
        euklidischen Ringen}, 
        Diplomarbeit, Universit\"at Passau, 1992.

\bibitem[Marti {\em et al.} 1978]{Marti78} 
        J.B.\ Marti, A.C.\ Hearn, M.L.\ Griss, C.\ Griss,
        {\em Standard Lisp Report},
        University of Utah, Salt Lake City, 1978.

\bibitem[Mateti 1988]{Mateti88} P.\ Mateti,
        {\em Gul\"am Shell}, 1987.

\bibitem[Melenk {\em et. al.} 1989]{MMN89} % SA 5185-1
        H.~Melenk, H.M.~M"oller, W.~Neun, 
        {\em Symbolic Solution of Large Stationary Chemical 
        Kinetics Problems}, 
        Impact of Computing in Science and Engineering 1, pp 138-167, 1989.

\bibitem[Morgan 1983]{Morgan83} A.P.\ Morgan,
        {\em A Method for Computing all Solutions to 
        Systems of Polynomial Equations}, 
        ACM/TOMS {\bf 9}, pp 1--17, 1985. 

\bibitem[M\"oller, Mora 1983]{MM83} H.M.\ M\"oller, F.\ Mora,
        {\em The computation of the Hilbert function},
        in Proc. EUROCAL '83, Computer algebra, 
        Springer LNCS {\bf 162}, 1983.

\bibitem[M\"oller, Mora 1986]{MM86} H.M.\ M\"oller, T.\ Mora,
        {\em New constructive methods in classical ideal theory}, 
        J. of Algebra, {\bf 100}, pp 138--178, 1986.

\bibitem[Mora 1985]{Mo85} T.\ Mora,
        {\em Gr\"obner bases for non-commutative polynomial rings}, \\
        Proc. AAECE-3, Grenoble 1985, LNCS 229, pp 353--362, 1985.

\bibitem[Mora 1986]{Mo86} T.\ Mora,
        {\em Standard bases and non-Noetherianity: 
        Non-commutative polynomial rings}, 
        Proc. AAECE-4, Karlsruhe 1986, LNCS 307, pp 98--109, 1986.

\bibitem[Mora, Robbiano 1988]{MoRo88} T.\ Mora, L.\ Robbinano, 
        {\em The Gr\"obner fan of an ideal}, 
        J. Symbolic Computation 6/2, pp 183--208, 1988.

\bibitem[Noether 1916]{Noether16} E.\ Noether, 
        {\em Der Endlichkeitssatz der Invarianten endlicher Gruppen}, 
        Mathe. Ann. 77, pp 89--92, 1916.

\bibitem[Noether 1921]{Noether21} E.\ Noether, 
        {\em Ideal Theorie in Ringbereichen},
        Math. Ann. Bd. 8, pp 24--66, 1921.

\bibitem[Patera {\em et al.} 1976]{Pat76} J.\ Patera, R.T.\ Sharp,
        P.\ Winternitz, H.\ Zassenhaus,
        {\em Invariants of real low dimnension Lie algebras},
        J. Math. Phys., vol. 17, no. 6, pp 986--993, 1976.

\bibitem[Pavelle, Wang 1985]{Pavelle85} R.\ Pavelle, P.R.\ Wang,
        {\em MACSYMA From F to G},
        J. Symbolic Computation 1, pp 69--100, 1985.

\bibitem[Pedersen, Roy, Szpirglas 1993]{PRS93}
        P.\ Pedersen, M.-F.\ Roy, A.\ Szpirglas,
        {\em Counting Real Zeros in the Multivariate Case},
        Proc.~MEGA'92, F. Eyssette, A. Galligo, Eds., 
        Birkh\"auser Boston, pp 203-224, 1993. 

\bibitem[Pfeil 1994]{Pfeil94} J.\ Pfeil,
        {\em Implementierung von Varianten des 
        Buchberger-Algorithmus mit Polynomfaktorisierung},
        Diplomarbeit, Fakult\"at f\"ur Mathematik und Informatik, 
        Universit\"at Passau, 1994.

\bibitem[Philipp 1991]{Phil91} J.\ Philipp,
        {\em Syzygien Berechnung im Computer Algebra System MAS}, 
        Diplomarbeit, Fakult\"at f\"ur Mathematik und Informatik, 
        Universit\"at Passau, 1991.

\bibitem[Pohst, Yun 1981]{PY81} M.E.\ Pohst, D.Y.Y.\ Yun, 
        {\em On solving systems of algebraic equations 
        via ideal bases and elimination theory},
        Proc. 1981 ACM Symposium on Symbolic and Algebraic Computations, 
        pp 206--211, 1981.

\bibitem[Rich {\em et al.} 1988]{Rich88} A.\ Rich, J.\ Rich, D.R.\ Stoutemyer,
        {\em DERIVE A Mathematical Assistant},
        The Soft Warehouse. Honolulu, Hawaii, 1988.

\bibitem[Rose 1995]{Rose95} C.\ Rose,
        {\em The MAS module DIPAGB:
        An Implementation of the Normal with Sugar Selection Strategy 
        in the Buchberger Algorithm},
        Fakult\"at f\"ur Mathematik und Informatik, 
        Universit\"at Passau, 1995.

\bibitem[Robbiano 1985]{Rob85} L.\ Robbiano,
        {\em Term orderings on the polynomial ring},
        Proc. EUROCAL '85, European Conference on Computer Algebra,
        Linz 1985, Springer Lect. Notes Comp. Sci. {\bf 204}, 
        pp 513--517, 1986.

\bibitem[Schemmel 1987]{Sche87} K.-P.\ Schemmel, 
        {\em An extension of Buchberger's algorithm to compute 
        all reduced Gr\"obner bases of a polynomial ideal}, 
        Proc. EUROCAL '87, Leipzig,     
        Springer LNCS Vol. 378, pp 300--310, 1987.

\bibitem[Sch\"onfeld 1991]{Schoe91} E.\ Sch\"onfeld, 
        {\em Parametrische Gr\"obnerbasen im 
        Computer Algebra System ALDES/SAC-2}, 
        Diplomarbeit, Fakult\"at f\"ur Mathematik und Informatik, 
        Universit\"at Passau, 1991.

\bibitem[Schrader 1976]{Sch76} R.\ Schrader,
        {\em Zur konstruktiven Idealtheorie}, 
        Diplomarbeit, Mathematisches Institut II,
        Universit\"at Karlsruhe, 1976.

\bibitem[Schwartz 1988]{Schw88} N.\ Schwartz,
        {\em Stability of Gr\"obner bases}, 
        J. pure and appl. Algebra, {\bf 53}, pp 171--186, 1988.

\bibitem[Seidenberg 1974]{Seid74} A.\ Seidenberg, 
        {\em Constructions in Algebra},
        Trans. Amer. Math. Soc. {\bf 197}, pp 273--313, 1974. 

\bibitem[Stoutemyer 1986]{Stout86} D.R.\ Stoutemyer,
        {\em $\mu$-MATH-86},
        The Soft Warehouse. Honolulu, Hawaii, 1986.

\bibitem[Stoyan, Goerz 1984]{Stoyan84} H.\ Stoyan, G.\ Goerz,
        {\em LISP},
        Springer Verlag, Heidelberg, 1984.

\bibitem[Sturmfels 1993]{Sturmfels93} B.\ Sturmfels,
        {\em Algorithms in Invariant Theory},
        Vienna: Springer, 1993. 

\bibitem[TDI 86]{TDI 86} TDI,
        {\em Modula-2/ST Compiler},
        Clifton, Bristol, UK, 1986.

\bibitem[Trinks 1978]{Trinks78} W.\ Trinks,
        {\em \"Uber Buchbergers Verfahren Systeme algebraischer
        Gleichungen zu l\"osen},
        J. Number Theory, Vol. 10, pp 475--488, 1978.

\bibitem[Weinberger {\em et al.} 1976]{Weinb76} 
        J.P.\ Weinberger, L.P.\ Rothschild,
        {\em Factoring Polynomials Over Algebraic Number Fields},
        ACM/TOMS {\bf 2}, No. 4, pp 335--350, 1976. 

\bibitem[Weispfenning 1975]{Wei75} V.\ Weispfenning,
        {\em Model-completeness and elimination of quantifiers 
        for subdirect products of structures}, 
        J. of Algebra, 36, pp 252--277, 1975.

\bibitem[Weispfenning 1987]{Wei87} V.\ Weispfenning,
        {\em Admisible orders and linear forms}, 
        ACM SIGSAM Bulletin, Vol. 21, No. 2, pp 16--18, May 1987.

\bibitem[Weispfenning 1986]{Wei88} V.\ Weispfenning, 
        {\em Some bounds for the construction of Gr\"obner Bases},
        Proc. AAECC--4, Karlsruhe 1986, 
        Springer LNCS Vol. 307, pp 195--201, 1988.

\bibitem[Weispfenning 1987a]{Wei87a} V.\ Weispfenning, 
        {\em Constructing universal Gr\"obner Bases},
        Proc. AAECC--5, 
        Springer LNCS Vol. 356, pp 408--417, 1987.

\bibitem[Weispfenning 1987b]{Wei87b} V.\ Weispfenning, 
        {\em Gr\"obner bases in polynomial rings over 
        commutative regular rings}, 
        Proc. EUROCAL '87, Leipzig,     
        Springer LNCS Vol. 378, pp 336--347, 1987.

\bibitem[Weispfenning 1990]{Wei90} V.\ Weispfenning,
        {\em Comprehensive Gr\"obner bases},
        preprint in:
        Technical Report University of Passau, MIP-9003, 1990.

\bibitem[Weispfenning 1993]{Wei93} V.\ Weispfenning,
        {\em A New Approach to Quantifier Elimination for Real Algebra},
        Proceedings of the Collins Symposium "QEPCAD"; 
        Linz, Austria Oct. 1993 (to be appear).
        preprint in:
        Technical Report University of Passau, MIP-9305, 1993.

\bibitem[Winkler {\em et al.} 1985]{Winkler85} F.\ Winkler, B.\ Buchberger,
        F.\ Lichtenberg, H.\ Rolletschek,
        {\em An algorithm for constructing canonical bases
        (Gr\"obner bases) of polynomial ideals},
        ACM/TOMS {\bf 11}, pp 66--78, 1985.

\bibitem[Wirsing 1986]{Wirsing86} M.\ Wirsing,
        {\em Structured Algebraic Specifications: A Kernel Language},
        Theoretical Computer Science {\bf 42}, pp 123--249,
        Elsevier Science Publishers B.V. (North--Holland) (1986).

\bibitem[Wirth 1985a]{Wirth85a} N.\ Wirth,
        {\em Programming in Modula-2},
        Springer, Berlin, Heidelberg, New York, 1985.

\bibitem[Wirth 1985b]{Wirth85b} N.\ Wirth,
        {\em Compilerbau},
        Teubner Verlag, Stuttgart, 1985.

\bibitem[Wirth 1988]{Wirth88} N.\ Wirth,
        {\em From Modula to Oberon}, pp 661--670,
        {\em The Programming Language Oberon}, pp 670--690,
        Software-Practice and Experience Vol. 18(7), July 1988.

\bibitem[Wirth 1989]{Wirth89} N.\ Wirth, J.\ Gutknecht,
        {\em The Oberon System}, \mbox{  } pp 857--893,
        Software-Practice and Experience Vol. 19(9), September 1989.

\bibitem[Wolfram 1988]{Wolfram88} Wolfram Research Inc.,
        {\em Mathematica},
        Addison-Wesley, Reading, 1988.

\bibitem[Zacharias 1978]{Zac78} G.\ Zacharias, 
        {\em Generalized Gr\"obner bases in commutative polynomial rings},
        Bachelor thesis, MIT, Dep. of Comp. Sci., 1978.

\bibitem[Zharkov, Blinkov 1993]{zhbl93} A.~Yu.~Zharkov, Yu.~A.~Blinkov,
        {\em Involution Approach to Solving Systems of Algebraic Equations},
        Proceedings of the IMACS'93, pp 11--16, 1993.

\bibitem[Zharkov, Blinkov 1993a]{zhbl93a} A.~Yu.~Zharkov, Yu.~A.~Blinkov,
        {\em Involutive Bases of zero-dimensional Ideals}, 
        submitted to: Journal Symbolic Computation.

\bibitem[Zharkov, Blinkov 1993b]{zhbl93b} A.~Yu.~Zharkov, Yu.~A.~Blinkov,
        {\em INVBASE: A Package for Computing Involutive Bases}, 
        contained in the Reduce INVBASE-Package, 
        available from Konrad-Zuse-Zentrum Berlin.

\bibitem[Zharkov 1994]{zhbl94} A.~Yu.~Zharkov, 
        {\em Solving Zero-Dimensional Involutive Systems}, 
        to appear in Proc. MEGA '94.

\end{thebibliography}




