25 search results - page 2 / 5 » F-Bounded Polymorphism for Object-Oriented Programming |
IWPC
2000
IEEE
13 years 9 months ago
2000
IEEE
Call graphs are commonly used as input for automatic clustering algorithms, the goal of which is to extract the high level structure of the program under study. Determining the ca...
APLAS
2004
ACM
13 years 10 months ago
2004
ACM
This paper develops a mathematical characterisation of object-oriented concepts by defining an observation-oriented semantics for an object-oriented language (OOL) with a rich var...
ECOOP
1995
Springer
13 years 8 months ago
1995
Springer
FPCA
1989
13 years 9 months ago
1989
Bounded quantification was introduced by Cardelli and Wegner as a means of typing functions that operate uniformly over all subtypes of a given type. They defined a simple “ob...
ECOOP
1991
Springer
13 years 8 months ago
1991
Springer
: Polymorphic inline caches (PICs) provide a new way to reduce the overhead of polymorphic message sends by extending inline caches to include more than one cached lookup result pe...