Hi, I try to write a text about what I understood on problems related to the CPython C API, CPython performance, the scientific Python ecosystem and HPy (see https://discuss.python.org/t/c-api-working-group-and-plan-to-get-a-python-c-api-compatible-with-alternative-python-implementations/89477 and recent mails in this list).
I have a specific question about the effect of ref counting and non-movable objects for interpreters of dynamic languages like Python. Since all fast Python interpreters (and many interpreters for other similar languages) use more complex alternatives, I guess this would be very difficult to get good performance with such methods. However, I don't really know why and if it could be possible to get good performance with such algorithms. Interestingly, the Faster CPython project tries to make CPython faster while keeping ref counting and non-movable objects. I guess people knowing the subject (for example PyPy or GraalPy devs) could give good arguments on these questions or provide interesting and serious references. Best regards, Pierre _______________________________________________ pypy-dev mailing list -- pypy-dev@python.org To unsubscribe send an email to pypy-dev-le...@python.org https://mail.python.org/mailman3/lists/pypy-dev.python.org/ Member address: arch...@mail-archive.com
