111 search results - page 8 / 23 » Constructing Polymorphic Programs with Quotient Types |
ICFP
2005
ACM
14 years 7 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...
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
We explore partial type-inference for System F based on type-containment. We consider both cases of a purely functional semantics and a call-by-value stateful semantics. To enable...
POPL
2007
ACM
14 years 8 months ago
2007
ACM
ML modules and Haskell type classes have proven to be highly effective tools for program structuring. Modules emphasize explicit configuration of program components and the use of...
POPL
2005
ACM
14 years 8 months ago
2005
ACM
We define compositional compilation as the ability to typecheck source code fragments in isolation, generate corresponding binaries, and link together fragments whose mutual assum...
FSTTCS
1993
Springer
14 years 14 hour ago
1993
Springer
A for-loop is somewhat similar to an inductive argument. Just as the truth of a proposition P(n + 1) depends on the truth of P(n), the correctness of iteration n+1 of a for-loop de...