Titlebook: Introduction to Programming with Mathematica?; Includes diskette Richard J. Gaylord,Samuel N. Kamin,Paul R. Wellin Book 1993 Springer Scien

ROOF

Functions,y perform computations producing results. In this chapter we will demonstrate, in a step-by-step manner, how to create a user-defined function using a functional programming style. Building upon the nesting of function calls, extensive use is made of higher-order and anonymous functions. The constru

NAG

Evaluation of Expressions,omputation proceeds by evaluation of expressions. An expression is evaluated by finding those rewrite rules whose pattern matches part of the expression. That part is then replaced by the replacement text of that rule. Evaluation then proceeds by searching for further matching rules until no more ar

強(qiáng)化

Allege

Recursion,y legal and extremely useful. In fact, many of the built-in operations of . could be written in . itself using recursion. In this chapter, we will present many examples of recursion and explain how recursive functions are written.

Munificent

–吃

Numerics,kinds of numbers and has the ability to operate with numbers in a variety of ways. Most importantly, it can operate on numbers of any size and to any degree of precision. In this chapter we will explore some computational aspects of numbers and look into the issues that must be addressed when using

palette

PHON

978-3-540-94048-7Springer Science+Business Media New York 1993

無(wú)畏

Overview: 978-3-540-94048-7978-3-662-25527-8

condemn