1776 search results - page 195 / 356 » Using a Logic Programming Language with Persistence and Cont... |
109
Voted
PPDP
2001
Springer
15 years 8 months ago
2001
Springer
This paper explores the question of when two propagationbased constraint systems have the same behaviour, in terms of search space. We categorise the behaviour of domain and bound...
133
Voted
ENTCS
2002
15 years 3 months ago
2002
Declarative debugging has been proposed as a suitable technique for developing debuggers in the context of declarative languages. However, to become really useful debuggers must b...
152
click to vote
ESOP
2009
Springer
15 years 10 months ago
2009
Springer
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
124
Voted
APLAS
2005
ACM
15 years 9 months ago
2005
ACM
This paper presents a novel method to construct a dynamic single assignment (DSA) form of array-intensive, pointer-free C programs (or in any other procedural language). A program ...
116
Voted
BSL
2004
15 years 3 months ago
2004
This paper ties together much of the model theory of the last 50 years. Shelah's attempts to generalize the Morley theorem beyond first order logic led to the notion of excel...