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
Yehuda Naveli, Michal Rimon, et al.
AAAI/IAAI 2006
David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
Saurabh Paul, Christos Boutsidis, et al.
JMLR