1020 search results - page 125 / 204 » Tight Semantics for Logic Programs |
107
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
We study restricted computation models related to the tree evaluation problem. The TEP was introduced in earlier work as a simple candidate for the (very) long term goal of separa...
101
click to vote
PEPM
2004
ACM
15 years 5 months ago
2004
ACM
We implement strength reduction and loop-invariant code motion by specializing instrumented interpreters; we define a novel program transformation that uses bisimulation to ident...
JAPLL
2007
14 years 11 months ago
2007
We investigate the notion of an execution architecture in the setting of the program algebra PGA, and distinguish two sorts of these: analytic architectures, designed for the purp...
200
click to vote
POPL
2006
ACM
16 years 5 days ago
2006
ACM
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
LPNMR
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. This paper studies computational issues related to the problem of reasoning about actions and change (RAC) by exploiting its link with the Answer Set Programming paradigm...