3738 search results - page 540 / 748 » Parametrized Logic Programming |
103
Voted
ICLP
2005
Springer
15 years 6 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...
116
Voted
PLDI
2009
ACM
15 years 5 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 ...
105
Voted
PPDP
2009
Springer
15 years 5 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...
118
Voted
SARA
2009
Springer
15 years 5 months ago
2009
Springer
An important challenge in constraint programming is to rewrite constraint models into executable programs calculating the solutions. This phase of constraint processing may requir...
112
Voted
MICRO
2000
IEEE
15 years 5 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...