3441 search results - page 352 / 689 » Parallel Logic Programming Systems |
150
click to vote
CSL
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
136
click to vote
SAS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. In this paper we investigate the existence of a deductive veri cation method based on a logic that describes pointer aliasing. The main idea of such a method is that the ...
156
click to vote
ICFP
2008
ACM
16 years 4 months ago
2008
ACM
ML modules provide hierarchical namespace management, as well as fine-grained control over the propagation of type information, but they do not allow modules to be broken up into ...
153
click to vote
ICFP
2007
ACM
16 years 4 months ago
2007
ACM
There has been much work in recent years on extending ML with recursive modules. One of the most difficult problems in the development of such an extension is the double vision pr...
172
click to vote
MCMASTER
1993
15 years 8 months ago
1993
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...