Maximal free expression

From HaskellWiki
Revision as of 20:09, 5 October 2006 by BrettGiles (talk | contribs) (Convert from HaWiki)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

A free expression which is as large as it can be in the sense that is not a proper subexpression of another free express.

This is within the context of a given expression, and subexpressions are partially ordered with respect to containment, and have finite length, so there will always be maximal (but possibly not unique) free (sub-)expressions. Note that there is a subtle but important difference between the words maximal and maximum. An element x of a partially ordered set is called maximal if there is no such that , and it is called a maximum if . If a maximum exists, it is unique, but there can be many maximal (but not maximum) elements.