Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.
In this paper an algonthra for the determination of run-tune types m a programming language requiring no type declaratmns is presented It is demonstrated that this algorithm is superior to other pubhshed algortthms m the sense that it produces stronger assertions about the set of possible types for variables than do other known algorithms. In fact this algonthra is shown to be the best possible algorithm from among all those that use the same set of prumttve operators. © 1980, ACM. All rights reserved.
Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.
Zijian Ding, Michelle Brachman, et al.
C&C 2025
Danila Seliayeu, Quinn Pham, et al.
CASCON 2024
Pavel Klavík, A. Cristiano I. Malossi, et al.
Philos. Trans. R. Soc. A