Hey Pentti, We Did It Again!: Differentiable vector-symbolic types that prove polynomial termination
Published in arXiv preprint arXiv:2510.16533, 2025
We present a typed computer language, Doug, in which all typed programs may be proved to halt in polynomial time, encoded in a vector-symbolic architecture (VSA).
Recommended citation: Tomkins-Flanagan, E., Hanley, C., & Kelly, M. A. (2025). "Hey Pentti, We Did It Again!: Differentiable vector-symbolic types that prove polynomial termination." arXiv preprint arXiv:2510.16533.
Download Paper
