429 search results - page 29 / 86 » Parameter-free polymorphic types |
KI
2008
Springer
14 years 11 months ago
2008
Springer
In this paper we suggest a typed compositional semantics for nominal compounds of the form [Adj Noun] that models adjectives as higher-order polymorphic functions, and where types...
131
click to vote
POPL
1989
ACM
15 years 3 months ago
1989
ACM
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
OOPSLA
2009
Springer
15 years 6 months ago
2009
Springer
Generic classes can be used to improve performance by allowing compile-time polymorphism. But the applicability of compile-time polymorphism is narrower than that of runtime polym...
105
click to vote
JFP
2007
14 years 11 months ago
2007
Haskell’s popularity has driven the need for ever more expressive type system features, most of which threaten the decidability and practicality of Damas-Milner type inference. ...
ICFP
2005
ACM
15 years 11 months ago
2005
ACM
module is a programming abstraction that simultaneously generalizes -abstractions, records, and mutually recursive definitions. Although various mixin module type systems have bee...