7529 search results - page 158 / 1506 » The Modula-3 Type System |
135
Voted
IFIP
2004
Springer
15 years 10 months ago
2004
Springer
Abstract We propose an alternative notion of asymptotic behaviors for the study of type2 computational complexity. Since the classical asymptotic notion (for all but finitely many...
131
click to vote
ESOP
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. Type classes in Haskell allow programmers to define functions that can be used on a set of different types, with a potentially different implementation in each case. For ...
132
click to vote
ECIR
2007
Springer
15 years 6 months ago
2007
Springer
This paper extends previous work on document retrieval and document type classification, addressing the problem of ‘typed search’. Specifically, given a query and a designated ...
148
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
125
click to vote
FLOPS
2010
Springer
15 years 11 months ago
2010
Springer
MLF is a type system that seamlessly merges ML-style implicit but second-class polymorphism with System F explicit first-class polymorphism. We present xMLF, a Church-style versi...