pith. sign in

arxiv: 1109.4618 · v1 · pith:GE7T5LSLnew · submitted 2011-09-21 · 💻 cs.LO

Semantic Predicate Types and Approximation for Class-based Object Oriented Programming

classification 💻 cs.LO
keywords predicateobjectorientedapproximantapproximationcalculusclass-basedresult
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.