Sciweavers

357 search results - page 10 / 72
» A type system for higher-order modules
Sort
View
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
TARK
1998
Springer
13 years 11 months ago
Conditional, Hierarchical, Multi-Agent Preferences
We develop a revealed-preferencetheory for multiple agents. Some features of our construction, which draws heavily on Jeffrey's utility theory and on formal constructions by D...
Pierfrancesco La Mura, Yoav Shoham
PADO
2001
Springer
13 years 12 months ago
Type Systems for Useless-Variable Elimination
nt Abstractions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63 J¨orgen Gustavsson, Josef Svenningsson Implementing Circularity Using Pa...
Adam Fischbach, John Hannan
POPL
2003
ACM
14 years 7 months ago
A type system for higher-order modules
We present a type theory for higher-order modules that accounts for many central issues in module system design, including translucency, applicativity, generativity, and modules a...
Derek Dreyer, Karl Crary, Robert Harper
ICFP
2007
ACM
14 years 7 months ago
A type system for recursive modules
There has been much work in recent years on extending ML with recursive modules. One of the most difficult problems in the development of such an extension is the double vision pr...
Derek Dreyer