111 search results - page 9 / 23 » Constructing Polymorphic Programs with Quotient Types |
PLDI
2005
ACM
14 years 1 months ago
2005
ACM
Concepts are an essential language feature for generic programming in the large. Concepts allow for succinct expression of constraints on type parameters of generic algorithms, en...
ICFP
2006
ACM
14 years 7 months ago
2006
ACM
We present language mechanisms for polymorphic, extensible records and their exact dual, polymorphic sums with extensible first-class cases. These features make it possible to eas...
ECOOP
2000
Springer
14 years 7 days ago
2000
Springer
This paper studies specific language level abstractions for component-based programming. We propose a simple model which captures some basic ingredients — like explicit context ...
TACS
1991
Springer
13 years 11 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...
SAC
2006
ACM
14 years 1 months ago
2006
ACM
We propose union types for statically typed class-based objectoriented languages as a means to enhance the flexibility of subtyping. As its name suggests, a union type can be con...