Paula Harder, Venkatesh Ramesh, et al.
EGU 2023
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.
Paula Harder, Venkatesh Ramesh, et al.
EGU 2023
Giuseppe Romano, Aakrati Jain, et al.
ECTC 2025
Amarachi Blessing Mbakwe, Joy Wu, et al.
NeurIPS 2023
Daniel Karl I. Weidele, Hendrik Strobelt, et al.
SysML 2019