33 search results - page 3 / 7 » Bounded polymorphism in session types |
JFP
2007
13 years 7 months ago
2007
Haskell’s popularity has driven the need for ever more expressive type system features, most of which threaten the decidability and practicality of Damas-Milner type inference. ...
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
module is a programming abstraction that simultaneously generalizes -abstractions, records, and mutually recursive definitions. Although various mixin module type systems have bee...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and optimal reduction. Following p...
POPL
1998
ACM
13 years 11 months ago
1998
ACM
constraint solver. The other infers annotations on bound variables in function abstractions by propagating type constraints downward from enclosing application nodes. We motivate o...
SAS
1991
Springer
13 years 11 months ago
1991
Springer
We present a new approach to static program analysis that permits each expression in a program to be assigned an execution time estimate. Our approach uses a time system in conjun...