Sciweavers

2696 search results - page 403 / 540
» Semantic Abstraction and Anaphora
Sort
View
ICDE
2008
IEEE
161views Database» more  ICDE 2008»
16 years 7 months ago
Efficiently Answering Probabilistic Threshold Top-k Queries on Uncertain Data
on Uncertain Data (Extended Abstract) Ming Hua Jian Pei Wenjie Zhang Xuemin Lin Simon Fraser University, Canada The University of New South Wales & NICTA {mhua, jpei}@cs.sfu.c...
Ming Hua, Jian Pei, Wenjie Zhang, Xuemin Lin
POPL
2009
ACM
16 years 7 months ago
Lazy evaluation and delimited control
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...
Ronald Garcia, Andrew Lumsdaine, Amr Sabry
ICFP
2008
ACM
16 years 6 months ago
Typed closure conversion preserves observational equivalence
Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in question. When programs are compiled into a different languag...
Amal Ahmed, Matthias Blume
ICFP
2002
ACM
16 years 6 months ago
Composing monads using coproducts
Monads are a useful abstraction of computation, as they model diverse computational effects such as stateful computations, exceptions and I/O in a uniform manner. Their potential ...
Christoph Lüth, Neil Ghani
VEE
2010
ACM
191views Virtualization» more  VEE 2010»
16 years 1 months ago
Multi-stage replay with crosscut
Deterministic record-replay has many useful applications, ranging from fault tolerance and forensics to reproducing and diagnosing bugs. When choosing a record-replay solution, th...
Jim Chow, Dominic G. Lucchetti, Tal Garfinkel, Geo...