4370 search results - page 436 / 874 » Algebra of Logic Programming |
127
Voted
ICFP
2000
ACM
15 years 8 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 ...
133
Voted
POPL
2010
ACM
15 years 3 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 ...
122
Voted
ICFP
2003
ACM
16 years 3 months ago
2003
ACM
Program analysis is the heart of modern compilers. Most control flow analyses are reduced to the problem of finding a fixed point in a certain transition system, and such fixed po...
117
Voted
IISWC
2009
IEEE
15 years 10 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...
246
Voted
AI
2011
Springer
14 years 10 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...