
CLN uses object oriented techniques and operator overloading to achieve a natural algebraic syntax: The sum x of two variables a and b is written as x=a + b, as opposed to the function sum(&x, a, b). CLN uses class inheritance to model the natural subsets of the available number types: E.g. the integer class is a subtype of the rational class, just as the integer numbers are a subset of the rational numbers. The complex numbers and all its subtypes behave exactly like the types of numbers known to the Common Lisp language, giving CLN another meaning: it becomes an abbreviation of Common Lisp Numbers. Due to this, CLN can be and is used for implementations of Common Lisp, other interpreted languages, or computer algebra systems. The implementation is efficient. It can be configured to use the GNU MultiPrecision Library as kernel for speedcritical inner loops and implements advanced algorithms like SchÃ¶nhage – Strassen multiplication, binary splitting and others. All CLN objects are either immediate or reference counted, providing for noninterruptive garbage collection with no burden on the main application. 