3470 search results - page 321 / 694 » Head-Elementary-Set-Free Logic Programs |
182
click to vote
ICLP
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination...
267
click to vote
SIGSOFT
2010
ACM
15 years 4 months ago
2010
ACM
We present an effective dynamic analysis for finding a broad class of deadlocks, including the well-studied lock-only deadlocks as well as the less-studied, but no less widespread...
288
click to vote
ICFP
2009
ACM
16 years 7 months ago
2009
ACM
We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a varian...
173
click to vote
PPDP
2007
Springer
16 years 23 days ago
2007
Springer
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...
180
click to vote
ICLP
2001
Springer
15 years 11 months ago
2001
Springer
We formally characterize alternating fixed points of boolean equation systems as models of (propositional) normal logic programs. To this end, we introduce the notion of a preferr...