Sciweavers

12 search results - page 1 / 3
» Principal Type Schemes for Modular Programs
Sort
View
ESOP
2007
Springer
13 years 11 months ago
Principal Type Schemes for Modular Programs
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...
Derek Dreyer, Matthias Blume
ICFP
1997
ACM
13 years 9 months ago
A Modular, Polyvariant, and Type-Based Closure Analysis
We observe that the principal typing property of a type system is the enabling technology for modularity and separate compilation [10]. We use this technology to formulate a modul...
Anindya Banerjee
ICFP
2006
ACM
14 years 5 months ago
Modular generic programming with extensible superclasses
"Generics for the Masses" (GM) and "Scrap your Boilerplate" (SYB) are generic programming approaches based on some ingenious applications of Haskell type class...
Martin Sulzmann, Meng Wang
ICFP
2004
ACM
14 years 5 months ago
Types, potency, and idempotency: why nonlinearity and amnesia make a type system work
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...
Harry G. Mairson, Peter Møller Neergaard
POPL
2006
ACM
14 years 5 months ago
A polymorphic modal type system for lisp-like multi-staged languages
This article presents a polymorphic modal type system and its principal type inference algorithm that conservatively extend ML by all of Lisp's staging constructs (the quasi-...
Ik-Soon Kim, Kwangkeun Yi, Cristiano Calcagno