3513 search results - page 377 / 703 » Super Logic Programs |
128
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
The paper presents a simple and concise proof of correctness of the magic transformation. We believe it may provide a useful example of formal reasoning about logic programs. The ...
150
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
This article introduces our new approach to program representation for genetic programming (GP). We replace the usual s-expression representation scheme by a strongly-typed ion-ba...
159
click to vote
ICFP
2010
ACM
15 years 4 months ago
2010
ACM
A wide range of computer programs, including compilers and theorem provers, manipulate data structures that involve names and binding. However, the design of programming idioms wh...
118
Voted
PASTE
2010
ACM
15 years 2 months ago
2010
ACM
Monitoring or profiling programs provides us with an understanding for its further improvement and analysis. Typically, for monitoring or profiling, the program is instrumented ...
217
click to vote
POPL
2003
ACM
16 years 3 months ago
2003
ACM
We show how to efficiently obtain linear a priori bounds on the heap space consumption of first-order functional programs. The analysis takes space reuse by explicit deallocation ...