Sciweavers

98 search results - page 15 / 20
» Constraints as polymorphic connectors
Sort
View
JFP
2008
97views more  JFP 2008»
14 years 9 months ago
HM(X) type inference is CLP(X) solving
The HM(X) system is a generalization of the Hindley/Milner system parameterized in the constraint domain X. Type inference is performed by generating constraints out of the progra...
Martin Sulzmann, Peter J. Stuckey
ECOOP
2003
Springer
15 years 3 months ago
A Nominal Theory of Objects with Dependent Types
We design and study νObj, a calculus and dependent type system for objects and classes which can have types as members. Type can be aliases, abstract types, or new types. The type...
Martin Odersky, Vincent Cremet, Christine Röc...
ISORC
1999
IEEE
15 years 2 months ago
An Adaptive Scheduling Approach in Real-Time CORBA
CORBA is an emerging middleware infrastructure with open standardization that is receiving a good acceptance since it makes easier to program distributed objects. CORBA is being e...
Carlos Montez, Joni da Silva Fraga, Jean-Marie Far...
FLOPS
1999
Springer
15 years 2 months ago
Using Types as Approximations for Type Checking Prolog Programs
Abstract. Subtyping tends to undermine the effects of parametric polymorphism as far as the static detection of type errors is concerned. Starting with this observation we present...
Christoph Beierle, Gregor Meyer
POPL
1993
ACM
15 years 2 months ago
Type Checking Type Classes
We study the type inference problem for a system with type classes as in the functional programminglanguage Haskell. Type classes are an extension of ML-style polymorphismwith ove...
Tobias Nipkow, Christian Prehofer