Matthias Kramm

I like the template idea, it's the one that incurs the smallest performance penalty, and is also probably the one that's easiest to reason about.

In theory, there could be a way to (somehow) turn the predecessor graph into a successor graph. But the most straightforward implementation likely computes the successors directly. (You might need...

Thank you for the update, and for giving this a shot!

Played around with this a little more. The idea of making the analysis bidirectional in all cases, while enticing, suffers from the problem that the dataflow framework makes some unidirectional...

Draft implementation in https://reviews.llvm.org/D137648 (no blocks yet) Notes: 1) This uses one extra pointer in the lattice elements for the forward case, because of the (empty) virtual meet function. There's...

This seems to only happen under Python 3. Under Python 2 (with backported type annotations), the inference looks correct, i.e., balance and amount are, and `deposit` returns, a `Union[complex, float]`....

https://github.com/python/typeshed/commit/337abed05a35f0c5b67c02d42bca0af1e2adc76e merged pytype's and mypy's stubs. The docutils stubs go back to 2014, when mypy still had its own `pyi` files. (See e.g. https://github.com/python/mypy/commit/81d515ce2ecb0407492c319eb9dd53c066d9bd19)

If we had an intersection class in `typing.py`, what would we call it? `Intersection` is linguistically symmetric with `Union`, but it's also rather long. `Intersect` is shorter, but it's a...

For 6502x, good sources are http://www.oxyron.de/html/opcodes02.html https://csdb.dk/getinternalfile.php/222714/NoMoreSecrets-NMOS6510UnintendedOpcodes-20212412.pdf https://www.pagetable.com/?p=39

Thanks for the detailed bug report! I'll take a look. (Give me a few days, I'm in the middle of another thing.)