2236 search results - page 257 / 448 » Language Independence and Language Tolerance in Logic Progra... |
181
click to vote
DLT
2006
15 years 7 months ago
2006
Abstract. Boolean grammars [A. Okhotin, Information and Computation 194 (2004) 19-48] are a promising extension of context-free grammars that supports conjunction and negation. In ...
177
click to vote
SAC
2009
ACM
16 years 1 months ago
2009
ACM
This paper considers the length-lex domain for set-variables in constraint programming which includes not only membership but also cardinality and lexicographic information. The p...
171
click to vote
LOPSTR
2004
Springer
15 years 12 months ago
2004
Springer
We address the problem of an efficient rewriting strategy for general term rewriting systems. Several strategies have been proposed over the last two decades for rewriting, the mos...
168
click to vote
ENTCS
2007
15 years 6 months ago
2007
Many modern program verifiers translate the program to be verified and its specification into a simple intermediate representation and then compute verification conditions on ...
165
click to vote
TLDI
2009
ACM
16 years 3 months ago
2009
ACM
We propose a dependent type theory that integrates programming, specifications, and reasoning about higher-order concurrent programs with shared transactional memory. The design ...