Tim Peters wrote:
> "Set comprehensions" in a programming language originated with SETL,
> and are named in honor of the set-theoretic Axiom of Comprehension
> (Aussonderungsaxiom). In its well-behaved form, that says roughly that
> given a set X, then for any predicate P(x), there exists a subset of X whose
> elements consist of exactly those elements x of X for which P(x) is true (in
> its ill-behaved form, it leads directly to Russell's Paradox -- the set of
> all sets that don't contain themselves).
<pedant>
"Aussonderungsaxiom" is the axiom of *separation*[1], which is
a weakened version of the (disastrous) axiom of *comprehension*.
In terms of Python's listcomps, comprehension would be [x if P(x)]
and separation [x for x in S if P(x)]. So we should be
calling them "list separations", really :-).
[1] Hence the name; compare English "sunder".
For the record, I like "generator expressions" too, or "iterator
expressions".
</pedant>
--
Gareth McCaughan
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4