Difference between revisions of "Continuation"
Jump to navigation
Jump to search
(Created page with "Continuation is an idea closely associated with Dana Scott and other theoretical computing scientists. It is also related to fixed point, recursion, and monad.") |
|||
| (6 intermediate revisions by one other user not shown) | |||
| Line 1: | Line 1: | ||
Continuation is an idea closely associated with Dana Scott and other theoretical computing scientists. It is also related to [[fixed point]], [[recursion]], and [[monad]]. | {{WikiEntry|key=Continuation|qCode=1128903}} (续体) 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]], [[network]] connections<ref>{{:Book/Patterns in Network Architecture}}</ref>, and the possibility of applying continuation to many contexts requires to use of [[monad]]. | ||
<noinclude> | |||
==Related Pages== | |||
[[Category:Self reflection]] | |||
[[Category:Recursion]] | |||
[[Category:Fixed point]] | |||
[[Category:Monad]] | |||
</noinclude> | |||
Latest revision as of 02:40, 25 February 2023
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, network connections[1], and the possibility of applying continuation to many contexts requires to use of monad.
Related Pages
- ↑ Day, John (2008). Patterns in Network Architecture - a return to fundamentals. local page: Prentice Hall. ISBN 9780132252423.