7456 search results - page 136 / 1492 » Parallelism in Logic Programming |
125
click to vote
LPAR
1999
Springer
15 years 7 months ago
1999
Springer
In this work, we develop a partial evaluation technique for residuating functional logic programs, which generalize the concurrent computation models for logic programs with delays...
125
click to vote
PLDI
2012
ACM
13 years 5 months ago
2012
ACM
Parallel programs are known to be difficult to analyze. A key reason is that they typically have an enormous number of execution interleavings, or schedules. Static analysis over...
115
click to vote
APLAS
2007
ACM
15 years 7 months ago
2007
ACM
Abstract. This paper provides a call-by-name and a call-by-value calculus, both of which have a Curry-Howard correspondence to the minimal normal logic K. The calculi are extension...
130
click to vote
LPNMR
2005
Springer
15 years 8 months ago
2005
Springer
We investigate techniques for approximating answer sets of general logic programs of Lifschitz and Woo, whose rules have single literals as heads. We propose three different method...
117
click to vote
CONCUR
2004
Springer
15 years 8 months ago
2004
Springer
Existing spatial logics for concurrency are intensional, in the sense that they induce an equivalence that coincides with structural congruence. In this work, we study a contextual...