Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 229,705,272 papers from all fields of science
Search
Sign In
Create Free Account
Lazy evaluation
Known as:
Lazy evalution
, Lazy eval
, Infinite lists
Expand
In programming language theory, lazy evaluation, or call-by-need is an evaluation strategy which delays the evaluation of an expression until its…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
APL
Active updating
Apache Spark
Categorical abstract machine
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Modeling and evaluation of trust in cloud computing environments
Qiang Guo
,
Dawei Sun
,
G. Chang
,
Lina Sun
,
Xingwei Wang
American Control Conference
2011
Corpus ID: 16594152
Today, one of the most important factors for the success of cloud computing is to create trust and security. Cloud computing will…
Expand
Highly Cited
2007
Highly Cited
2007
Instace-Based AMN Classification for Improved Object Recognition in 2D and 3D Laser Range Data
Rudolph Triebel
,
Richard Schmidt
,
Óscar Martínez Mozos
,
Wolfram Burgard
International Joint Conference on Artificial…
2007
Corpus ID: 1973951
In this paper, we present an algorithm to identify different types of objects from 2D and 3D laser range data. Our method is a…
Expand
Highly Cited
2004
Highly Cited
2004
Duplicate Data Elimination in a SAN File System
Bo Hong
,
D. Plantenberg
,
D. Long
,
M. Sivan-Zimet
IEEE Conference on Mass Storage Systems and…
2004
Corpus ID: 12290109
Duplicate Data Elimination (DDE) is our method for identifying and coalescing identical data blocks in Storage Tank, a SAN file…
Expand
Highly Cited
2003
Highly Cited
2003
Strategies for Information Systems Evaluation : Six Generic Types
Stefan Cronholm
,
G. Goldkuhl
2003
Corpus ID: 11529140
The aim of this paper is to contribute to the decision of how to perform evaluation depending on the evaluation context. Three…
Expand
2002
2002
A fast maximum-likelihood decoder for convolutional codes
J. Feldman
,
I. Abou-Faycal
,
M. Frigo
Proceedings IEEE 56th Vehicular Technology…
2002
Corpus ID: 9783963
The lazy Viterbi decoder is a maximum-likelihood decoder for block and stream convolutional codes. For many codes of practical…
Expand
1991
1991
Operational Theories of Improvement in Functional Languages (Extended Abstract)
David Sands
Functional Programming
1991
Corpus ID: 189977
In this paper we address the technical foundations essential to the aim of providing a semantic basis for the formal treatment of…
Expand
1989
1989
A lazy cache algorithm
Y. Afek
,
Geoffrey M. Brown
,
Michael Merritt
ACM Symposium on Parallelism in Algorithms and…
1989
Corpus ID: 1244668
This paper examines cache consistency conditions (safety conditions) for multiprocessor shared memory systems. It states and…
Expand
Highly Cited
1987
Highly Cited
1987
Fixing some space leaks with a garbage collector
P. Wadler
Software, Practice & Experience
1987
Corpus ID: 12832197
Some functional programs may use more space than would be expected. A modification to the garbage collector is suggested which…
Expand
Highly Cited
1985
Highly Cited
1985
The humiliation of the word
J. Ellul
1985
Corpus ID: 144606847
Argues that visual reality has overcome verbal truth, examines the biblical distinction between truth and reality, and considers…
Expand
Highly Cited
1978
Highly Cited
1978
A Quantitative Study of the Orientation Bias of Some Edge Detector Schemes
E. Deutsch
,
J. Fram
IEEE transactions on computers
1978
Corpus ID: 33056281
Further work on the evaluation of a particular set of edge detection schemes is described. The orientational bias of these…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE