Difference between revisions of "Continuation tutorials timeline"

From HaskellWiki
Jump to navigation Jump to search
(Initial content)
 
m
 
(3 intermediate revisions by the same user not shown)
Line 1: Line 1:
 
[[Category:History]]
 
[[Category:History]]
  +
[[Category:Timelines]]
 
[[Category:Tutorials]]
 
[[Category:Tutorials]]
  +
   
 
This is a comprehensive timeline of continuation tutorials and related articles.
 
This is a comprehensive timeline of continuation tutorials and related articles.
   
 
Please update this list as it becomes outdated! If you find a tutorial, article, post, comment, or message that stands on its own as an explanation of continuations, then please take a moment to paste the link somewhere on this page (register a throwaway account, if you prefer). The date, author, and blurb can be added later. This will greatly help others who are using this list as a resource for learning about continuations.
 
Please update this list as it becomes outdated! If you find a tutorial, article, post, comment, or message that stands on its own as an explanation of continuations, then please take a moment to paste the link somewhere on this page (register a throwaway account, if you prefer). The date, author, and blurb can be added later. This will greatly help others who are using this list as a resource for learning about continuations.
  +
  +
__TOC__
  +
  +
<br>
  +
<font size="+1">
  +
“It is always possible for the [human] computer to
  +
break off from his work, to go away and forget all about it, and later to come
  +
back and go on with it. If he does this he must leave a note of instructions
  +
(written in some standard form) explaining how the work is to be continued.”
  +
</font>
  +
:[https://www.cs.virginia.edu/~robins/Turing_Paper_1936.pdf On Computable Numbers, with an Application to the <i>Entscheidungsproblem</i>], Alan M. Turing (page 253).
   
 
== year 2002 ==
 
== year 2002 ==
Line 66: Line 79:
   
 
* 2019-06 [http://www.sfu.ca/~tjd/383summer2019/scheme-cps.html Continuation Passing Style in Scheme]
 
* 2019-06 [http://www.sfu.ca/~tjd/383summer2019/scheme-cps.html Continuation Passing Style in Scheme]
:*"The continuation <tt>k</tt> contains the code that will be executed after <tt>(+ x y)</tt> is calculated."
+
*:"The continuation <tt>k</tt> contains the code that will be executed after <tt>(+ x y)</tt> is calculated."
   
 
* 2019-08 [https://ericnormand.me/podcast/what-is-a-continuation What is a continuation?] - Eric Normand
 
* 2019-08 [https://ericnormand.me/podcast/what-is-a-continuation What is a continuation?] - Eric Normand
:*"Continuations have to do with how functions are called and then returned."
+
*:"Continuations have to do with how functions are called and then returned."
   
 
== year 2020 ==
 
== year 2020 ==
Line 90: Line 103:
 
== year 2021 ==
 
== year 2021 ==
   
* 2021-01 [http://strangelyconsistent.org/blog/continuations-faq-epoq-diary-013 ontinuations FAQ (epoq diary 013)] - Carl Mäsak
+
* 2021-01 [http://strangelyconsistent.org/blog/continuations-faq-epoq-diary-013 Continuations FAQ (epoq diary 013)] - Carl Mäsak
 
*:"The continuation represents a running program at some point during its run."
 
*:"The continuation represents a running program at some point during its run."
   

Latest revision as of 12:05, 20 August 2024


This is a comprehensive timeline of continuation tutorials and related articles.

Please update this list as it becomes outdated! If you find a tutorial, article, post, comment, or message that stands on its own as an explanation of continuations, then please take a moment to paste the link somewhere on this page (register a throwaway account, if you prefer). The date, author, and blurb can be added later. This will greatly help others who are using this list as a resource for learning about continuations.


“It is always possible for the [human] computer to break off from his work, to go away and forget all about it, and later to come back and go on with it. If he does this he must leave a note of instructions (written in some standard form) explaining how the work is to be continued.”

On Computable Numbers, with an Application to the Entscheidungsproblem, Alan M. Turing (page 253).

year 2002

year 2004

year 2009

  • 2009-06 F#: Continuation Passing Style - Mark Needham
    "As I understand it we can achieve a continuation passing style of programming by passing in the bit of code that we went executed next (i.e. the continuation) as an argument to a function."

year 2010

year 2011

year 2012

year 2013

  • 2013-09 CS421: MP 4 – Continuation-Passing Style
    "A function that is written in continuation- passing style does not return once it has finished computing. Instead, it calls another function (the continuation) with the result of the computation."

year 2014

  • 2014-05 Why Are Continuations So Darn Cool? - Daniel Martins
    "A continuation can be viewed as the evaluation context surrounding an expression or, in other words, a snapshot of the current control state of the program."

year 2018

  • 2018-12 Removing a recursion in Python, part 2 - Eric Lippert
    "The “continuation” in “continuation passing style” just means “what happens after”; the code that happens after a bit of code is the continuation of that code in your program."

year 2019

  • 2019-08 What is a continuation? - Eric Normand
    "Continuations have to do with how functions are called and then returned."

year 2020

  • 2020-03 Continuations - Michael Erdmann
    "What is a continuation? A function, used as a parameter by another function, and typically used to abstract away from “the rest of the computation”, or “what to do to finish a task”."
  • 2020-09 Continuations - Ernesto Hernández-Novich
    "... a «continuation» is: some sort of snapshot of the current «interesting values» and immediate «next step»."

year 2021

  • 2021-03 Continuations in Scala
    "The main idea of continuations ... is the ability to interrupt a program, save its control state, and resume it at a later point in time."