Sciweavers

305 search results - page 1 / 61
» An Extension of System F with Subtyping
Sort
View
TACS
1991
Springer
14 years 2 months ago
An Extension of System F with Subtyping
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...
Luca Cardelli, Simone Martini, John C. Mitchell, A...
TLCA
1993
Springer
14 years 2 months ago
Recursive Types Are not Conservative over F
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...
Giorgio Ghelli
LICS
1999
IEEE
14 years 3 months ago
Subtyping Recursive Types in Kernel Fun
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...
Dario Colazzo, Giorgio Ghelli
LICS
1994
IEEE
14 years 2 months ago
A Semantics of Object Types
: 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...
Martín Abadi, Luca Cardelli