3221 search results - page 366 / 645 » Termination of Linear Programs |
131
click to vote
CC
2010
Springer
16 years 1 months ago
2010
Springer
Compilers use register coalescing to avoid generating code for copy instructions. For architectures with register aliasing such as x86, Smith, Ramsey, and Holloway (2004) presented...
168
click to vote
POPL
2003
ACM
15 years 11 months ago
2003
ACM
First-class continuations are a powerful computational effect, allowing the programmer to express any form of jumping. Types and effect systems can be used to reason about contin...
142
click to vote
AGP
1999
IEEE
15 years 11 months ago
1999
IEEE
We study the problem of an efficient and precise sharing analysis of (constraint) logic programs. After recognizing that neither aring nor its non-redundant (but equivalent) abstra...
208
click to vote
ICS
1999
Tsinghua U.
15 years 10 months ago
1999
Tsinghua U.
On modern computers, the performance of programs is often limited by memory latency rather than by processor cycle time. To reduce the impact of memory latency, the restructuring ...
172
click to vote
SCP
2010
15 years 5 months ago
2010
Over the past two decades, Scheme macros have evolved into a powerful API for the compiler front-end. Like Lisp macros, their predecessors, Scheme macros expand source programs in...