Editing Coroutine (section)

==References==
{{Reflist|refs=
<ref name="KnuthVol1_1_4_5">{{Cite book | first = Donald Ervin | last = Knuth | series = The Art of Computer Programming | volume = 1 | title = Fundamental Algorithms | edition = 3rd | publisher = Addison-Wesley | year = 1997| isbn = 978-0-201-89683-1 | at = Section 1.4.5: History and Bibliography, pp.&nbsp;229 | url = https://seriouscomputerist.atariverse.com/media/pdf/book/Art%20of%20Computer%20Programming%20-%20Volume%201%20(Fundamental%20Algorithms).pdf | url-status = live | archive-url = https://web.archive.org/web/20191021162138/https://seriouscomputerist.atariverse.com/media/pdf/book/Art%20of%20Computer%20Programming%20-%20Volume%201%20(Fundamental%20Algorithms).pdf | archive-date = 2019-10-21}}</ref> <!--pages = 229-->
<ref name="Conway1963">{{Cite journal|last=Conway|first=Melvin E.|author-link=Melvin Conway|date=July 1963|title=Design of a Separable Transition-diagram Compiler|url=http://melconway.com/Home/pdf/compiler.pdf|journal=[[Communications of the ACM]]|publisher=ACM|volume=6|issue=7|pages=396&ndash;408|doi=10.1145/366663.366704|s2cid=10559786|issn=0001-0782|via=ACM Digital Library|archive-date=2022-04-06|access-date=2019-10-21|archive-url=https://web.archive.org/web/20220406043438/http://melconway.com/Home/pdf/compiler.pdf|url-status=live}}</ref>
<ref name="KnuthVol1_1_4_2">{{Cite book | first = Donald Ervin | last = Knuth | series = The Art of Computer Programming | volume = 1 | title = Fundamental Algorithms | edition = 3rd | publisher = Addison-Wesley | year = 1997| isbn = 978-0-201-89683-1 | at = Section 1.4.2: Coroutines, pp.&nbsp;193–200}}</ref> <!--pages = 193–200-->
<ref name="EvolutionUnix">{{Cite book | first = Dennis M. | last = Ritchie | chapter = The evolution of the unix time-sharing system | series = Lecture Notes in Computer Science | title = Language Design and Programming Methodology | url = http://cm.bell-labs.com/cm/cs/who/dmr/hist.html | year = 1980 | volume = 79 | pages = 25–35 | doi = 10.1007/3-540-09745-7_2 | isbn = 978-3-540-09745-7 | s2cid = 571269 | access-date = 2011-01-26 | archive-date = 2015-04-08 | archive-url = https://web.archive.org/web/20150408054606/http://cm.bell-labs.com/cm/cs/who/dmr/hist.html }}</ref>
<ref name="Perlis1982_6">{{Cite journal
| last1 = Perlis | first1 = Alan J.
| doi = 10.1145/947955.1083808
| title = Epigrams on programming
| journal = ACM SIGPLAN Notices
| volume = 17
| issue = 9
| pages = 7–13
|date=September 1982
| s2cid = 20512767
| url = http://www-pu.informatik.uni-tuebingen.de/users/klaeren/epigrams.html
| archive-url = https://web.archive.org/web/19990117034445/http://www-pu.informatik.uni-tuebingen.de/users/klaeren/epigrams.html
| archive-date = January 17, 1999
| quote = 6. Symmetry is a complexity reducing concept (co-routines include sub-routines); seek it everywhere
| doi-access = free
}}</ref>
<ref name="MertzIBM">{{cite web|url=http://www.ibm.com/developerworks/library/l-pygen.html |title=Generator-based State Machines |work=Charming Python |first=David |last=Mertz |publisher=IBM developerWorks |date=July 1, 2002 |access-date=Feb 2, 2011 |archive-url=https://web.archive.org/web/20090228140658/http://www.ibm.com/developerworks/library/l-pygen.html |archive-date=February 28, 2009 }}</ref>
}}