[Gareth McCaughan] > <pedant> > "Aussonderungsaxiom" is the axiom of *separation*[1], which is > a weakened version of the (disastrous) axiom of *comprehension*. Ya, sez you <wink>. Seriously, I don't think the usage is as consistent as you would have us believe here. When listcomps were introduced, I suggested at the time that "list separations" would be a better name for them (for the reason you gave), but the historical precedent set by SETL, and carried over into Haskell, means "comprehension" will stick forever in this context. I don't think the distinction is consistent across math texts either. > 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 :-). Yes, we should. SETL and Haskell also required specifying a base set (or list) from which elements are chosen, so they also should have called them separations. > [1] Hence the name; compare English "sunder". > > For the record, I like "generator expressions" too, or "iterator expressions". > </pedant> Good! Guido has decided you love the former, and I agree <wink>.
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