37 search results - page 3 / 8 » Subtyping Constraints in Quasi-lattices |
LICS
1997
IEEE
13 years 11 months ago
1997
IEEE
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
IFM
2009
Springer
14 years 2 months ago
2009
Springer
Object-orientation supports code reuse and incremental programming. Multiple inheritance increases the power of code reuse, but complicates the binding of method calls and thereby ...
ESOP
2001
Springer
13 years 12 months ago
2001
Springer
Equality constraints (unification constraints) have widespread use in program analysis, most notably in static polymorphic type systems. Conditional equality constraints extend eq...
ICFP
1997
ACM
13 years 11 months ago
1997
ACM
We present a type system for the programming language Erlang. The type system supports subtyping and declarationfree recursive types, using subtyping constraints. Our system is si...
ICDE
1995
IEEE
14 years 8 months ago
1995
IEEE
The model of flexible relations supports heterogeneous sets of tuples in a strongly typed way. The elegance of the standard relational model is preserved by using a single, generi...