[Python-ideas] Pattern matching

[Andrew Barnert]

On Apr 7, 2015, at 19:04, Chris Angelico <rosuav at gmail.com> wrote:
> 
> On Wed, Apr 8, 2015 at 7:10 AM, Andrew Barnert
> <abarnert at yahoo.com.dmarc.invalid> wrote:
>> The smaller problem is that in Python, only functions (and classes and modules) have scope; the idea of a name bound "locally" is tricky. There's a bit of hackery around except clauses...
> 
> FWIW it's not hackery around scope at all - it's simply that the name
> gets unbound:

Sorry, you're right, "hackery" is misleading here; I should have just said "(yes, I know about comprehensions and except clauses, but they're not relevant here)" or something similar. I don't consider the 3.x rules for except "hacky" or bad in any way, and didn't mean to imply otherwise.

Anyway, an ML/Haskell case expression binds the matched variables inside the case branch; the most obvious interpretation of this proposal (or mine) would bind them in the entire function.
Of course it's possible to solve that (if you think it needs solving) either the way comprehensions do (compile the case statement, or each branch, as a function definition and call) or the way except does (unbind names that appear in the "as" clause after the statement), or probably other ways, but if you don't do anything, they work like assignments. (Which is actually a perfectly good parallel to ML, where they work like let expressions, it's just that let expressions don't work like assignments.)