2000 search results - page 137 / 400 » Program Transformation and Proof Transformation |
113
Voted
IPL
2007
15 years 3 months ago
2007
We present a characterization of first-order functional programs which are quasiterminating w.r.t. the symbolic execution mechanism of needed narrowing, i.e., computations in the...
127
click to vote
TPDS
1998
15 years 3 months ago
1998
We present a set of advanced program parallelization techniques that are able to signi cantly improve the performance of application programs. We present evidence for this improve...
123
Voted
ECAI
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. We describe an approach for compiling dynamic preferences into logic programs under the answer set semantics. An ordered logic program is an extended logic program in whi...
148
Voted
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
When Genetic Programming is used to evolve arithmetic functions it often operates by composing them from a fixed collection of elementary operators and applying them to parameters...
142
Voted
TLCA
2009
Springer
15 years 10 months ago
2009
Springer
Types play an important role both in reasoning about Haskell and for its implementation. For example, the Glasgow Haskell Compiler performs certain fusion transformations that are...