Any chance for reconsideration of PEP 335?

[hprodh]

@gcewing

However, there’s a fundamental flaw with that approach – it relies on enough of the leaf nodes of your expression being of the appropriate special types, which can be laborious to achieve.

→ True.
(Related :Linked Booleans Logics (rethinking PEP 505))

The only way out of this would be to create a “deferred” context, with a root-based approach, rather than leaf-based, and where the global operations would be locally overriden within a context, e.g. overriding the __getattr__, __getitem__, __or__, __and__ of roots a, b, c in :

WithDeferredContext{ a | b & c[d].e }  # pseudo-code

Not sure it is pythonic (thus viable) though, because it is a mini-language.
But it would cover PEP 505 issues and possibly more…

@Rosuav

If you DON’T want it to short-circuit, why do you want it to be written as a or b rather than a | b ?

Totally legit. I think if you want to do such specialized stuff, you better use explicitly specialized operations, because you can specialize yourself in understanding the specialized ops, and leave the general operators alone.