237 search results - page 36 / 48 » Coercions in a polymorphic type system |
ICDCSW
2002
IEEE
14 years 15 days ago
2002
IEEE
This paper addresses the fundamental tradeoffs in event systems between scalability (of event filtering, routing, and delivery mechanisms), expressiveness (when describing intere...
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over...
ICSM
2009
IEEE
14 years 2 months ago
2009
IEEE
Maintaining object-oriented systems that use inheritance and polymorphism is difficult, since runtime information, such as which methods are actually invoked at a call site, is n...
ESOP
2001
Springer
14 years 1 days 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...
SIGMOD
1993
ACM
13 years 11 months ago
1993
ACM
Abstract: We propose a framework for the specification of extensible database systems. A particular goal is to implement a software component for parsing and rule-based optimizatio...