168 search results - page 2 / 34 » A Generalization of Hybrid Let-Polymorphic Type Inference Al... |
162
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Ontologies and rules are usually loosely coupled in knowledge representation formalisms. In fact, ontologies use open-world reasoning while the leading semantics for rules use non...
136
Voted
POPL
1993
ACM
15 years 7 months ago
1993
ACM
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...
112
click to vote
POPL
1991
ACM
15 years 6 months ago
1991
ACM
We present a new approach to the polymorphic typing of data accepting in-place modification in ML-like languages. This approach is based on restrictions over type generalization,...
109
click to vote
ESOP
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Two of the most prominent features of ML are its expressive module system and its support for Damas-Milner type inference. However, while the foundations of both these fe...
150
click to vote
SAS
1994
Springer
15 years 7 months ago
1994
Springer
Constraint-based analysis is a technique for inferring implementation types. Traditionally it has been described using mathematical formalisms. We explain it in a different and mor...