12194 search results - page 87 / 2439 » cans 2010 |
ENDM
2000
13 years 8 months ago
2000
A graph is a 1-join composition if its vertex set can be partitioned into four nonempty sets AL; AR; SL and SR such that: every vertex of AL is adjacent to every vertex of AR; no ...
ENTCS
2000
13 years 8 months ago
2000
Haskell has long needed a debugger. Although there has been much research into the topic of debugging lazy functional programs, no robust tool has yet come from the Haskell commun...
ENTCS
2000
13 years 8 months ago
2000
Abstract. Logic programming languages based on linear logic are of both theoretical and practical interest, particulaly because such languages can be seen as providing a logical ba...
ENTCS
2000
13 years 8 months ago
2000
The coincidence between the model-theoretic and the procedural semantics of SLDresolution does not carry over to a Prolog system that also implements non-logical features like cut...
ECCC
2002
13 years 8 months ago
2002
We shall give simpler proofs of some lower bounds on monotone computations. We describe a simple condition on combinatorial structures, such that the rank of the matrix associated...