Singular Tutorial
 -----------------
 V. Levandovskyy


 Our aim is to show the flexibility and the performance of the
 specialized computer algebra system Singular (www.singular.uni-kl.de).
 The system is developed for polynomial computations with special
 emphasis on the needs of commutative algebra, algebraic geometry,
 and singularity theory. Indeed, Singular has one of the fastest
 implementations of Groebner bases and related algorithms. In this
 tutorial we introduce the principles of Singular, explain the data
 types such as ring, number, poly, ideal, module, matrix etc.
 Moreover, we demonstrate the intuitive C-like programming language
 of Singular; the attendees will easily write their first programs
 in Singular and compute interesting nontrivial examples in a very
 short time.