43 search results - page 2 / 9 » An operational semantics for parallel lazy evaluation |
HPCC
2009
Springer
13 years 9 months ago
2009
Springer
Abstract--Transactional Memory (TM) is an emerging technology which promises to make parallel programming easier. However, to be efficient, underlying TM system should protect only...
POPL
2009
ACM
14 years 6 months ago
2009
ACM
The call-by-need lambda calculus provides an equational framework for reasoning syntactically about lazy evaluation. This paper examines its operational characteristics. By a seri...
PPDP
2000
Springer
13 years 9 months ago
2000
Springer
Identifying the source of space faults in functional programs is hard. The problem is compoundedas space usage can vary enormously from one implementation to another. We use a ter...
ICDE
2009
IEEE
14 years 17 days ago
2009
IEEE
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
ML
2008
ACM
13 years 5 months ago
2008
ACM
Call-by-value languages commonly restrict recursive definitions by only allowing functions and syntactically explicit values in the right-hand sides. As a consequence, some very a...