| M. Coppo, A. Ferrari, "Type Inference, Abstract Interpretation and Strictness Analysis", Theoretical Computer Science 121, 1993, 113--144. |
....with the (E) rule we see that from the same premises we obtain the same type for a fi expansion of the subject. iv) In a calculus enriched with constants (and with the corresponding constant types) in the standard way, the typing rules for and k give a sort of abstract interpretation [26, 18]. As an example we would have that 1 true has type integer boolean and 1ktrue has both types integer and boolean. For the present type assignment system the proof of structural properties is a bit more involved than in case of system B. If x : oe 2 Gamma , then we define Gamma (x) Df oe . ....
M.Coppo, A.Ferrari, "Type Inference, Abstract Interpretation and Strictness Analysis", Theor. Comp. Sci. 121, 1993, 113-144.
....for object oriented languages in [27] Lastly we mention that intersection and union types have been extensively used to prove properties of programs, like strictness analysis, detection of dead code, etc. Pioneers in this field were the PhD thesis of Benton [19] and Jensen [59] and the paper [35]. The recent PhD thesis by Mossin [69] and Damiani [40] contain the last developments and the references to the large literature on the subject. ....
M. Coppo, A. Ferrari, "Type Inference, Abstract Interpretation and Strictness Analysis", Theoretical Computer Science 121, 1993, 113--144.
No context found.
M. Coppo, A. Ferrari, "Type Inference, Abstract Interpretation and Strictness Analysis", Theoretical Computer Science 121, 1993, 113--144.
No context found.
M. Coppo, A. Ferrari, "Type inference, abstract interpretation and strictness analysis", TCS 121, 1993, 113-144.
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