Difference between revisions of "Continuation"
Jump to navigation
Jump to search
| Line 3: | Line 3: | ||
<noinclude> | <noinclude> | ||
==Related Pages== | ==Related Pages== | ||
*[[ | *[[Category:Self reflection]] | ||
*[[ | *[[Category:Recursion]] | ||
*[[ | *[[Category:Fixed point]] | ||
*[[ | *[[Category:Monad]] | ||
</noinclude> | </noinclude> | ||
Revision as of 16:12, 21 February 2022
Continuation(Q1128903) (续体) is an abstract representation of the control state of a computer program. This is an idea closely associated with Dana Scott and other theoretical computing scientists. It is also related to fixed point, recursion, and the possibility of applying continuation to many contexts requires to use of monad.