3481 search results - page 520 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
126
Voted
ICLP
2005
Springer
15 years 9 months ago
2005
Springer
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
142
click to vote
PLDI
2009
ACM
15 years 8 months ago
2009
ACM
Dynamic information flow policies, such as declassification, are essential for practically useful information flow control systems. However, most systems proposed to date that ...
128
Voted
PPDP
2009
Springer
15 years 8 months ago
2009
Springer
We present direct proofs of termination of evaluation for typed delimited-control operators shift and reset using a variant of Tait’s method with context-based reducibility pred...
139
Voted
MICRO
2000
IEEE
15 years 8 months ago
2000
IEEE
Value prediction breaks data dependencies in a program thereby creating instruction level parallelism that can increase program performance. Hardware based value prediction techni...
120
click to vote
PLILP
1992
Springer
15 years 7 months ago
1992
Springer
The unfold/fold framework constitutes the spine of many program transformation strategies. However, by unrestricted use of folding the target program may terminate less often than...