Type Assignement for Mobile Objects

Barbanera, Franco; de’Liguoro, Ugo

doi:10.1016/j.entcs.2004.09.020

Cited by 1 publication

(1 citation statement)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We follow in the tradition of intersection types, originally defined as sequences [16], however, by treating our predicates as such: a predicate is a sequence of (potentially incomparable) behaviours, from which any specific one can be selected for an expression as demanded by to the context in which it appears. We also incorporate the late typing of self, another important feature found in other intersection type systems for object calculi [8,5]. This allows for a greater flexibility in the system, permitting us to update an object prior to invoking a method on it.…”

Section: The Predicate Systemmentioning

confidence: 99%

Semantic predicate types and approximation for class-based object oriented programming

Bakel

Rowe

2009

Proceedings of the 11th International Workshop on Formal Techniques for Java-Like Programs

View full text Add to dashboard Cite

Abstract. We define a small functional calculus that expresses class-based object oriented features and is modelled on the similar calculi of Featherweight Java [34] and Middleweight Java [15], which are ultimately based upon the Java programming language. We define a predicate system, similar to the one defined in [10], and show subject reduction and expansion, and argue that program analysis systems can be built on top of this system. Generalising the concept of approximant from the Lambda Calculus, we show that all expressions that we can assign a predicate to have an approximant that satisfies the same predicate. From this, a characterisation of (head-)normalisation follows.

show abstract

Section: The Predicate Systemmentioning

confidence: 99%