5506 search results - page 635 / 1102 » Minimal Logic Programs |
178
Voted
SIAMJO
2010
15 years 1 months ago
2010
Necessary first-order sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. These conditions are sati...
183
Voted
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...
199
Voted
POPL
2010
ACM
16 years 4 months ago
2010
ACM
We present a verified compiler to an idealized assembly language from a small, untyped functional language with mutable references and exceptions. The compiler is programmed in th...
278
Voted
TLDI
2010
ACM
16 years 3 months ago
2010
ACM
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
202
click to vote
ENTCS
2008
15 years 7 months ago
2008
We present Oracle-Based Partial Evaluation (OBPE), a novel approach to on-line Partial Evaluation (PE) which decides the control strategy to use for each call pattern by using an ...