Let b be a boolean condition with free variable x ∈ X.
The statement for each /x/ where /b/ iterates over all the
values of X that satisfy b.
The /x/ where portion may be omitted when the free variable can
be inferred. For example:
x in container
a < x < b
Determining the possible values of x is probably Difficult? in general. Figuring out how to satisfy constraints is a nasty, problematic problem, akin to theorem-proving.
for each word w, line l, paragraph p in text:
From left to right each element a must map to a single element
b to the right of a. That is, some function f: a →
b must exist.