14084 search results - page 2511 / 2817 » A Theory for Game Theories |
175
click to vote
ICFP
2005
ACM
16 years 6 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...
187
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
Implementing first-class continuations can pose a challenge if the target machine makes no provisions for accessing and re-installing the run-time stack. In this paper, we present...
209
click to vote
ICFP
2004
ACM
16 years 6 months ago
2004
ACM
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
177
click to vote
ICFP
2004
ACM
16 years 6 months ago
2004
ACM
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...
152
click to vote
ICFP
2003
ACM
16 years 6 months ago
2003
ACM
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...