| Issue |
RAIRO-Theor. Inf. Appl.
Volume 45, Number 1, January-March 2011
ICTCS 09
|
|
|---|---|---|
| Page(s) | 3 - 33 | |
| DOI | https://doi.org/10.1051/ita/2011009 | |
| Published online | 15 March 2011 | |
Idealized coinductive type systems for imperative object-oriented programs
DISI, University of Genova, Genova, Italy;
{davide,lagorio}@disi.unige.it
Received:
16
February
2010
Accepted:
18
November
2010
In recent work we have proposed a novel approach to define idealized type systems for object-oriented languages, based on abstract compilation of programs into Horn formulas which are interpreted w.r.t. the coinductive (that is, the greatest) Herbrand model. In this paper we investigate how this approach can be applied also in the presence of imperative features. This is made possible by considering a natural translation of Static Single Assignment intermediate form programs into Horn formulas, where φ functions correspond to union types.
Mathematics Subject Classification: 03B70 / 03B15
Key words: Imperative object-oriented languages / type analysis / coinduction / SSA intermediate form
© EDP Sciences, 2011
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.