37 search results - page 4 / 8 » Subtyping Constraints in Quasi-lattices |
OOPSLA
1995
Springer
13 years 11 months ago
1995
Springer
All object-oriented languages provide support for subtype polymorphism, which allows the writing of generic code that works for families of related types. There is also a need, ho...
WWW
2001
ACM
14 years 8 months ago
2001
ACM
Integrity constraints are an essential part of a modern schema definition language. They are useful for semantic specification, update consistency control, query optimization, inf...
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...
OOPSLA
1991
Springer
13 years 11 months ago
1991
Springer
We present a new approach to inferring types in untyped object-oriented programs with inheritance, assignments, and late binding. It guarantees that all messages are understood, a...
ICFP
2003
ACM
14 years 7 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...