305 search results - page 1 / 61 » An Extension of System F with Subtyping |
TACS
1991
Springer
13 years 8 months ago
1991
Springer
System F is a well-known typed λ-calculus with polymorphic types, which provides a basis for polymorphic programming languages. We study an extension of F, called F<: (pronoun...
TLCA
1993
Springer
13 years 8 months ago
1993
Springer
d abstract) Giorgio Ghelli1 F≤ is a type system used to study the integration of inclusion and parametric polymorphism. F≤ does not include a notion of recursive types, but ext...
TACS
1997
Springer
13 years 8 months ago
1997
Springer
LICS
1999
IEEE
13 years 9 months ago
1999
IEEE
The problem of defining and checking a subtype relation between recursive types was studied in [3] for a first order type system, but for second order systems, which combine subty...
LICS
1994
IEEE
13 years 8 months ago
1994
IEEE
: We give a semantics for a typed object calculus, an extension of System F with object subsumption and method override. We interpret the calculus in a per model, proving the sound...