Sciweavers

161 search results - page 16 / 33
» Lazy call-by-value evaluation
Sort
View
MICS
2008
108views more  MICS 2008»
13 years 7 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
13 years 11 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...
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
13 years 11 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
ACSC
2004
IEEE
13 years 11 months ago
Homeless and Home-based Lazy Release Consistency Protocols on Distributed Shared Memory
This paper describes the comparison between homeless and home-based Lazy Release Consistency (LRC) protocols which are used to implement Distributed Shared Memory (DSM) in cluster...
Byung-Hyun Yu, Zhiyi Huang, Stephen Cranefield, Ma...
JUCS
2007
80views more  JUCS 2007»
13 years 7 months ago
Higher-Order Lazy Functional Slicing
: Program slicing is a well known family of techniques intended to identify and isolate code fragments which depend on, or are depended upon, specific program entities. This is pa...
Nuno F. Rodrigues, Luís Soares Barbosa