3983 search results - page 340 / 797 » Conceptual logic programs |
171
click to vote
OOPSLA
2010
Springer
15 years 5 months ago
2010
Springer
We propose a new way to raise the level of discourse in the programming process: permit ambiguity, but manage it by linking it to unambiguous examples. This allows programming env...
187
click to vote
PPDP
2007
Springer
16 years 22 days 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...
153
click to vote
ECOOP
2006
Springer
15 years 10 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...
153
click to vote
ENTCS
2007
15 years 6 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....
171
click to vote
NJC
2006
15 years 6 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...