3481 search results - page 338 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
149
click to vote
PPDP
2007
Springer
15 years 11 months ago
2007
Springer
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...
123
click to vote
ENTCS
2007
15 years 4 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....
172
click to vote
AAMAS
2011
Springer
14 years 12 months ago
2011
Springer
We present a family of sound and complete logics for reasoning about deliberation strategies for SimpleAPL programs. SimpleAPL is a fragment of the agent programming language 3APL...
121
click to vote
ECOOP
2006
Springer
15 years 8 months ago
2006
Springer
A variety of application domains are interactive in nature: a primary task involves responding to external actions. In this paper, we introduce explicit programming language suppor...
136
Voted
NJC
2006
15 years 4 months ago
2006
Abstract. General purpose theorem provers provide advanced facilities for proving properties about specifications, and may therefore be a valuable tool in formal program developmen...