| Alexander Aiken, Edward L. Wimmers, and T. K. Lakshman. Sort typing with conditional types. In Twenty First Symposium on Principles of Programming Languages, 1994. To appear. |
....to a few concrete types, these techniques can be very effective. This and virtually all other optimization of object oriented languages will benefit from the superior information generated by our improved type inference techniques. The constraint based type system of Aiken, Wimmers, and Lakshman [3], adds conditional types unions and intersections to an ML style type inference allowing the incorporation of flow sensitive information. Our algorithm also shares some features of the closure analysis and binding time analysis phases used in self applicative partial evaluators [17] However, both ....
Alexander Aiken, Edward L. Wimmers, and T. K. Lakshman. Sort typing with conditional types. In Twenty First Symposium on Principles of Programming Languages, 1994. To appear.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC