On 4 feb 2006, at 3:18, Nick Coghlan wrote: > All I'm suggesting is that a similarly inspired syntax is worth > considering when it comes to deferred expressions: > > def f(x): > return x*x > > => f = (x*x def (x)) It's not the same, as x remains free whereas in g = [x*x for x in seq] x is bound. Yours is f = lambda x: x*x and it will die by Guido hand... --eric
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