2477 search results - page 237 / 496 » Parallelizing Functional Programs by Generalization |
158
click to vote
ICFP
2004
ACM
16 years 6 months ago
2004
ACM
Higher-order languages that encourage currying are implemented using one of two basic evaluation models: push/enter or eval/apply. Implementors use their intuition and qualitative...
160
click to vote
MP
1998
15 years 6 months ago
1998
We define the base polytope B(P, g) of a partially ordered set P and a supermodular function g on the ideals ofP as the convex hull of the incidence vectors of all linear extensio...
170
click to vote
ICFP
2002
ACM
16 years 6 months ago
2002
ACM
We propose an extension of Haskell's type class system with bstractions in the type language. Type inference for our extension relies on a novel constrained unification proce...
167
click to vote
SCAM
2006
IEEE
16 years 15 days ago
2006
IEEE
Programmers often want to transform the source or binary representations of their programs (e.g., to optimize, add dynamic safety checks, or add profile gathering code). Unfortun...
158
click to vote
SIGSOFT
2004
ACM
16 years 7 months ago
2004
ACM
Dynamic detection of likely invariants is a program analysis that generalizes over observed values to hypothesize program properties. The reported program properties are a set of ...