# Symbolic Mathematics System Evaluators

@inproceedings{Fateman2002SymbolicMS, title={Symbolic Mathematics System Evaluators}, author={R. Fateman}, year={2002} }

“Evaluation” of expressions and programs in a computer algebra system is central to every system, but inevitably fails to provide complete satisfaction. Here we explain the conflicting requirements, describe some solutions from current systems, and propose alternatives that might be preferable sometimes. We give examples primarily from Axiom, Macsyma, Maple, Mathematica, with passing mention of a few other systems.

#### 11 Citations

Can Computer Algebra be Liberated from its Algebraic Yoke ?

- Mathematics, Computer Science
- ArXiv
- 2005

The entangled roles of functional analysis and symbolic programming, especially the functional and transformational paradigms, are put forward and algebraic algorithms could constitute the core of extended symbolic manipulation systems including primitives for symbolic approximations. Expand

Computer Algebra and Symbolic Computation: Elementary Algorithms

- Computer Science
- 2002

The viewpoint is that mathematical expressions are the data objects of computer algebra programs, and by using a few primitive operations that analyze and construct expressions, the authors can implement many elementary operations from algebra, trigonometry, calculus, and differential equations. Expand

Computer Algebra and Symbolic Computation: Mathematical Methods

- Computer Science
- 2003

Maintaining the style set by Elementary Algorithms, the author explains mathematical methods as needed while introducing advanced methods to treat complex operations. Expand

The Marriage of MrMathematica and MzScheme

- 2005

In this paper, I argue that the programming languages provid ed in current mainstream CASes are not suitable for general pur pose programming. To address this problem, I developed MrMa thematica.… Expand

Symbolic and algebraic computation in robust stability analysis

- Mathematics, Computer Science
- SIGS
- 2000

A new development in robust stability analysis is described which the stability margin (kM) problem can be formulated as solving polynomial systems by using symbolic computation. Expand

Computing gröbner fans of toric ideals

- Mathematics, Computer Science
- SIGS
- 2000

A new development in robust stability analysis is described which the stability margin (kM) problem can be formulated as solving polynomial systems by using symbolic computation. Expand

Flat matching

- Computer Science, Mathematics
- J. Symb. Comput.
- 2008

A set of rules are given that, in this perspective, describes the precise semantics for the flat matching algorithm implemented in the Mathematica system. Expand

Rapid computation of Bernoulli and related numbers

- Mathematics, Computer Science
- SIGS
- 2000

This poster explores some of the techniques of deriving new recursion formulae for Bernoulli numbers, and expands upon these methods that were automated in Maple and discussed in a much more general setting for my thesis. Expand

IAMC architecture and prototyping: a progress report

- Mathematics, Computer Science
- ISSAC '01
- 2001

Conceptual and experimental work on the IAMC architecture, a client prototype, client GUI, a server prototype, the Mathematical Computation Protocol (MCP), mathematical data encoding, and the external compute engine interface are presented. Expand

The Internet accessible mathematical computation framework

- Computer Science
- Science in China Series F: Information Sciences
- 2007

The Internet Accessible Mathematical Computation (IAMC) framework aims to make it easy to supply mathematical computing powers over the Internet/Web. The protocol-based IAMC framework enables… Expand

#### References

SHOWING 1-10 OF 24 REFERENCES

The design of a language for algebraic computation systems

- Computer Science
- 1983

This thesis describes the design of a language to support a mathematics-oriented symbolic algebra system that permits the complex interrelations of mathematical types, such as rings, fields and polynomials to be described. Expand

A Review of Mathematica

- Computer Science, Mathematics
- J. Symb. Comput.
- 1992

The Mathematica computer system is reviewed from the perspective of its contributions to symbolic and algebraic computation, as well as its stated goals. Design and implementation issues are… Expand

The Weyl Computer Algebra Substrate

- Computer Science
- DISCO
- 1993

Weyl is a new type of computer algebra substrate that extends an existing, object oriented programming language with symbolic computing mechanisms that takes heavy advantage of the ability to overload primitive arithmetic operations in the base language. Expand

Spreadsheet computations in computer algebra

- Computer Science
- SIGS
- 1992

This paper considers several alternative models for what spreadsheet computations could mean in the symbolic context, and describes the implementation of spreadsheet features based on one of these models in the visual computer algebra environment MathScribe. Expand

Computer algebra symbolic and algebraic computation

- Computer Science
- SIGS
- 1982

This volume is the first systematic and complete treatment of computergebra and presents the basic problems of computer algebra and the best algorithms now known for their solution with their mathematical foundations, and complete references to the original literature. Expand

AXIOM: the scientific computation system

- Computer Science
- 1992

This book gives the reader a technical introduction to AXIOM, interacts with the system's tutorial, accesses algorithms newly developed by the symbolic computation community, and presents advanced programming and problem solving techniques. Expand

Mathematica - a system for doing mathematics by computer, 2nd Edition

- Computer Science, Mathematics
- 1988

This new edition maintains the format of the original book and is the single most important user guide and reference for Mathematica--all users ofMathematica will need this edition. Expand

Maple V Language Reference Manual

- Computer Science
- Springer US
- 1991

This text describes the Maple Symbolic Computation System and the Maple V language and describes the numeric and symbolic expressions that can be used in Maple V, including its 2D and 3D graphics. Expand

Review of mathematica

- Computer Science
- 1997

Examples of Mathematica's utility in risk assessment are discussed, and a copy of the newly released version 3.0 of the programming language is reviewed. Expand

Programming Expert Systems in OPS5 - An Introduction to Rule-Based Programming(1)

- Computer Science
- Int. CMG Conference
- 1985

What do you do to start reading programming expert systems in ops5 an introduction to rule based programming the addison wesley series in artificial intelligence? Searching the book that you love to… Expand