33 search results - page 2 / 7 » Bounded polymorphism in session types |
116
click to vote
FPCA
1989
15 years 7 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...
134
click to vote
ICFP
2007
ACM
16 years 3 months ago
2007
ACM
The MLF type system by Le Botlan and R?emy (2003) is a natural extension of Hindley-Milner type inference that supports full firstclass polymorphism, where types can be of higher-...
116
click to vote
APLAS
2010
ACM
15 years 3 months ago
2010
ACM
This paper studies the problem of statically determining upper bounds on the resource consumption of first-order functional programs. A previous work approached the problem with an...
122
click to vote
LICS
1999
IEEE
15 years 7 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...
107
click to vote
ICFP
2003
ACM
16 years 3 months ago
2003
ACM
We propose a conservative extension of HM(X), a generic constraint-based type inference framework, with bounded existential (a.k.a. abstract) and universal (a.k.a. polymorphic) da...