What is a 'thunk', as used in Scheme or in general?
up vote
53
down vote
favorite
I come across the word 'thunk' at a lot of places in code and documentation related to Scheme, and similar territories. I am guessing that it is a generic name for a procedure, which has a single formal argument. Is that correct? If yes, is there more to it? If no, please?
For eg. in SRFI 18, in the 'Procedures' section.
programming-languages functional-programming scheme
add a comment |
up vote
53
down vote
favorite
I come across the word 'thunk' at a lot of places in code and documentation related to Scheme, and similar territories. I am guessing that it is a generic name for a procedure, which has a single formal argument. Is that correct? If yes, is there more to it? If no, please?
For eg. in SRFI 18, in the 'Procedures' section.
programming-languages functional-programming scheme
1
possible duplicate of What is a 'thunk'?
– Stephan
May 13 '14 at 9:09
add a comment |
up vote
53
down vote
favorite
up vote
53
down vote
favorite
I come across the word 'thunk' at a lot of places in code and documentation related to Scheme, and similar territories. I am guessing that it is a generic name for a procedure, which has a single formal argument. Is that correct? If yes, is there more to it? If no, please?
For eg. in SRFI 18, in the 'Procedures' section.
programming-languages functional-programming scheme
I come across the word 'thunk' at a lot of places in code and documentation related to Scheme, and similar territories. I am guessing that it is a generic name for a procedure, which has a single formal argument. Is that correct? If yes, is there more to it? If no, please?
For eg. in SRFI 18, in the 'Procedures' section.
programming-languages functional-programming scheme
programming-languages functional-programming scheme
asked May 29 '09 at 10:35
user59634
1
possible duplicate of What is a 'thunk'?
– Stephan
May 13 '14 at 9:09
add a comment |
1
possible duplicate of What is a 'thunk'?
– Stephan
May 13 '14 at 9:09
1
1
possible duplicate of What is a 'thunk'?
– Stephan
May 13 '14 at 9:09
possible duplicate of What is a 'thunk'?
– Stephan
May 13 '14 at 9:09
add a comment |
3 Answers
3
active
oldest
votes
up vote
64
down vote
accepted
It is really simple. When you have some computation, like adding 3 to 5, in your program, then creating a thunk of it means not to calculate it directly, but instead create a function with zero arguments that will calculate it when the actual value is needed.
(let ((foo (+ 3 5))) ; the calculation is performed directly, foo is 8
;; some other things
(display foo)) ; foo is evaluated to 8 and printed
(let ((foo (lambda () (+ 3 5)))) ; the calculation is delayed, foo is a
; function that will perform it when needed
;; some other things
(display (foo))) ; foo is evaluated as a function, returns 8 which is printed
In the second case, foo would be called a thunk.
Lazy languages blur the line between binding a variable to a value and creating a function to return that value, so that writing something like the first form above is actually treated like the second, under the hood.
answered May 29 '09 at 11:10
Svante
38.8k662109
1
Scheme is not a lazy language, right? (in 'Overview of Scheme' in r6rs). So, iff I create a think, like above, it will create a lazy evaluation scenario?
– user59634
May 29 '09 at 15:09
1
^ s/think/thunk/ (my bad)
– user59634
May 29 '09 at 15:09
1
Please look at the link kotlinski (stackoverflow.com/questions/925365/…) provided for how Scheme implements a lazy evaluation scheme.
– Svante
May 29 '09 at 15:59
1
Yes. I did. However, my query here was: Will creating a lambda as above delay the evaluation in a non-Lazy language like Scheme?
– user59634
May 30 '09 at 11:17
1
Yes, of course. Why shouldn't it? Lazy just means that you don't have to do this explicitly, like the above.
– Svante
May 30 '09 at 11:48
|
show 4 more comments
up vote
36
down vote
A "thunk" is a procedure object with no formal arguments, e.g. from your SRFI link:
(lambda () (write '(b1)))
The b1 variable is bound in the enclosing block, and this gives us a clue to the etymology of the word "thunk," which relies on a joke about poor grammar.
A zero-argument function has no way to change its behavior based on parameters it is called with, since it has no parameters. Therefore the entire operation of the function is set -- it is just waiting to be executed. No more "thought" is required on the part of the computer, all of the "thinking" has been done -- the action is completely "thunk" through.
That's all a "thunk" is in this SRFI's context -- a procedure with no arguments.
edited May 20 '17 at 18:13
Koneke
1017
answered May 29 '09 at 11:23
Steven Huwig
12.1k74976
6
Thanks for explaining why it is called a "thunk"
– mynameistechno
Apr 22 '15 at 16:16
add a comment |
up vote
13
down vote
Wikipedia has the following answer:
In functional programming, "thunk" is another name for a nullary function — a function that takes no arguments. Thunks are frequently used in strict languages as a means of simulating lazy evaluation; the thunk itself delays the computation of a function's argument, and the function forces the thunk to obtain the actual value. In this context, a thunk is often called a suspension or (in Scheme) a promise.
Adding a lazy evaluation example in Scheme. Here, promise is another word for thunk.
edited Nov 10 at 13:32
antoine
557
answered May 29 '09 at 10:36
Johan Kotlinski
18.5k66294
4
Thank You. I am looking for something better. Wikipedia doesn't explain things and concepts I really want to know.
– user59634
May 29 '09 at 10:37
1
@Amit -- I assume you commented before the question was updated with the quote. This is the exact answer to your question.
– tvanfosson
May 29 '09 at 10:41
1
@tvanfosson probablty it was edited after the original post. @kotlinski will it be possible to demonstrate it somehow?
– user59634
May 29 '09 at 10:47
1
OK, added an example... This is also explained well in Paradigms of Artificial Intelligence Programming by Peter Norvig (examine delay/force examples).
– Johan Kotlinski
May 29 '09 at 11:11
1
'force' and 'delay' seems to have been removed from the R6RS.
– user59634
May 30 '09 at 11:12
|
show 1 more comment
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
64
down vote
accepted
It is really simple. When you have some computation, like adding 3 to 5, in your program, then creating a thunk of it means not to calculate it directly, but instead create a function with zero arguments that will calculate it when the actual value is needed.
(let ((foo (+ 3 5))) ; the calculation is performed directly, foo is 8
;; some other things
(display foo)) ; foo is evaluated to 8 and printed
(let ((foo (lambda () (+ 3 5)))) ; the calculation is delayed, foo is a
; function that will perform it when needed
;; some other things
(display (foo))) ; foo is evaluated as a function, returns 8 which is printed
In the second case, foo would be called a thunk.
Lazy languages blur the line between binding a variable to a value and creating a function to return that value, so that writing something like the first form above is actually treated like the second, under the hood.
answered May 29 '09 at 11:10
Svante
38.8k662109
1
Scheme is not a lazy language, right? (in 'Overview of Scheme' in r6rs). So, iff I create a think, like above, it will create a lazy evaluation scenario?
– user59634
May 29 '09 at 15:09
1
^ s/think/thunk/ (my bad)
– user59634
May 29 '09 at 15:09
1
Please look at the link kotlinski (stackoverflow.com/questions/925365/…) provided for how Scheme implements a lazy evaluation scheme.
– Svante
May 29 '09 at 15:59
1
Yes. I did. However, my query here was: Will creating a lambda as above delay the evaluation in a non-Lazy language like Scheme?
– user59634
May 30 '09 at 11:17
1
Yes, of course. Why shouldn't it? Lazy just means that you don't have to do this explicitly, like the above.
– Svante
May 30 '09 at 11:48
|
show 4 more comments
up vote
64
down vote
accepted
It is really simple. When you have some computation, like adding 3 to 5, in your program, then creating a thunk of it means not to calculate it directly, but instead create a function with zero arguments that will calculate it when the actual value is needed.
(let ((foo (+ 3 5))) ; the calculation is performed directly, foo is 8
;; some other things
(display foo)) ; foo is evaluated to 8 and printed
(let ((foo (lambda () (+ 3 5)))) ; the calculation is delayed, foo is a
; function that will perform it when needed
;; some other things
(display (foo))) ; foo is evaluated as a function, returns 8 which is printed
In the second case, foo would be called a thunk.
Lazy languages blur the line between binding a variable to a value and creating a function to return that value, so that writing something like the first form above is actually treated like the second, under the hood.
answered May 29 '09 at 11:10
Svante
38.8k662109
1
Scheme is not a lazy language, right? (in 'Overview of Scheme' in r6rs). So, iff I create a think, like above, it will create a lazy evaluation scenario?
– user59634
May 29 '09 at 15:09
1
^ s/think/thunk/ (my bad)
– user59634
May 29 '09 at 15:09
1
Please look at the link kotlinski (stackoverflow.com/questions/925365/…) provided for how Scheme implements a lazy evaluation scheme.
– Svante
May 29 '09 at 15:59
1
Yes. I did. However, my query here was: Will creating a lambda as above delay the evaluation in a non-Lazy language like Scheme?
– user59634
May 30 '09 at 11:17
1
Yes, of course. Why shouldn't it? Lazy just means that you don't have to do this explicitly, like the above.
– Svante
May 30 '09 at 11:48
|
show 4 more comments
up vote
64
down vote
accepted
up vote
64
down vote
accepted
It is really simple. When you have some computation, like adding 3 to 5, in your program, then creating a thunk of it means not to calculate it directly, but instead create a function with zero arguments that will calculate it when the actual value is needed.
(let ((foo (+ 3 5))) ; the calculation is performed directly, foo is 8
;; some other things
(display foo)) ; foo is evaluated to 8 and printed
(let ((foo (lambda () (+ 3 5)))) ; the calculation is delayed, foo is a
; function that will perform it when needed
;; some other things
(display (foo))) ; foo is evaluated as a function, returns 8 which is printed
In the second case, foo would be called a thunk.
Lazy languages blur the line between binding a variable to a value and creating a function to return that value, so that writing something like the first form above is actually treated like the second, under the hood.
answered May 29 '09 at 11:10
Svante
38.8k662109
It is really simple. When you have some computation, like adding 3 to 5, in your program, then creating a thunk of it means not to calculate it directly, but instead create a function with zero arguments that will calculate it when the actual value is needed.
(let ((foo (+ 3 5))) ; the calculation is performed directly, foo is 8
;; some other things
(display foo)) ; foo is evaluated to 8 and printed
(let ((foo (lambda () (+ 3 5)))) ; the calculation is delayed, foo is a
; function that will perform it when needed
;; some other things
(display (foo))) ; foo is evaluated as a function, returns 8 which is printed
In the second case, foo would be called a thunk.
Lazy languages blur the line between binding a variable to a value and creating a function to return that value, so that writing something like the first form above is actually treated like the second, under the hood.
answered May 29 '09 at 11:10
Svante
38.8k662109
answered May 29 '09 at 11:10
Svante
38.8k662109
answered May 29 '09 at 11:10
Svante
38.8k662109
answered May 29 '09 at 11:10
Svante
38.8k662109
38.8k662109
1
Scheme is not a lazy language, right? (in 'Overview of Scheme' in r6rs). So, iff I create a think, like above, it will create a lazy evaluation scenario?
– user59634
May 29 '09 at 15:09
1
^ s/think/thunk/ (my bad)
– user59634
May 29 '09 at 15:09
1
Please look at the link kotlinski (stackoverflow.com/questions/925365/…) provided for how Scheme implements a lazy evaluation scheme.
– Svante
May 29 '09 at 15:59
1
Yes. I did. However, my query here was: Will creating a lambda as above delay the evaluation in a non-Lazy language like Scheme?
– user59634
May 30 '09 at 11:17
1
Yes, of course. Why shouldn't it? Lazy just means that you don't have to do this explicitly, like the above.
– Svante
May 30 '09 at 11:48
|
show 4 more comments
1
Scheme is not a lazy language, right? (in 'Overview of Scheme' in r6rs). So, iff I create a think, like above, it will create a lazy evaluation scenario?
– user59634
May 29 '09 at 15:09
1
^ s/think/thunk/ (my bad)
– user59634
May 29 '09 at 15:09
1
Please look at the link kotlinski (stackoverflow.com/questions/925365/…) provided for how Scheme implements a lazy evaluation scheme.
– Svante
May 29 '09 at 15:59
1
Yes. I did. However, my query here was: Will creating a lambda as above delay the evaluation in a non-Lazy language like Scheme?
– user59634
May 30 '09 at 11:17
1
Yes, of course. Why shouldn't it? Lazy just means that you don't have to do this explicitly, like the above.
– Svante
May 30 '09 at 11:48
1
1
Scheme is not a lazy language, right? (in 'Overview of Scheme' in r6rs). So, iff I create a think, like above, it will create a lazy evaluation scenario?
– user59634
May 29 '09 at 15:09
Scheme is not a lazy language, right? (in 'Overview of Scheme' in r6rs). So, iff I create a think, like above, it will create a lazy evaluation scenario?
– user59634
May 29 '09 at 15:09
1
1
^ s/think/thunk/ (my bad)
– user59634
May 29 '09 at 15:09
^ s/think/thunk/ (my bad)
– user59634
May 29 '09 at 15:09
1
1
Please look at the link kotlinski (stackoverflow.com/questions/925365/…) provided for how Scheme implements a lazy evaluation scheme.
– Svante
May 29 '09 at 15:59
Please look at the link kotlinski (stackoverflow.com/questions/925365/…) provided for how Scheme implements a lazy evaluation scheme.
– Svante
May 29 '09 at 15:59
1
1
Yes. I did. However, my query here was: Will creating a lambda as above delay the evaluation in a non-Lazy language like Scheme?
– user59634
May 30 '09 at 11:17
Yes. I did. However, my query here was: Will creating a lambda as above delay the evaluation in a non-Lazy language like Scheme?
– user59634
May 30 '09 at 11:17
1
1
Yes, of course. Why shouldn't it? Lazy just means that you don't have to do this explicitly, like the above.
– Svante
May 30 '09 at 11:48
Yes, of course. Why shouldn't it? Lazy just means that you don't have to do this explicitly, like the above.
– Svante
May 30 '09 at 11:48
|
show 4 more comments
up vote
36
down vote
A "thunk" is a procedure object with no formal arguments, e.g. from your SRFI link:
(lambda () (write '(b1)))
The b1 variable is bound in the enclosing block, and this gives us a clue to the etymology of the word "thunk," which relies on a joke about poor grammar.
A zero-argument function has no way to change its behavior based on parameters it is called with, since it has no parameters. Therefore the entire operation of the function is set -- it is just waiting to be executed. No more "thought" is required on the part of the computer, all of the "thinking" has been done -- the action is completely "thunk" through.
That's all a "thunk" is in this SRFI's context -- a procedure with no arguments.
edited May 20 '17 at 18:13
Koneke
1017
answered May 29 '09 at 11:23
Steven Huwig
12.1k74976
6
Thanks for explaining why it is called a "thunk"
– mynameistechno
Apr 22 '15 at 16:16
add a comment |
up vote
36
down vote
A "thunk" is a procedure object with no formal arguments, e.g. from your SRFI link:
(lambda () (write '(b1)))
The b1 variable is bound in the enclosing block, and this gives us a clue to the etymology of the word "thunk," which relies on a joke about poor grammar.
A zero-argument function has no way to change its behavior based on parameters it is called with, since it has no parameters. Therefore the entire operation of the function is set -- it is just waiting to be executed. No more "thought" is required on the part of the computer, all of the "thinking" has been done -- the action is completely "thunk" through.
That's all a "thunk" is in this SRFI's context -- a procedure with no arguments.
edited May 20 '17 at 18:13
Koneke
1017
answered May 29 '09 at 11:23
Steven Huwig
12.1k74976
6
Thanks for explaining why it is called a "thunk"
– mynameistechno
Apr 22 '15 at 16:16
add a comment |
up vote
36
down vote
up vote
36
down vote
A "thunk" is a procedure object with no formal arguments, e.g. from your SRFI link:
(lambda () (write '(b1)))
The b1 variable is bound in the enclosing block, and this gives us a clue to the etymology of the word "thunk," which relies on a joke about poor grammar.
A zero-argument function has no way to change its behavior based on parameters it is called with, since it has no parameters. Therefore the entire operation of the function is set -- it is just waiting to be executed. No more "thought" is required on the part of the computer, all of the "thinking" has been done -- the action is completely "thunk" through.
That's all a "thunk" is in this SRFI's context -- a procedure with no arguments.
edited May 20 '17 at 18:13
Koneke
1017
answered May 29 '09 at 11:23
Steven Huwig
12.1k74976
A "thunk" is a procedure object with no formal arguments, e.g. from your SRFI link:
(lambda () (write '(b1)))
The b1 variable is bound in the enclosing block, and this gives us a clue to the etymology of the word "thunk," which relies on a joke about poor grammar.
A zero-argument function has no way to change its behavior based on parameters it is called with, since it has no parameters. Therefore the entire operation of the function is set -- it is just waiting to be executed. No more "thought" is required on the part of the computer, all of the "thinking" has been done -- the action is completely "thunk" through.
That's all a "thunk" is in this SRFI's context -- a procedure with no arguments.
edited May 20 '17 at 18:13
Koneke
1017
answered May 29 '09 at 11:23
Steven Huwig
12.1k74976
edited May 20 '17 at 18:13
Koneke
1017
edited May 20 '17 at 18:13
Koneke
1017
edited May 20 '17 at 18:13
Koneke
1017
1017
answered May 29 '09 at 11:23
Steven Huwig
12.1k74976
answered May 29 '09 at 11:23
Steven Huwig
12.1k74976
answered May 29 '09 at 11:23
Steven Huwig
12.1k74976
12.1k74976
6
Thanks for explaining why it is called a "thunk"
– mynameistechno
Apr 22 '15 at 16:16
add a comment |
6
Thanks for explaining why it is called a "thunk"
– mynameistechno
Apr 22 '15 at 16:16
6
6
Thanks for explaining why it is called a "thunk"
– mynameistechno
Apr 22 '15 at 16:16
Thanks for explaining why it is called a "thunk"
– mynameistechno
Apr 22 '15 at 16:16
add a comment |
up vote
13
down vote
Wikipedia has the following answer:
In functional programming, "thunk" is another name for a nullary function — a function that takes no arguments. Thunks are frequently used in strict languages as a means of simulating lazy evaluation; the thunk itself delays the computation of a function's argument, and the function forces the thunk to obtain the actual value. In this context, a thunk is often called a suspension or (in Scheme) a promise.
Adding a lazy evaluation example in Scheme. Here, promise is another word for thunk.
edited Nov 10 at 13:32
antoine
557
answered May 29 '09 at 10:36
Johan Kotlinski
18.5k66294
4
Thank You. I am looking for something better. Wikipedia doesn't explain things and concepts I really want to know.
– user59634
May 29 '09 at 10:37
1
@Amit -- I assume you commented before the question was updated with the quote. This is the exact answer to your question.
– tvanfosson
May 29 '09 at 10:41
1
@tvanfosson probablty it was edited after the original post. @kotlinski will it be possible to demonstrate it somehow?
– user59634
May 29 '09 at 10:47
1
OK, added an example... This is also explained well in Paradigms of Artificial Intelligence Programming by Peter Norvig (examine delay/force examples).
– Johan Kotlinski
May 29 '09 at 11:11
1
'force' and 'delay' seems to have been removed from the R6RS.
– user59634
May 30 '09 at 11:12
|
show 1 more comment
up vote
13
down vote
Wikipedia has the following answer:
In functional programming, "thunk" is another name for a nullary function — a function that takes no arguments. Thunks are frequently used in strict languages as a means of simulating lazy evaluation; the thunk itself delays the computation of a function's argument, and the function forces the thunk to obtain the actual value. In this context, a thunk is often called a suspension or (in Scheme) a promise.
Adding a lazy evaluation example in Scheme. Here, promise is another word for thunk.
edited Nov 10 at 13:32
antoine
557
answered May 29 '09 at 10:36
Johan Kotlinski
18.5k66294
4
Thank You. I am looking for something better. Wikipedia doesn't explain things and concepts I really want to know.
– user59634
May 29 '09 at 10:37
1
@Amit -- I assume you commented before the question was updated with the quote. This is the exact answer to your question.
– tvanfosson
May 29 '09 at 10:41
1
@tvanfosson probablty it was edited after the original post. @kotlinski will it be possible to demonstrate it somehow?
– user59634
May 29 '09 at 10:47
1
OK, added an example... This is also explained well in Paradigms of Artificial Intelligence Programming by Peter Norvig (examine delay/force examples).
– Johan Kotlinski
May 29 '09 at 11:11
1
'force' and 'delay' seems to have been removed from the R6RS.
– user59634
May 30 '09 at 11:12
|
show 1 more comment
up vote
13
down vote
up vote
13
down vote
Wikipedia has the following answer:
In functional programming, "thunk" is another name for a nullary function — a function that takes no arguments. Thunks are frequently used in strict languages as a means of simulating lazy evaluation; the thunk itself delays the computation of a function's argument, and the function forces the thunk to obtain the actual value. In this context, a thunk is often called a suspension or (in Scheme) a promise.
Adding a lazy evaluation example in Scheme. Here, promise is another word for thunk.
edited Nov 10 at 13:32
antoine
557
answered May 29 '09 at 10:36
Johan Kotlinski
18.5k66294
Wikipedia has the following answer:
In functional programming, "thunk" is another name for a nullary function — a function that takes no arguments. Thunks are frequently used in strict languages as a means of simulating lazy evaluation; the thunk itself delays the computation of a function's argument, and the function forces the thunk to obtain the actual value. In this context, a thunk is often called a suspension or (in Scheme) a promise.
Adding a lazy evaluation example in Scheme. Here, promise is another word for thunk.
edited Nov 10 at 13:32
antoine
557
answered May 29 '09 at 10:36
Johan Kotlinski
18.5k66294
edited Nov 10 at 13:32
antoine
557
edited Nov 10 at 13:32
antoine
557
edited Nov 10 at 13:32
antoine
557
557
answered May 29 '09 at 10:36
Johan Kotlinski
18.5k66294
answered May 29 '09 at 10:36
Johan Kotlinski
18.5k66294
answered May 29 '09 at 10:36
Johan Kotlinski
18.5k66294
18.5k66294
4
Thank You. I am looking for something better. Wikipedia doesn't explain things and concepts I really want to know.
– user59634
May 29 '09 at 10:37
1
@Amit -- I assume you commented before the question was updated with the quote. This is the exact answer to your question.
– tvanfosson
May 29 '09 at 10:41
1
@tvanfosson probablty it was edited after the original post. @kotlinski will it be possible to demonstrate it somehow?
– user59634
May 29 '09 at 10:47
1
OK, added an example... This is also explained well in Paradigms of Artificial Intelligence Programming by Peter Norvig (examine delay/force examples).
– Johan Kotlinski
May 29 '09 at 11:11
1
'force' and 'delay' seems to have been removed from the R6RS.
– user59634
May 30 '09 at 11:12
|
show 1 more comment
4
Thank You. I am looking for something better. Wikipedia doesn't explain things and concepts I really want to know.
– user59634
May 29 '09 at 10:37
1
@Amit -- I assume you commented before the question was updated with the quote. This is the exact answer to your question.
– tvanfosson
May 29 '09 at 10:41
1
@tvanfosson probablty it was edited after the original post. @kotlinski will it be possible to demonstrate it somehow?
– user59634
May 29 '09 at 10:47
1
OK, added an example... This is also explained well in Paradigms of Artificial Intelligence Programming by Peter Norvig (examine delay/force examples).
– Johan Kotlinski
May 29 '09 at 11:11
1
'force' and 'delay' seems to have been removed from the R6RS.
– user59634
May 30 '09 at 11:12
4
4
Thank You. I am looking for something better. Wikipedia doesn't explain things and concepts I really want to know.
– user59634
May 29 '09 at 10:37
Thank You. I am looking for something better. Wikipedia doesn't explain things and concepts I really want to know.
– user59634
May 29 '09 at 10:37
1
1
@Amit -- I assume you commented before the question was updated with the quote. This is the exact answer to your question.
– tvanfosson
May 29 '09 at 10:41
@Amit -- I assume you commented before the question was updated with the quote. This is the exact answer to your question.
– tvanfosson
May 29 '09 at 10:41
1
1
@tvanfosson probablty it was edited after the original post. @kotlinski will it be possible to demonstrate it somehow?
– user59634
May 29 '09 at 10:47
@tvanfosson probablty it was edited after the original post. @kotlinski will it be possible to demonstrate it somehow?
– user59634
May 29 '09 at 10:47
1
1
OK, added an example... This is also explained well in Paradigms of Artificial Intelligence Programming by Peter Norvig (examine delay/force examples).
– Johan Kotlinski
May 29 '09 at 11:11
OK, added an example... This is also explained well in Paradigms of Artificial Intelligence Programming by Peter Norvig (examine delay/force examples).
– Johan Kotlinski
May 29 '09 at 11:11
1
1
'force' and 'delay' seems to have been removed from the R6RS.
– user59634
May 30 '09 at 11:12
'force' and 'delay' seems to have been removed from the R6RS.
– user59634
May 30 '09 at 11:12
|
show 1 more comment
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f925365%2fwhat-is-a-thunk-as-used-in-scheme-or-in-general%23new-answer', 'question_page');
);
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
1
possible duplicate of What is a 'thunk'?
– Stephan
May 13 '14 at 9:09