8232 search results - page 131 / 1647 » Dynamic Logic Programming |
134
Voted
APLAS
2007
ACM
15 years 9 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...
150
Voted
LPNMR
2005
Springer
15 years 10 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...
160
click to vote
POPL
2010
ACM
16 years 2 months ago
2010
ACM
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
119
click to vote
FSTTCS
2007
Springer
15 years 11 months ago
2007
Springer
There are two somewhat contradictory ways of looking at modules in a given programming language. On the one hand, module systems are largely independent of the particulars of progr...