499 search results - page 82 / 100 » Logic Programming in a Fragment of Intuitionistic Linear Log... |
130
click to vote
ICFP
2002
ACM
16 years 4 months ago
2002
ACM
We present the type theory LTT, intended to form a basis for typed target languages, providing an internal notion of logical proposition and proof. The inclusion of explicit proof...
148
click to vote
SIGSOFT
2007
ACM
16 years 5 months ago
2007
ACM
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
223
click to vote
ICLP
2009
Springer
16 years 4 months ago
2009
Springer
The SLG-WAM of XSB Prolog soundly implements the Well-Founded Semantics (WFS) for logic programs, but in a few pathological cases its engine treats atoms as undefined that are true...
105
click to vote
ICLP
1999
Springer
15 years 8 months ago
1999
Springer
This paper presents a programming language that includes paradigms that are usually associated with declarative languages, such as sets, rules and search, into an imperative (funct...
253
click to vote
POPL
2004
ACM
16 years 4 months ago
2004
ACM
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...