2022/08/31 by Ori Roth, Roth, Ori · 3 voices · 1 citation
#cs.PL
paper · pdf · doi:10.48550/arxiv.2208.14755
Grigore showed that Java generics are Turing complete by describing a reduction from Turing machines to Java subtyping. We apply Grigore's algorithm to Python type hints and deduce that they are Turing complete. In addition, we present an alternative reduction in which the Turing machines are simulated in real time, resulting in significantly lower compilation times. Our work is accompanied by a Python implementation of both reductions that compiles Turing machines into Python subtyping machines.