All Fields
Computer Science
Medicine
FAQ
Contact
Sign in
Thunk
Known as:
Suspended evaluation
, Suspended computation
, Thunking
Â
(More)
In computer programming, a thunk is a subroutine that is created, often automatically, to assist a call to another subroutine. Thunks are primarily…Â
(More)
Wikipedia
Topic mentions per year
Topic mentions per year
1961-2017
0
2
4
6
1961
2017
Related topics
Related topics
35 relations
.NET Framework
16-bit
32-bit
ALGOL 60
(More)
Broader (1)
Functional programming
Related mentions per year
Related mentions per year
1936-2018
1940
1960
1980
2000
2020
Thunk
Compiler
Modular programming
Virtual machine
C++
Microsoft Windows
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Thunk recycling for lazy functional languages: operational semantics and correctness
Yasunao Takano
,
Hideya Iwasaki
SAC
2015
Lazy evaluation helps programmers write clear programs. However, it has significant run-time overheads for building many as-yet…Â
(More)
Is this relevant?
1998
1998
Efficient Interprocedural Data Placement Optimisation in a Parallel Library
Olav Beckmann
,
Paul H. J. Kelly
LCR
1998
This paper describes a combination of methods which make interprocedural data placement optimisation available to parallel…Â
(More)
Is this relevant?
1998
1998
Data Distribution at Run-Time: Re-using Execution Plans
Olav Beckmann
,
Paul H. J. Kelly
Euro-Par
1998
This paper shows how data placement optimisation techniques which are normally only found in optimising compilers can be made…Â
(More)
Is this relevant?
1995
1995
Thunk Lifting: Reducing Heap Usage in an Implementation of a Lazy Functional Language
A. Reza Haydarlou
,
Pieter H. Hartel
Journal of Functional and Logic Programming
1995
Thunk-lifting is a program transformation for lazy functional programs. The transformation aims at reducing the amount of heap…Â
(More)
Is this relevant?
1994
1994
Constraint-Based Categorial Grammar
Gosse Bouma
,
Gertjan van Noord
ArXiv
1994
We propose a generalization of Categorial Grammar in which lexical categories are defined by means of recursive constraints. In…Â
(More)
Is this relevant?
1993
1993
Thunks and the λ-Calculus
John Hatcliff
,
Olivier Danvy
1993
Thirty-five years ago, thunks were used to simulate call-by-name under call-by-value in Algol 60. Twenty years ago, Plotkin…Â
(More)
Is this relevant?
1993
1993
The Implementation of Nyquist, A Sound Synthesis Language
Roger B. Dannenberg
ICMC
1993
Nyquist is a functional language for sound synthesis with an efficient implementation. It is shown how various language features…Â
(More)
Is this relevant?
1992
1992
Thunks (Continued)
Olivier Danvy
,
John Hatcliff
WSA
1992
Call-by-name can be simulated in a call-by-value setting using \thunks" (i.e., parameterless procedures) or continuation-passing…Â
(More)
Is this relevant?
1980
1980
Delayed evaluation trees and their application to sementics (Additif)
Egidio Astesiano
,
Gerardo Costa
CLAAP
1980
Â
Is this relevant?
Highly Cited
1978
Highly Cited
1978
Compilation and Delayed Evaluation in APL
Leonidas J. Guibas
,
Douglas K. Wyatt
POPL
1978
Most existing APL implementations are interpretive in nature,that is, each time an APL statement is encountered it is executedby…Â
(More)
Is this relevant?