The Language and its Functionality

  • B. Fuchssteiner
  • K. Drescher
  • A. Kemper
  • O. Kluge
  • K. Morisse
  • H. Naundorf
  • G. Oevel
  • F. Postel
  • T. Schulze
  • G. Siek
  • A. Sorgatz
  • W. Wiwianka
  • P. Zimmermann

Abstract

To perform the numerous tasks of a computer algebra system, a multitude of simple and complex data types, operators and statements are necessary. Important elementary data types are the various numerical data types like floating point numbers, complex numbers, rational numbers and integers of any length as well as identifiers and character strings. Additionally indexed identifiers are necessary to enable access to tables, arrays, lists and expression sequences. To control, for instance, the execution of statements, it must be possible to evaluate expressions to boolean values. In this context, the boolean constants TRUE and FALSE are important. Further available constants are E, EULER and PI. More complex data types allow objects to be combined to form a new object. These data types include lists, sets, tables and arrays and domains.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Fachmedien Wiesbaden 1996

Authors and Affiliations

  • B. Fuchssteiner
  • K. Drescher
  • A. Kemper
  • O. Kluge
  • K. Morisse
  • H. Naundorf
  • G. Oevel
  • F. Postel
  • T. Schulze
  • G. Siek
  • A. Sorgatz
  • W. Wiwianka
  • P. Zimmermann

There are no affiliations available

Personalised recommendations