Lazy evaluation

Known as: Lazy evalution, Lazy eval, Infinite lists 
In programming language theory, lazy evaluation, or call-by-need is an evaluation strategy which delays the evaluation of an expression until its… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Is it possible to maximize a monotone submodular function faster than the widely used lazy greedy algorithm (also known as… (More)
  • figure 1
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We describe a model checker for infinite-state sequential programs, based on Craig interpolation and the lazy abstraction… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2004
Highly Cited
2004
In this paper, we present Lazy Snapping, an interactive image cutout tool. Lazy Snapping separates coarse and fine scale… (More)
  • figure 2
  • figure 3
  • table 1
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
One approach to model checking software is based on the abstract-check-refine paradigm: build an abstract model, then check the… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
This paper describes a new approach t o probabilistic roadmap planners (PRMs). The overall theme of the algorithm, called Lazy… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
In this paper we present a junction tree based inference architecture exploiting the structure of the original Bayesian network… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1993
Highly Cited
1993
We define an operational semantics for lazy evaluation which provides an accurate model for sharing. The only computational… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Relaxed memory consistency models, such as release consistency, were introduced in order to reduce the impact of remote memory… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
1984
Highly Cited
1984
This paper describes the principles underlying an efficient implementation of a lazy functional language, compiling to code for… (More)
Is this relevant?
Highly Cited
1976
Highly Cited
1976
A different way to execute pure LISP programs is presented. It delays the evaluation of parameters and list structures without… (More)
Is this relevant?