Conference paper
Counterexample to theorems of Cox and Fine
Joseph Y. Halpern
aaai 1996
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.
Joseph Y. Halpern
aaai 1996
Dzung Phan, Vinicius Lima
INFORMS 2023
Conrad Albrecht, Jannik Schneider, et al.
CVPR 2025
Seung Gu Kang, Jeff Weber, et al.
ACS Fall 2023