3 search results - page 1 / 1 » A Choice-Point Library for Backtrack Programming |
ICLP
1998
Springer
13 years 9 months ago
1998
Springer
Implementing a compiler for a language with nondeterministic features is known to be a difficult task. This paper presents two new functions setChoicePoint and fail that extend th...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Abstract. Logic Programming languages and combinational circuit synthesis tools share a common "combinatorial search over logic formulae" background. This paper attempts ...
ICFP
2003
ACM
14 years 4 months ago
2003
ACM
We present the derivation of a space efficient parser combinator library: the constructed parsers do not keep unnecessary references to the input, produce online results and effic...