351 search results - page 41 / 71 » Logic Programs with Compiled Preferences |
ENTCS
2007
13 years 8 months ago
2007
A compiler optimization is sound if the optimized program that it produces is semantically equivalent to the input program. The proofs of semantic equivalence are usually tedious....
ICLP
2011
Springer
13 years 5 days ago
2011
Springer
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...
CONCUR
1991
Springer
14 years 8 days ago
1991
Springer
Abstract. A syntax-directed formal system for the development of totally correct programs with respect to an (unfair) shared-state parallel programming language is proposed. The pr...
INTENV
2010
13 years 3 months ago
2010
We explore a coherent combination of two jointly implemented logic programming based systems, namely those of Evolution Prospection and Intention Recognition, to address a number o...
POPL
2009
ACM
14 years 9 months ago
2009
ACM
In this paper, we show how pattern matching can be seen to arise from a proof term assignment for the focused sequent calculus. This use of the Curry-Howard correspondence allows ...