4257 search results - page 422 / 852 » The Logical Modularity of Programs |
176
click to vote
ICFP
2000
ACM
15 years 11 months ago
2000
ACM
We show that standard formulations of intersection type systems are unsound in the presence of computational effects, and propose a solution similar to the value restriction for ...
202
click to vote
POPL
2010
ACM
15 years 7 months ago
2010
ACM
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
172
click to vote
IISWC
2009
IEEE
16 years 1 months ago
2009
IEEE
—Communication traces are integral to performance modeling and analysis of parallel programs. However, execution on a large number of nodes results in a large trace volume that i...
319
click to vote
AI
2011
Springer
15 years 1 months ago
2011
Springer
An important question for the upcoming Semantic Web is how to best combine open world ontology languages, such as the OWL-based ones, with closed world rule-based languages. One o...
163
click to vote
ICLA
2009
Springer
16 years 1 months ago
2009
Springer
One of the surprising developments in the area of program verification is how ideas introduced by logicians in the early part of the 20th Century ended up yielding by the 21 Centu...