MathematicaTM programming: an advanced introduction

← Back to document page

Mathematica programming : an advanced introductionLeonid ShifrinPart I: The core languageVersion 2 To my parents First principle: everything is an Atoms and the built-in AtomQ Mathematica normal (composite) Literal equivalents of built-in functions, and FullForm All normal expressions are trees - TreeForm .27 Heads of expressions and the Head Accessing individual parts of expressions through indexing ......................................28 Levels of expressions and the Level Second principle: pattern-matching and rule Rewrite An example of a simple pattern-defined Functions are really rules : DownValues Example of a function based on a restricted A bit about Patterns allow for multiple definitions of the same Non - commutativity of rules Automatic rule Third principle: expression Elementary Symbols and.

MathematicaÒ programming: an advanced introduction Leonid Shifrin Part I: The core language Version 1.01

  Introduction, Programming