Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,975,792 papers from all fields of science
Search
Sign In
Create Free Account
Thunk
Known as:
Suspended evaluation
, Suspended computation
, Thunking
Expand
In computer programming, a thunk is a subroutine that is created, often automatically, to assist a call to another subroutine. Thunks are primarily…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
38 relations
.NET Framework
16-bit
32-bit
ALGOL 60
Expand
Broader (1)
Functional programming
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Compiling Functional Code for System-Level Environment
Miroslav Kratochvíl
Conference on Theory and Practice of Information…
2016
Corpus ID: 13928536
Compilation of programming languages based on λ–calculus to standalone, low-level machine code involves a challenge of removing…
Expand
2012
2012
Scalable Social Coordination using Enmeshed Queries
Jianjun Chen
,
Ashwin Machanavajjhala
,
G. Varghese
arXiv.org
2012
Corpus ID: 14705364
Social coordination allows users to move beyond awareness of their friends to efficiently coordinating physical activities with…
Expand
2011
2011
Cost Based Satisficing Search Considered Harmful
W. Cushing
,
J. Benton
,
S. Kambhampati
arXiv.org
2011
Corpus ID: 2090641
Recently, several researchers have found that cost-based satisficing search with A* often runs into problems. Although some "work…
Expand
2004
2004
Lazy Algorithms for Dynamic Closest Pair with Arbitary Distance Measures
J. Cardinal
,
D. Eppstein
ALENEX/ANALC
2004
Corpus ID: 12052489
We propose novel lazy algorithms for the dynamic closest pair problem with arbitrary distance measures. In this problem we have…
Expand
2002
2002
Lazy Time Reversal , and Automatic Differentiation
J. Karczmarczuk
2002
Corpus ID: 12728430
We show how to implement functionally the reverse, or adjoint strategy within the domain of Automatic Differentiation techniques…
Expand
2001
2001
Data integrity for mildly active content
H. Orman
Proceedings Third Annual International Workshop…
2001
Corpus ID: 33124294
Web pages are becoming more complicated, both in their appearance and in the underlying business models. Just as page composition…
Expand
1997
1997
Thunks and the-calculus ( extended version )
J. Hatcliff
,
O. Danvy
1997
Corpus ID: 15345018
Plotkin, in his seminal article Call-by-name, call-by-value and the λ-calculus, formalized evaluation strategies and simulations…
Expand
1997
1997
Disambiguating with Controlled Disjunctions
P. Blache
International Workshop/Conference on Parsing…
1997
Corpus ID: 1807586
In this paper, we propose a disambiguating technique called controlled disjunctions. This extension of the so-called named…
Expand
1995
1995
Minimal Forward Checking with Backmarking
A. Kwan
,
E. Tsang
1995
Corpus ID: 17148364
The idea behind forward checking is to check forward so that a wrong decision can be detected in early stage during search and…
Expand
1990
1990
CLG(n): Constraint Logic Grammars
S. Balari
,
G. B. Varile
,
L. Damas
,
Nelma Moreira
International Conference on Computational…
1990
Corpus ID: 10727846
CLG(2) is the latest member of a family of grammar formalisms centered around the notion of complex constraint expression for…
Expand