Currently, the Yacas programming language is stable and seems powerful enough for all computer algebra applications. External libraries providing additional functionality may be dynamically loaded into Yacas via the "plugin" mechanism.
The base Yacas application accepts text as input and returns text as output. This makes it rather platform-independent. Apart from Unix-like systems, Yacas has been compiled on Windows and on EPOC32, aka Psion (which doesn't come with a standard C++ library!). The source code to compile Yacas for Windows can be found at the Sourceforge repository .
For Unix, compilation basically amounts to the standard sequence
./configure make make install |
The arbitrary precision math in Yacas will be generally faster if you compile Yacas with the libgmp library (the option --with-numlib=gmp for the configure script). Precompiled Red Hat (RPM) and Debian (DEB) packages are also available.
Additionally, LaTeX-formatted documentation in PostScript and PDF formats can be produced by the command
make texdocs |
or, alternatively, by passing --enable-ps-doc or --enable-pdf-doc to ./configure when building Yacas. In the latter case, the documentation will be automatically rebuilt every time the documentation changes (which is useful when maintaining the documentation).
In> |
Out> |
A Yacas session may be terminated by typing Exit() or quit. Pressing ^C will also quit Yacas; however, pressing ^C while Yacas is busy with a calculation will stop just that calculation. A session can be restarted (forgetting all previous definitions and results) by typing
restart |
Typically, you would enter one statement per line, for example
In> Sin(Pi/2); Out> 1; |
Statements should end with a semicolon (;) although this is not required in interactive sessions (Yacas will append a semicolon at end of line to finish the statement).
All documentation is accessible from the Yacas prompt. If you type
In> ?? |
In> ?Sum |
Type Example(); to get some random examples of Yacas calculations.
The command line has a history list, so it should be easy to browse through the expressions you entered previously using the Up and Down arrow keys.
When a few characters have been typed, the command line will use the characters before the cursor as a filter into the history, and allow you to browse through all the commands in the history that start with these characters quickly, instead of browsing through the entire history.
Typing the first few characters of a previous expression and then hitting the TAB key makes Yacas recall the last expression in the history list that matches these first characters.
Commands spanning multiple lines can (and actually have to) be entered by using a trailing backslash \ at end of each continued line. For example:
In> a:=2+3+ Error on line 1 in file [CommandLine] Line error occurred on: >>> Error parsing expression |
In> a:=2+3+ \ In> 1 Out> 6; |
Incidentally, any text Yacas prints without a prompt is either messages printed by functions as their side-effect, or error messages. Resulting values of expressions are always printed after an Out> prompt.
In> 1/14+5/21*(30-(1+1/2)*5^2); Out> -12/7; |
The standard scripts already contain a simple math library for symbolic simplification of basic algebraic functions. Any names such as x are treated as independent, symbolic variables and are not evaluated by default.
In> 0+x; Out> x; In> x+1*y; Out> x+y; In> Sin(ArcSin(alpha))+Tan(ArcTan(beta)); Out> alpha+beta; In> (x+y)^3-(x-y)^3 Out> (x+y)^3-(x-y)^3; In> Simplify(%) Out> 6*x^2*y+2*y^3; |
The special operator % automatically recalls the result from the previous line. The function Simplify attempts to reduce an expression to a simpler form. Note that standard function names in Yacas are typically capitalized. Multiple capitalization such as ArcSin is sometimes used. The underscore character _ is a reserved operator symbol and cannot be part of variable or function names.
Yacas can deal with arbitrary precision numbers:
In> 20!; Out> 2432902008176640000; |
When dealing with floating point numbers, the command Precision(n); can be used to specify that all floating point numbers should have a fixed precision of n digits:
In> Precision(30); Out> True; In> N(1/243); Out> 0.004115226337448559670781893004; |
The N function has an optional second argument, the required precision:
In> N(1/234,10) Out> 0.0042735042; In> N(1/234,20) Out> 0.0042735042735042735; In> N(1/234,30) Out> 0.004273504273504273504273504273; |
Analytic derivatives of functions can be evaluated:
In> D(x) Sin(x); Out> Cos(x); In> D(x) D(x) Sin(x); Out> -Sin(x); |
The D function also accepts an argument specifying how often the derivative has to be taken. In that case, the above expressions can also be written as:
In> D(x,1)Sin(x) Out> Cos(x); In> D(x,2)Sin(x) Out> -Sin(x); |
Rational numbers will stay rational as long as the numerator and denominator are integers, so 55/10 will evaluate to 11/2. You can override this behavior by using the numerical evaluation function N(). For example, N(55/10) will evaluate to 5.5 . This behavior holds for most math functions. Yacas will try to maintain an exact answer (in terms of integers or fractions) instead of using floating point numbers, unless N() is used. Where the value for the constant pi is needed, use the built-in variable Pi. It will be replaced by the (approximate) numerical value when N(Pi) is called. Yacas knows some simplification rules using Pi (especially with trigonometric functions). The imaginary unit i is denoted I and complex numbers can be entered as either expressions involving I or explicitly Complex(a,b) for a+ib.
Some simple equation solving algorithms are in place:
In> Solve(x/(1+x) == a, x); Out> {x==a/(1-a)}; In> Solve(x^2+x == 0, x); Out> {x==0,x==(-1)}; |
(Note the use of the == operator, which does not evaluate to anything, to denote an "equation" object.) Currently Solve is rather limited, but in the future there will be more sophisticated algorithms.
Taylor series are supported, for example:
In> Taylor(x,0,3) Exp(x) Out> 1+x+(1/2)*x^2+(1/6)*x^3; |
In> PrettyForm(%); / 1 \ 2 / 1 \ 3 1 + x + | - | * x + | - | * x \ 2 / \ 6 / Out> True; |
The function PrettyForm() tries to render the formula in a better format for reading, using ASCII text. You can also export an expression to TeX by typing TeXForm(...).
In> Set(a,Cos(0)); Out> True; In> a:=a+1; Out> 2; |
Currently there is no difference between assigning variables using Set() or using the operator :=. The latter can however also assign lists and define functions.
f(x):=2*x*x |
One and the same function name such as f may be used by different functions if they take different numbers of arguments (but not if they merely take different types of arguments, since Yacas does not have a strict type system):
In> f(x):=x^2; Out> True; In> f(x,y):=x*y; Out> True; In> f(3)+f(3,2); Out> 15; |
Yacas predefines True and False as boolean values. Functions returning boolean values are called predicates. For example, IsNumber() and IsInteger() are predicates defined in the standard library:
In> IsNumber(2+x); Out> False; In> IsInteger(15/5); Out> True; |
When assigning variables, the right hand side is evaluated before it is assigned. Thus
a:=2*2 |
f(x):=Eval(x+x) |
"this is a string with \"quotes\" in it" |
Lists are ordered groups of items, as usual. Yacas represents lists by putting the objects between braces and separating them with commas. The list consisting of objects a, b, and c could be entered by typing {a,b,c}. In Yacas, vectors are represented as lists and matrices as lists of lists. In fact, any Yacas expression can be converted to a list (see below).
Items in a list can be accessed through the [ ] operator. Examples: when you enter
uu:={a,b,c,d,e,f}; |
uu[2]; |
uu[2 .. 4]; |
2 .. 4 |
Another use of lists is the associative list, sometimes called a hash table, which is implemented in Yacas simply as a list of key-value pairs. Keys must be strings and values may be any objects. Associative lists can also work as mini-databases. As an example, first enter
u:={}; |
u["name"]:="Isaia"; u["occupation"]:="prophet"; u["is alive"]:=False; |
Now, u["name"] would return "Isaia". The list u now contains three sublists, as we can see:
In> u; Out> { {"is alive", False}, {"occupation", "prophet"}, {"name", "Isaia"} }; |
Lists evaluate their arguments, and return a list with results of evaluating each element. So, typing {1+2,3}; would evaluate to {3,3}.
Assignment of multiple variables is also possible using lists. For instance, {x,y}:={2!,3!} will result in 2 being assigned to x and 6 to y.
The idea of using lists to represent expressions dates back to the language LISP developed in the 1970's. From a small set of operations on lists, very powerful symbolic manipulation algorithms can be built. Lists can also be used as function arguments when a variable number of arguments are expected.
Let's try some list operations now:
In> m:={a,b,c}; Out> True; |
In> Length(m); Out> 3; |
In> Reverse(m); Out> {c,b,a}; |
In> Concat(m,m); Out> {a,b,c,a,b,c}; |
In> m[1]:="blah blah"; Out> True; In> m; Out> {"blah blah",b,c}; |
In> Nth(m,2); Out> b; |
Many more list operations are described in the reference manual.
Vector components can be assigned values just like list items, since they are in fact list items:
In> l:=ZeroVector(3); Out> True; In> l; Out> {0,0,0}; In> l[ 2 ]:=2; Out> True; In> l; Out> {0,2,0}; |
Yacas can perform multiplication of matrices, vectors and numbers as usual in linear algebra:
In> v:={1,0,0,0} Out> {1,0,0,0}; In> E4:={ {0,u1,0,0},{d0,0,u2,0}, {0,d1,0,0},{0,0,d2,0}} Out> {{0,u1,0,0},{d0,0,u2,0}, {0,d1,0,0},{0,0,d2,0}}; In> CharacteristicEquation(E4,x) Out> x^4-x*u2*d1*x-u1*d0*x^2; In> Expand(%,x) Out> x^4-(u2*d1+u1*d0)*x^2; In> v+E4*v+E4*E4*v+E4*E4*E4*v Out> {1+u1*d0,d0+(d0*u1+u2*d1)*d0, d1*d0,d2*d1*d0}; |
The standard Yacas script library also includes taking the determinant and inverse of a matrix, finding eigenvectors and eigenvalues (in simple cases) and solving linear sets of equations, such as A*x=b where A is a matrix, and x and b are vectors. There are several more matrix operations supported. See the reference manual for more details.
Conditional execution is implemented by the If(predicate, body1, body2) function call, which works like the C language construct (predicate) ? body1 : body2. If the condition is true, "body1" is evaluated, otherwise "body2" is evaluated, and the corresponding value is returned. For example, the absolute value of a number can be computed with:
absx := If( x>=0, x, -x ); |
If several operations need to be executed in sequence to obtain a result, you can use a Prog() function call or equivalently the [ ] construct.
To illustrate these features, let us create a list of all even integers from 2 to 20 and compute the product of all those integers except those divisible by 3. (What follows is not necessarily the most economical way to do it in Yacas.)
In> L := {}; Out> {}; In> i := 2; Out> 2; In> While(i<=20) [ L:= Append(L, i); \ i := i+2; ] Out> True; In> L; Out> {2,4,6,8,10,12,14,16,18,20}; In> answer := 1; Out> 1; In> ForEach(i, L) If (Mod(i, 3)!=0, \ answer := answer * i); Out> True; In> answer; Out> 2867200; |
We used a shorter form of If(predicate, body) with only one body which is executed when the condition holds. If the condition does not hold, this function call returns False.
The above example is not the shortest possible way to write out the algorithm. A more 'functional' approach would go like this:
First construct a list with all even numbers from 2 to 20. For this we use the .. operator to set up all numbers from one to ten, and then multiply that with two.
In> 2*(1 .. 10) Out> {2,4,6,8,10,12,14,16,18,20}; |
Now we want an expression that returns all the even numbers up to 20 which are not divisible by 3. For this we can use Select, which takes as first argument a predicate that should return True if the list item is to be accepted, and false otherwise, and as second argument the list in question:
In> Select({{n},Mod(n,3)!=0},2*(1 .. 10)) Out> {2,4,8,10,14,16,20}; |
The numbers 6, 12 and 18 have been correctly filtered out.
All that remains is to factor the items in this list. For this we can use Factorize, which accepts a list as argument and returns the product of all the items in that list:
In> Factorize(Select({{n},Mod(n,3)!=0},2*(1 .. 10))) Out> 2867200; |
A more flexible function one can use is UnFlatten:
In> UnFlatten({a,b,c},"*",1) Out> a*b*c; In> UnFlatten({a,b,c},"+",0) Out> a+b+c; |
Using UnFlatten, the result becomes:
In> UnFlatten(Select({{n},Mod(n,3)!=0},2*(1 .. 10)),"*",1) Out> 2867200; |
Additional example calculations including the results can be found here:
100!; |
ToBase(16,255); FromBase(16,"2FF"); |
Expand((1+x)^5); |
Apply("+",{2,3}); |
Apply({{x,y},x+y},{2,3}); |
D(x)D(x) Sin(x); |
Solve(a+x*y==z,x); |
Taylor(x,0,5) Sin(x); |
Limit(x,0) Sin(x)/x; |
Newton(Sin(x),x,3,0.0001); |
DiagonalMatrix({a,b,c}); |
Integrate(x,a,b) x*Sin(x); |
Factors(x^2-1); |
Apart(1/(x^2-1),x); |
The function g(q,phi,chi) is defined by
To solve this problem, we prepare a separate file with the following Yacas code:
/* Auxiliary function */ g1(n, q, phi, chi) := [ Local(s); s := q^2-n^2; N(Cos(n*chi) * If(s=0, 1/2, /* Special case of s=0: avoid division by 0 */ Sin(Sqrt(s)*phi)/Sin(2*Sqrt(s)*phi) /* now s != 0 */ /* note that Sqrt(s) may be imaginary here */ ) ); ]; /* Main function */ g(q, phi, chi) := [ Local(M, n); M := 16; /* Exp(-M) will be the precision */ /* Use N() to force numerical evaluation */ N(1/2*Sin(q*phi)/Sin(2*q*phi)) + /* Estimate the necessary number of terms in the series */ Sum(n, 1, N(1+Sqrt(q^2+M^2/phi^2)), g1(n, q, phi, chi)) ; ]; /* Parameters */ q:=3.5; phi:=2; /* Make a function for plotting: it must have only one argument */ f(x) := g(q, phi, x); /* Plot from 0 to 2*Pi with 80 points */ Plot2D(f(x), 0: 2*Pi); |
Name this file "fun1" and execute this script by typing
Load("fun1"); |
The default operation of Yacas is to run in the interactive console mode. Yacas accepts several options that modify its operation. Here is a summary of options:
Options can be combined, for example
yacas -pc filename |
Here is a more detailed description of the command-line options.
yacas -c |
yacas -f |
yacas -p |
yacas -t |
yacas [options] {filename} |
yacas -v |
yacas -d |
yacas --patchload |
yacas --init [file] |
yacas --read-eval-print [expression] |
There is also a fallback read-eval-print loop in the kernel; it can be invoked by passing an empty string to this command line option, as --read-eval-print "".
An alternative way to replace the default read-eval-print loop is to write a custom initialization script that implements the read-eval-print loop function REP() instead of yacasinit.ys.
Care has to be taken with this option because a Yacas session may become unusable if the read-eval-print expression doesn't function correctly.
yacas --server <port> |
Commands can be sent to the server by sending a text line as one block of data, and the server will respond back with another text block.
One can test this function by using telnet. First, set up the server by calling
yacas --server 9734 |
telnet 127.0.0.1 9734 |
Some security measures and resource management measures have been taken. No more than 10 connections can be alive at any time, a calculation cannot take more than 30 seconds, and Yacas operates in the secure mode, much like calling an expression by passing it as an argument to the Secure function. This means that no system calls are allowed, and no writing to local files, amongst other things. Something that has not been taken care of yet is memory use. A calculation could take up all memory, but not for longer than 30 seconds.
The server is single-threaded, but has persistent sessions for at most 10 users at a time, from which it can service requests in a sequenial order. To make the service multi-threaded, a solution might be to have a proxy in front of the service listening to the port, redirecting it to different processes which get started up for users (this has not been tried yet).
yacas --rootdir [directory] |
yacas --dlldir [directory] |
yacas --archive [file] |
Yacas has an experimental system where files can be compressed into one file, and accessed through this command line option. The advantages are:
An additional savings is due to the fact that the script files are stripped from white spaces and comments, making them smaller and faster loading.
To prepare the compressed library archive, run ./configure with the command line option --enable-archive.
The result should be the archive file scripts.dat. Then launch Yacas with the command line option --archive scripts.dat, with the file scripts.dat in the current directory.
The reason that the scripts.dat file is not built automatically is that it is not tested, at this time, that the build process works on all platforms. (Right now it works on Unix, MacOSX, and Win32.)
Alternatively, configure Yacas with
./configure --enable-archive |
When an archive is present, Yacas will try to load it before it looks for scripts from the library directories. Typing
make archivetest -f makefile.compressor |
The currently supported compression schemes are uncompressed and compressed with minilzo. Script file stripping (removing whitespace and comments) may be disabled by editing compressor.cpp (variable strip_script).
yacas --disable-compiled-plugins |
Disable loading of compiled scripts, in favor of scripts themselves. This is useful when developing the scripts that need to be compiled in the end, or when the scripts have not been compiled yet.
yacas --stacksize <size> |
For a function that would take 4 arguments and has one return value, there would be 5 places reserved on this stack, and the function could call itself recursively 10000 steps deep.
This differs from the MaxEvalDepth mechanism. The MaxEvalDepth mechanism allows one to specify the number of separate stack frames (number of calls, nested), instead of the number of arguments pushed on the stack. MaxEvalDepth was introduced to protect the normal C++ stack.
yacas --execute <expression> |
user% ./yacas -pc --execute '[Echo("answer ",D(x)Sin(x));Exit();]' answer Cos(x) user% |
The script yacas_client reads Yacas commands from the standard input and passes them to the running "Yacas server"; it then waits 2 seconds and prints whatever output Yacas produced up to this time. Usage may look like this:
8:20pm Unix>echo "x:=3" | yacas_client Starting server. [editvi] [gnuplot] True; To exit Yacas, enter Exit(); or quit or Ctrl-c. Type ?? for help. Or type ?function for help on a function. Type 'restart' to restart Yacas. To see example commands, keep typing Example(); In> x:=3 Out> 3; In> 8:21pm Unix>echo "x:=3+x" | yacas_client In> x:=3+x Out> 6; In> 8:23pm Unix>yacas_client -stop In> quit Quitting... Server stopped. 8:23pm Unix> |
Persistence of the session means that Yacas remembered the value of x between invocations of yacas_client. If there is not enough time for Yacas to produce output within 2 seconds, the output will be displayed the next time you call yacas_client.
The "Yacas server" is started automatically when first used and can be stopped either by quitting Yacas or by an explicit option yacas_client -stop, in which case yacas_client does not read standard input.
The script yacas_client reads standard input and writes to standard output, so it can be used via remote shell execution. For example, if an account "user" on a remote computer "remote.host" is accessible through ssh, then yacas_client can be used remotely, like this:
echo "x:=2;" | \ ssh user@remote.host yacas_client |
On a given host computer running the "Yacas server", each user currently may have only one persistent Yacas session.
A variable can be declared local to a compound statement block by the function Local(var1, var2,...).
Sin({a,b,c}); |
In> Listify(a+b*(c+d)); Out> {+,a,b*(c+d)}; In> UnList({Atom("+"),x,1}); Out> x+1; |
Pure functions are the equivalent of "lambda expressions" of LISP; in other words, they are Yacas expressions representing bodies of functions. They are currently implemented using lists and the operator Apply(). The following line:
Apply( {{x,y},x+y} , {2,3} ); |
However, regardless of presentation, internally all functions and operators are equal and merely take a certain number of arguments. The user may define or redefine any operators with either "normal" names such as "A" or names made of one or more of the special symbols + - * / = ` ~ : ! @ # $ ^ & * _ | < > and declare them to be infix, postfix, or prefix operators, as well as normal or bodied functions. (The symbol % is reserved for the result of the previous expression; the decimal point . is special and cannot be part of an operator's name unless the whole name consists entirely of points, e.g. the ".." operator.) Some of these operators and combinations are already defined in Yacas's script library, for instance the "syntactic sugar" operators such as := or <--, but they can be in principle redefined or erased. These "special" operators are in no way special to the system, except for their syntax.
All infix, prefix, postfix operators and bodied functions are assigned a precedence (an integer number); infix operators in addition have a left and a right precedence. All this will only affect the syntax of input and could be arranged for the user's convenience. For example, the infix operator "*" has precedence smaller than that of the infix operator "+", and therefore an expression such as a+b*c is interpreted in the conventional way, i.e. a+(b*c).
An important caveat is to make sure you always type a space between any symbols that could make up an operator. For instance, after you define a new function "@@(x):=x^2;" expressions such as "a:=@@(b);" typed without spaces will cause an error unless you also define the operator ":=@@". This is because the parser will not stop at ":=" when trying to make sense of that expression. The correct way to deal with this is to insert a space: "a:= @@(b)". Similarly, a!+3 will cause an error unless you define "!+", so use a space: a! +3.
Let's now have a hands-on primer for these syntactic features. Suppose we wanted to define a function F(x,y)=x/y+y/x. We could use the standard syntax:
In> F(a,b) := a/b + b/a; Out> True; |
In> Infix("xx", OpPrecedence("/")); Out> True; In> a xx b := a/b + b/a; Out> True; In> 3 xx 2 + 1; Out> 19/6; |
We have chosen the name "xx" just to show that we don't need to use the special characters in the infix operator's name. However we must define this operator as infix before using it in expressions, or we'd get syntax errors.
Finally, we might decide to be completely flexible with this important function and also define it as a mathematical operator ##. First we define ## as a "bodied" function and then proceed as before:
In> Bodied("##", OpPrecedence("/")); Out> True; In> ##(a) b := a xx b; Out> True; In> ##(1) 3 + 2; Out> 16/3; |
We have used the name ## but we could have used any other name such as xx or F or even _-+@+-_. Apart from possibly confusing yourself, it doesn't matter what you call the functions you define.
There is currently one limitation in Yacas: once a function name is declared as infix (prefix, postfix) or bodied, it will always be interpreted that way. If we declare f to be "bodied", we may later define different functions named f with different numbers of arguments, however all of these functions must be "bodied".
One simple application of pattern-matching rules is to define new functions. (This is actually the only way Yacas can learn about new functions.) As an example, let's define a function f that will evaluate factorials of non-negative integers. We'll first define a predicate to check whether our argument is indeed a non-negative integer, and we'll use this predicate and the obvious recursion f(n)=n*f(n-1) to evaluate the factorial. All this is accomplished by the following three lines:
10 # f(0) <-- 1; 20 # f(n_IsIntegerGreaterThanZero) <-- n*f(n-1); IsIntegerGreaterThanZero(_n) <-- IsInteger(n) And n>0; |
We have first defined two "simplification rules" for a new function f(). Then we realized that we need to define a predicate IsIntegerGreaterThanZero(). A predicate equivalent to IsIntegerGreaterThanZero() is actually already defined in the standard library and it's called IsPositiveInteger, so it was not necessary, strictly speaking, to define our own predicate to do the same thing; we did it here just for illustration.
The first two lines recursively define a factorial function f(n)=n*(n-1)*...*1. The rules are given precedence values 10 and 20, so the first rule will be applied first. Incidentally, the factorial is also defined in the standard library as a postfix operator "!" and it is bound to an internal routine much faster than the recursion in our example.
The operator <-- defines a rule to be applied to a specific function. (The <-- operation cannot be applied to an atom.) The _n in the rule for IsIntegerGreaterThanZero() specifies that any object which happens to be the argument of that predicate is matched and assigned to the local variable n. The expression to the right of <-- can use n (without the underscore) as a variable.
Now we consider the rules for the function f. The first rule just specifies that f(0) should be replaced by 1 in any expression. The second rule is a little more involved. n_IsIntegerGreaterThanZero is a match for the argument of f, with the proviso that the predicate IsIntegerGreaterThanZero(n) should return True, otherwise the pattern is not matched. The underscore operator is to be used only on the left hand side of the rule operator <--.
There is another, slightly longer but equivalent way of writing the second rule:
20 # f(_n)_(IsIntegerGreaterThanZero(n)) <-- n*f(n-1); |
Precedence values for rules are given by a number followed by the # operator. This number determines the ordering of precedence for the pattern matching rules, with 0 the lowest allowed precedence value, i.e. rules with precedence 0 will be tried first. Multiple rules can have the same number: this just means that it doesn't matter what order these patterns are tried in. If no number is supplied, 0 is assumed. In our example, the rule f(0) <-- 1 must be applied earlier than the recursive rule, or else the recursion will never terminate. But as long as there are no other rules concerning the function f, the assignment of numbers 10 and 20 is arbitrary, and they could have been 500 and 501 just as well.
Predicates can be combined: for example, IsIntegerGreaterThanZero() could also have been defined as:
10 # IsIntegerGreaterThanZero(n_IsInteger) _(n>0) <-- True; 20 # IsIntegerGreaterThanZero(_n) <-- False; |
In the above example, the (n>0) clause is added after the pattern and allows the pattern to match only if this predicate return True. This is a useful syntax for defining rules with complicated predicates. There is no difference between the rules F(n_IsPositiveInteger)<--... and F(_n)_(IsPositiveInteger(n)) <-- ... except that the first syntax is a little more concise.
The left hand side of a rule expression has the following form:
precedence # pattern _ postpredicate <-- replacement.
The optional precedence must be a positive integer.
10 # _x + 0 <-- x; 20 # _x - _x <-- 0; ArcSin(Sin(_x)) <-- x; |
Yacas will first try to match the pattern as a template. Names preceded or followed by an underscore can match any one object: a number, a function, a list, etc. Yacas will assign the relevant variables as local variables within the rule, and try the predicates as stated in the pattern. The post-predicate (defined after the pattern) is tried after all these matched. As an example, the simplification rule _x - _x <--0 specifies that the two objects at left and at right of the minus sign should be the same.
There is a slightly more complex and general way of defining rules using the functions Rule(), RuleBase() and RulePattern(). However, the standard library defines the "... # ... <--..." construct which is much more readable and usually sufficiently flexible.
In> Sin(x)*Ln(a*b) Out> Sin(x)*Ln(a*b); In> % /: { Ln(_x*_y) <- Ln(x)+Ln(y) } Out> Sin(x)*(Ln(a)+Ln(b)); |
A whole list of simplification rules can be built up in the list, and they will be applied to the expression on the left hand side of /:.
The forms the patterns can have are one of:
pattern <- replacement pattern , replacement pattern , postpredicate , replacement |
Note that for these local rules, <- should be used instead of <--. The latter would be used to define a "global" rule.
The /: operator traverses an expression much like Subst() does, i.e. top down, trying to apply the rules from the beginning of the list of rules to the end of the list of rules. If no rules can be applied to the whole expression, it will try the sub-expressions of the expression being analyzed.
It might be sometimes necessary to use the /:: operator, which repeatedly applies the /: operator until the result does not change any more. Caution is required, since rules can contradict each other, and that could result in an infinite loop. To detect this situation, just use /: repeatedly on the expression. The repetitive nature should become apparent.
59 Temple Place, Suite 330 Boston, MA, 02111-1307 USA |
Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed.
This License is a kind of ``copyleft'', which means that derivative works of the document must themselves be free in the same sense. It complements the GNU General Public License, which is a copyleft license designed for free software.
We have designed this License in order to use it for manuals for free software, because free software needs free documentation: a free program should come with manuals providing the same freedoms that the software does. But this License is not limited to software manuals; it can be used for any textual work, regardless of subject matter or whether it is published as a printed book. We recommend this License principally for works whose purpose is instruction or reference.
A ``Modified Version'' of the Document means any work containing the Document or a portion of it, either copied verbatim, or with modifications and/or translated into another language.
A ``Secondary Section'' is a named appendix or a front-matter section of the Document that deals exclusively with the relationship of the publishers or authors of the Document to the Document's overall subject (or to related matters) and contains nothing that could fall directly within that overall subject. (For example, if the Document is in part a textbook of mathematics, a Secondary Section may not explain any mathematics.) The relationship could be a matter of historical connection with the subject or with related matters, or of legal, commercial, philosophical, ethical or political position regarding them.
The ``Invariant Sections'' are certain Secondary Sections whose titles are designated, as being those of Invariant Sections, in the notice that says that the Document is released under this License.
The ``Cover Texts'' are certain short passages of text that are listed, as Front-Cover Texts or Back-Cover Texts, in the notice that says that the Document is released under this License.
A ``Transparent'' copy of the Document means a machine-readable copy, represented in a format whose specification is available to the general public, whose contents can be viewed and edited directly and straightforwardly with generic text editors or (for images composed of pixels) generic paint programs or (for drawings) some widely available drawing editor, and that is suitable for input to text formatters or for automatic translation to a variety of formats suitable for input to text formatters. A copy made in an otherwise Transparent file format whose markup has been designed to thwart or discourage subsequent modification by readers is not Transparent. A copy that is not ``Transparent'' is called ``Opaque''.
Examples of suitable formats for Transparent copies include plain ASCII without markup, Texinfo input format, LaTeX input format, SGML or XML using a publicly available DTD, and standard-conforming simple HTML designed for human modification. Opaque formats include PostScript, PDF, proprietary formats that can be read and edited only by proprietary word processors, SGML or XML for which the DTD and/or processing tools are not generally available, and the machine-generated HTML produced by some word processors for output purposes only.
The ``Title Page'' means, for a printed book, the title page itself, plus such following pages as are needed to hold, legibly, the material this License requires to appear in the title page. For works in formats which do not have any title page as such, ``Title Page'' means the text near the most prominent appearance of the work's title, preceding the beginning of the body of the text.
You may also lend copies, under the same conditions stated above, and you may publicly display copies.
If the required texts for either cover are too voluminous to fit legibly, you should put the first ones listed (as many as fit reasonably) on the actual cover, and continue the rest onto adjacent pages.
If you publish or distribute Opaque copies of the Document numbering more than 100, you must either include a machine-readable Transparent copy along with each Opaque copy, or state in or with each Opaque copy a publicly-accessible computer-network location containing a complete Transparent copy of the Document, free of added material, which the general network-using public has access to download anonymously at no charge using public-standard network protocols. If you use the latter option, you must take reasonably prudent steps, when you begin distribution of Opaque copies in quantity, to ensure that this Transparent copy will remain thus accessible at the stated location until at least one year after the last time you distribute an Opaque copy (directly or through your agents or retailers) of that edition to the public.
It is requested, but not required, that you contact the authors of the Document well before redistributing any large number of copies, to give them a chance to provide you with an updated version of the Document.
If the Modified Version includes new front-matter sections or appendices that qualify as Secondary Sections and contain no material copied from the Document, you may at your option designate some or all of these sections as invariant. To do this, add their titles to the list of Invariant Sections in the Modified Version's license notice. These titles must be distinct from any other section titles.
You may add a section entitled ``Endorsements'', provided it contains nothing but endorsements of your Modified Version by various parties -- for example, statements of peer review or that the text has been approved by an organization as the authoritative definition of a standard.
You may add a passage of up to five words as a Front-Cover Text, and a passage of up to 25 words as a Back-Cover Text, to the end of the list of Cover Texts in the Modified Version. Only one passage of Front-Cover Text and one of Back-Cover Text may be added by (or through arrangements made by) any one entity. If the Document already includes a cover text for the same cover, previously added by you or by arrangement made by the same entity you are acting on behalf of, you may not add another; but you may replace the old one, on explicit permission from the previous publisher that added the old one.
The author(s) and publisher(s) of the Document do not by this License give permission to use their names for publicity for or to assert or imply endorsement of any Modified Version.
The combined work need only contain one copy of this License, and multiple identical Invariant Sections may be replaced with a single copy. If there are multiple Invariant Sections with the same name but different contents, make the title of each such section unique by adding at the end of it, in parentheses, the name of the original author or publisher of that section if known, or else a unique number. Make the same adjustment to the section titles in the list of Invariant Sections in the license notice of the combined work.
In the combination, you must combine any sections entitled ``History'' in the various original documents, forming one section entitled ``History''; likewise combine any sections entitled ``Acknowledgements'', and any sections entitled ``Dedications''. You must delete all sections entitled ``Endorsements.''
You may extract a single document from such a collection, and distribute it individually under this License, provided you insert a copy of this License into the extracted document, and follow this License in all other respects regarding verbatim copying of that document.
If the Cover Text requirement of section 3 is applicable to these copies of the Document, then if the Document is less than one quarter of the entire aggregate, the Document's Cover Texts may be placed on covers that surround only the Document within the aggregate. Otherwise they must appear on covers around the whole aggregate.
Each version of the License is given a distinguishing version number. If the Document specifies that a particular numbered version of this License "or any later version" applies to it, you have the option of following the terms and conditions either of that specified version or of any later version that has been published (not as a draft) by the Free Software Foundation. If the Document does not specify a version number of this License, you may choose any version ever published (not as a draft) by the Free Software Foundation.
Copyright (C) YEAR YOUR NAME. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.1 or any later version published by the Free Software Foundation; with the Invariant Sections being LIST THEIR TITLES, with the Front-Cover Texts being LIST, and with the Back-Cover Texts being LIST. A copy of the license is included in the section entitled ``GNU Free Documentation License''. |
If you have no Invariant Sections, write ``with no Invariant Sections'' instead of saying which ones are invariant. If you have no Front-Cover Texts, write ``no Front-Cover Texts'' instead of ``Front-Cover Texts being LIST''; likewise for Back-Cover Texts.
If your document contains nontrivial examples of program code, we recommend releasing these examples in parallel under your choice of free software license, such as the GNU General Public License, to permit their use in free software.