12519 search results - page 2288 / 2504 » Approximation Problems Categories |
122
click to vote
ICFP
2008
ACM
16 years 5 months ago
2008
ACM
The increasing availability of commodity multicore processors is making parallel computing available to the masses. Traditional parallel languages are largely intended for large-s...
155
click to vote
ICFP
2007
ACM
16 years 5 months ago
2007
ACM
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
136
click to vote
ICFP
2007
ACM
16 years 5 months ago
2007
ACM
It is rare to give a semantic definition of a full-scale programming language, despite the many potential benefits. Partly this is because the available metalanguages for expressi...
121
click to vote
ICFP
2006
ACM
16 years 5 months ago
2006
ACM
We present language mechanisms for polymorphic, extensible records and their exact dual, polymorphic sums with extensible first-class cases. These features make it possible to eas...
137
Voted
ICFP
2006
ACM
16 years 5 months ago
2006
ACM
Dynamic binding and delimited control are useful together in many settings, including Web applications, database cursors, and mobile code. We examine this pair of language feature...