3738 search results - page 529 / 748 » Parametrized Logic Programming |
101
click to vote
ICFP
2004
ACM
16 years 18 days 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...
113
Voted
POPL
2010
ACM
15 years 10 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...
157
Voted
TLDI
2010
ACM
15 years 9 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...
126
Voted
ENTCS
2008
15 years 21 days 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 ...
134
Voted
CEC
2011
IEEE
14 years 19 days ago
2011
IEEE
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...