Semantic Predicate Types and Approximation for Class-based Object Oriented Programming
Abstract
We apply the principles of the intersection type discipline to the study of class-based object oriented programs and; our work follows from a similar approach (in the context of Abadi and Cardelli's Varsigma-object calculus) taken by van Bakel and de'Liguoro. We define an extension of Featherweight Java, FJc and present a predicate system which we show to be sound and expressive. We also show that our system provides a semantic underpinning for the object oriented paradigm by generalising the concept of approximant from the Lambda Calculus and demonstrating an approximation result: all expressions to which we can assign a predicate have an approximant that satisfies the same predicate. Crucial to this result is the notion of predicate language, which associates a family of predicates with a class.
Keywords
Cite
@article{arxiv.1109.4618,
title = {Semantic Predicate Types and Approximation for Class-based Object Oriented Programming},
author = {Steffen van Bakel and Reuben N. S. Rowe},
journal= {arXiv preprint arXiv:1109.4618},
year = {2011}
}
Comments
Proceedings of 11th Workshop on Formal Techniques for Java-like Programs (FTfJP'09), Genova, Italy, July 6 2009