In this paper we present a recursion-theoretic denotational semantics for Featherweight Java. Our interpretation is based on a formalization of the object model of Castagna, Ghelli and Longo in a predicative theory of types and names. Although this theory is proof-theoretically weak, it allows to prove many properties of programs written in Featherweight Java. This underpins Feferman’s thesis that impredicative assumptions are not needed for computational practice.
CITATION STYLE
Studer, T. (2001). Constructive foundations for featherweight java. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2183, pp. 202–238). Springer Verlag. https://doi.org/10.1007/3-540-45504-3_13
Mendeley helps you to discover research relevant for your work.