Article contents
Idealized coinductive type systems for imperative object-oriented programs
Published online by Cambridge University Press: 15 March 2011
Abstract
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.
- Type
- Research Article
- Information
- RAIRO - Theoretical Informatics and Applications , Volume 45 , Issue 1: ICTCS 09 , January 2011 , pp. 3 - 33
- Copyright
- © EDP Sciences, 2011
References
- 8
- Cited by