Sciweavers

429 search results - page 34 / 86
» Polymorphic typed defunctionalization
Sort
View
OOPSLA
2009
Springer
14 years 2 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»
13 years 7 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
14 years 7 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
VLDB
1993
ACM
142views Database» more  VLDB 1993»
13 years 11 months ago
Collections of Objects in SQL3
SQL3generalizestherelationalmodelinto anobjectmodel abstract data types, multiple inheritance, and dynamic polymorphism. Tables may then contain collections (multisets) of objects...
David Beech

Book
314views
15 years 5 months ago
Programming in Martin-Löf's Type Theory
"This book describes different type theories (theories of types, polymorphic and monomorphic sets, and subsets) from a computing science perspective. It is intended for resear...
Bengt Nordström, Kent Petersson, Jan M. Smith