Restricted Patterns and Replacement Rules

Michael Trott
Additional contact information
Michael Trott: Wolfram Research

Chapter Chapter 5 in The Mathematica GuideBook for Programming, 2004, pp 538-698 from Springer

Abstract: Abstract The main topics of this chapter are replacement rules and patterns. No other available programming systemcomes close to Mathematical ability to match patterns in arbitrary structures (expressions). The ability to selectsubexpressions on the basis of their form and/or contents and to manipulate them permits the construction ofvery elegant, short, and direct programs. However, the use of pattern matching in very large expressions mayrequire a lot of time because of the potential combinatorial explosion of all possible pattern realizations. But athoughtful, appropriate use of patterns allows us to write programs that are quite elegant, fast, natural, and easyto read and to maintain. We begin this chapter with a discussion of Boolean variables and functions because thedetermination of truth values is an important part of constructing special patterns.

Keywords: Boolean Function; Function Definition; Rule Application; Restricted Pattern; Replacement Rule (search for similar items in EconPapers)
Date: 2004
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4419-8503-3_5

Ordering information: This item can be ordered from
http://www.springer.com/9781441985033

DOI: 10.1007/978-1-4419-8503-3_5

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().