FAQ

Thunk

Known as: Suspended evaluation, Suspended computation, Thunking 
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
024619612017

Related topics

Related topics

35 relations
.NET Framework16-bit32-bitALGOL 60
(More)

Broader (1)

Functional programming

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
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
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
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
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
Thunk-lifting is a program transformation for lazy functional programs. The transformation aims at reducing the amount of heap… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
Is this relevant?
1994
1994
Constraint-Based Categorial Grammar
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
Thirty-five years ago, thunks were used to simulate call-by-name under call-by-value in Algol 60. Twenty years ago, Plotkin… (More)
  • figure 1
  • figure 4
  • figure 7
  • figure 8
Is this relevant?
1993
1993
The Implementation of Nyquist, A Sound Synthesis Language
Nyquist is a functional language for sound synthesis with an efficient implementation. It is shown how various language features… (More)
  • figure 1
  • figure 2
  • figure 4
Is this relevant?
1992
1992
Thunks (Continued)
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)
 
Is this relevant?
Highly Cited
1978
Highly Cited
1978
Compilation and Delayed Evaluation in APL
Most existing APL implementations are interpretive in nature,that is, each time an APL statement is encountered it is executedby… (More)
  • figure 6.1
  • figure 8.1
Is this relevant?