Sciweavers

429 search results - page 29 / 86
» Parameter-free polymorphic types
Sort
View
KI
2008
Springer
15 years 1 months ago
Concerning Olga, the Beautiful Little Street Dancer: Adjectives as Higher-Order Polymorphic Functions
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...
Walid S. Saba
POPL
1989
ACM
15 years 6 months ago
How to Make ad-hoc Polymorphism Less ad-hoc
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
Philip Wadler, Stephen Blott
OOPSLA
2009
Springer
15 years 8 months ago
Minimizing dependencies within generic classes for faster and smaller programs
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...
Dan Tsafrir, Robert W. Wisniewski, David F. Bacon,...
JFP
2007
136views more  JFP 2007»
15 years 1 months ago
Practical type inference for arbitrary-rank types
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. ...
Simon L. Peyton Jones, Dimitrios Vytiniotis, Steph...
ICFP
2005
ACM
16 years 1 months ago
Type inference, principal typings, and let-polymorphism for first-class mixin modules
module is a programming abstraction that simultaneously generalizes -abstractions, records, and mutually recursive definitions. Although various mixin module type systems have bee...
Henning Makholm, J. B. Wells