Sciweavers

179 search results - page 12 / 36
» Lazy Evaluation for OCL
Sort
View
PLANX
2008
15 years 3 months ago
XML Stream Processing Using a Lazy Concurrent Language
Motivated by previous work on XML stream processing, we noticed that programmers need concurrency to save space, especially in a lazy language. User-controllable concurrency provi...
Shin-Cheng Mu, Ta-Chung Tsai, Keisuke Nakano
MICS
2008
108views more  MICS 2008»
15 years 1 months ago
Efficient Intensional Implementation for Lazy Functional Languages
The intensional transformation is a technique that can be used in order to eliminate higher-order functions from a functional program by introducing appropriate context manipulatio...
Angelos Charalambidis, Athanasios Grivas, Nikolaos...
CIKM
2006
Springer
15 years 5 months ago
Multi-evidence, multi-criteria, lazy associative document classification
We present a novel approach for classifying documents that combines different pieces of evidence (e.g., textual features of documents, links, and citations) transparently, through...
Adriano Veloso, Wagner Meira Jr., Marco Cristo, Ma...
WIDM
2006
ACM
15 years 7 months ago
Lazy preservation: reconstructing websites by crawling the crawlers
Backup of websites is often not considered until after a catastrophic event has occurred to either the website or its webmaster. We introduce “lazy preservation” – digital p...
Frank McCown, Joan A. Smith, Michael L. Nelson
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
15 years 6 months ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
Olaf Chitil