8706 search results - page 471 / 1742 » Learning Subjective Language |
152
click to vote
ICFP
2008
ACM
16 years 4 months ago
2008
ACM
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
138
click to vote
ICFP
2007
ACM
16 years 4 months ago
2007
ACM
Operators for delimiting control and for capturing composable continuations litter the landscape of theoretical programming language research. Numerous papers explain their advant...
102
click to vote
ICFP
2006
ACM
16 years 4 months ago
2006
ACM
This paper presents the core type system and type inference algorithm of OCamlDuce, a merger between OCaml and XDuce. The challenge was to combine two type checkers of very differ...
141
click to vote
ICFP
2003
ACM
16 years 4 months ago
2003
ACM
Lazy programs are beautiful, but they are slow because they build many thunks. Simple measurements show that most of these thunks are unnecessary: they are in fact always evaluate...
145
click to vote
ICFP
2002
ACM
16 years 4 months ago
2002
ACM
Even when programming in a statically typed language we every now and then encounter statically untypable values; such values result from interpreting values or from communicating...