Abstract
In Maple, a functional relationship can be specified in three ways: as a formula, as an arrow operator (similar to common mathematical notation), and as a procedure. In this chapter we shall discuss all methods in detail. Special attention will be paid to recursively defined procedures and functions. The role of the remember option in defining efficient, recursive functions will be treated in detail.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
Heck, A. (2003). Functions. In: Introduction to Maple. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-0023-6_8
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0023-6_8
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-6505-4
Online ISBN: 978-1-4613-0023-6
eBook Packages: Springer Book Archive