265 search results - page 37 / 53 » Weakly Algebraizable Logics |
LOPSTR
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. Deforestation is a well-known program transformation technique which eliminates intermediate data structures that are passed between functions. One of its weaknesses is t...
SEMWEB
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. RDF may be considered as an application of XML intended to interoperably exchange semantics between Web applications. In its current form, this objective may be hard to r...
AUIC
2000
IEEE
14 years 1 months ago
2000
IEEE
Electronic Blocks are a new programming interface, designed for children aged between three and eight years. The Electronic Blocks programming environment includes sensor blocks, ...
AGP
1999
IEEE
14 years 28 days ago
1999
IEEE
We study the problem of an efficient and precise sharing analysis of (constraint) logic programs. After recognizing that neither aring nor its non-redundant (but equivalent) abstra...
HPCA
1999
IEEE
14 years 27 days ago
1999
IEEE
Cache coherence protocols of current shared-memory multiprocessors are difficult to verify. Our previous work proposed an extension of Lamport's logical clocks for showing th...