Control flow (English Wikipedia)

Knuth, Donald Ervin (1997). Fundamental Algorithms (PDF). The Art of Computer Programming. Vol. 1 (3rd ed.). Addison-Wesley. Section 1.4.5: History and Bibliography, pp. 229. ISBN 978-0-201-89683-1. Archived (PDF) from the original on 2019-10-21.

books.google.com (Global: 3^rd place; English: 3^rd place)

Anthony Ralston (2000). Encyclopedia of computer science. Nature Pub. Group. ISBN 978-1-56159-248-7. Retrieved 11 May 2013.

c-faq.com (Global: low place; English: low place)

comp.lang.c FAQ list · "Question 20.20b"

c2.com (Global: low place; English: low place)

wiki.c2.com

"Messy Loop Conditions". WikiWikiWeb. 2014-11-03.

cern.ch (Global: 2,552^nd place; English: 2,008^th place)

cds.cern.ch

Zahn, C. T. "A control statement for natural top-down structured programming" presented at Symposium on Programming Languages, Paris, 1974.

cornell.edu (Global: 308^th place; English: 253^rd place)

cs.cornell.edu

Kozen, Dexter (2008). "The Böhm–Jacopini Theorem is False, Propositionally". Mathematics of Program Construction (PDF). Lecture Notes in Computer Science. Vol. 5133. pp. 177–192. CiteSeerX 10.1.1.218.9241. doi:10.1007/978-3-540-70594-9_11. ISBN 978-3-540-70593-2. {{cite book}}: Cite uses deprecated parameter |citeseerx= (help)

darkreading.com (Global: low place; English: low place)

"Adobe Flash Bug Discovery Leads To New Attack Mitigation Method". Dark Reading. 10 November 2015. Retrieved 2016-06-01.

doi.org (Global: 2^nd place; English: 2^nd place)

Knuth, Donald E. (1974). "Structured Programming with go to Statements". Computing Surveys. 6 (4): 261–301. CiteSeerX 10.1.1.103.6084. doi:10.1145/356635.356640. S2CID 207630080. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Kozen, Dexter (2008). "The Böhm–Jacopini Theorem is False, Propositionally". Mathematics of Program Construction (PDF). Lecture Notes in Computer Science. Vol. 5133. pp. 177–192. CiteSeerX 10.1.1.218.9241. doi:10.1007/978-3-540-70594-9_11. ISBN 978-3-540-70593-2. {{cite book}}: Cite uses deprecated parameter |citeseerx= (help)
Conway, Melvin E. (July 1963). "Design of a Separable Transition-diagram Compiler" (PDF). Communications of the ACM. 6 (7). ACM: 396–408. doi:10.1145/366663.366704. ISSN 0001-0782. S2CID 10559786. Archived (PDF) from the original on 2022-04-06. Retrieved 2019-10-21 – via ACM Digital Library.
Modell, Howard; Slater, William (April 1978). "Structured programming considered harmful". ACM SIGPLAN Notices. 13 (4): 76–79. doi:10.1145/953411.953418. Retrieved 18 July 2014.

forth.com (Global: low place; English: low place)

"6. Throw It For a Loop".

fortran.com (Global: low place; English: low place)

Clarke, Lawrence, "We don't know where to GOTO if we don't know where we've COME FROM. This linguistic innovation lives up to all expectations.", Datamation (article), archived from the original on 2018-07-16, retrieved 2004-09-24.

geeksforgeeks.org (Global: low place; English: low place)

"Nested Loops in C with Examples". GeeksforGeeks. 2019-11-25. Retrieved 2024-03-14.

gnu.org (Global: 1,901^st place; English: 1,743^rd place)

"3.2.5.1 Looping Constructs", The GNU Bash Reference Manual, 2025-05-18
"3.2.4 Lists of Commands", The GNU Bash Reference Manual, 2025-05-18

lispworks.com (Global: low place; English: low place)

"Common Lisp LOOP macro".

medium.com (Global: 651^st place; English: 479^th place)

Dean, Jenna (2019-11-22). "Nested Loops". The Startup. Retrieved 2024-03-14.

megacpptutorials.com (Global: low place; English: low place)

"What is a loop and how we can use them?". Archived from the original on 2020-07-28. Retrieved 2020-05-25.

melconway.com (Global: low place; English: low place)

Conway, Melvin E. (July 1963). "Design of a Separable Transition-diagram Compiler" (PDF). Communications of the ACM. 6 (7). ACM: 396–408. doi:10.1145/366663.366704. ISSN 0001-0782. S2CID 10559786. Archived (PDF) from the original on 2022-04-06. Retrieved 2019-10-21 – via ACM Digital Library.

modell.com (Global: low place; English: low place)

Modell, Howard; Slater, William (April 1978). "Structured programming considered harmful". ACM SIGPLAN Notices. 13 (4): 76–79. doi:10.1145/953411.953418. Retrieved 18 July 2014.

nebelwelt.net (Global: low place; English: low place)

Payer, Mathias; Kuznetsov, Volodymyr. "On differences between the CFI, CPS, and CPI properties". nebelwelt.net. Retrieved 2016-06-01.

okmij.org (Global: low place; English: low place)

Kiselyov, Oleg (January 2004). "General ways to traverse collections in Scheme".

open-std.org (Global: 7,079^th place; English: 5,042^nd place)

"named-loops". open-std.org. 18 September 2024.
"Information technology — Programming languages — C" (PDF). open-std.org. 4 May 2025.

perl.org (Global: low place; English: low place)

perldoc.perl.org

"redo - perldoc.perl.org". perldoc.perl.org. Retrieved 2020-09-25.
perldoc: last

php.net (Global: 8,178^th place; English: 7,970^th place)

PHP Manual: "break"

prnewswire.com (Global: 546^th place; English: 310^th place)

Endgame. "Endgame to Present at Black Hat USA 2016". www.prnewswire.com (Press release). Retrieved 2016-06-01.

psu.edu (Global: 299^th place; English: 159^th place)

citeseerx.ist.psu.edu

Knuth, Donald E. (1974). "Structured Programming with go to Statements". Computing Surveys. 6 (4): 261–301. CiteSeerX 10.1.1.103.6084. doi:10.1145/356635.356640. S2CID 207630080. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Kozen, Dexter (2008). "The Böhm–Jacopini Theorem is False, Propositionally". Mathematics of Program Construction (PDF). Lecture Notes in Computer Science. Vol. 5133. pp. 177–192. CiteSeerX 10.1.1.218.9241. doi:10.1007/978-3-540-70594-9_11. ISBN 978-3-540-70593-2. {{cite book}}: Cite uses deprecated parameter |citeseerx= (help)

python.org (Global: 4,399^th place; English: 3,941^st place)

mail.python.org

[Python-3000] Announcing PEP 3136, Guido van Rossum

ruby-lang.org (Global: low place; English: low place)

docs.ruby-lang.org

"control_expressions - Documentation for Ruby 2.4.0". docs.ruby-lang.org. Retrieved 2020-09-25.
"control_expressions - Documentation for Ruby 2.3.0". docs.ruby-lang.org. Retrieved 2020-09-25.

semanticscholar.org (Global: 15^th place; English: 8^th place)

api.semanticscholar.org

Knuth, Donald E. (1974). "Structured Programming with go to Statements". Computing Surveys. 6 (4): 261–301. CiteSeerX 10.1.1.103.6084. doi:10.1145/356635.356640. S2CID 207630080. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Conway, Melvin E. (July 1963). "Design of a Separable Transition-diagram Compiler" (PDF). Communications of the ACM. 6 (7). ACM: 396–408. doi:10.1145/366663.366704. ISSN 0001-0782. S2CID 10559786. Archived (PDF) from the original on 2022-04-06. Retrieved 2019-10-21 – via ACM Digital Library.

sgi.com (Global: low place; English: low place)

for_each. Sgi.com. Retrieved on 2010-11-09.

snarky.ca (Global: low place; English: low place)

"How the heck does async/await work in Python 3.5?". Tall, Snarky Canadian. 2016-02-11. Archived from the original on 2023-01-10. Retrieved 2023-01-10.

sourceforge.net (Global: 1,842^nd place; English: 1,520^th place)

boost-sandbox.sourceforge.net

Chapter 1. Boost.Foreach Archived 2010-01-29 at the Wayback Machine. Boost-sandbox.sourceforge.net (2009-12-19). Retrieved on 2010-11-09.

stackexchange.com (Global: 4,114^th place; English: 3,027^th place)

langdev.stackexchange.com

"How could a language make the loop-and-a-half less error-prone?". Stack Exchange: Programming Language Design and Implementation.

stackoverflow.com (Global: 9,249^th place; English: 6,951^st place)

stanford.edu (Global: 194^th place; English: 182^nd place)

cs.stanford.edu

Roberts, E. [1995] "Loop Exits and Structured Programming: Reopening the Debate Archived 2014-07-25 at the Wayback Machine," ACM SIGCSE Bulletin, (27)1: 268–272.

techtarget.com (Global: 3,908^th place; English: 3,051^st place)

whatis.techtarget.com

"What is infinite loop (endless loop)". Archived from the original on 2019-07-15. Retrieved 2020-01-22.

tldp.org (Global: low place; English: low place)

Advanced Bash Scripting Guide: 11.3. Loop Control

w3schools.com (Global: low place; English: low place)

"Python Nested Loops". www.w3schools.com. Retrieved 2024-03-14.

web.archive.org (Global: 1^st place; English: 1^st place)

Roberts, E. [1995] "Loop Exits and Structured Programming: Reopening the Debate Archived 2014-07-25 at the Wayback Machine," ACM SIGCSE Bulletin, (27)1: 268–272.
"Endless loop dictionary definition". Archived from the original on 2020-08-01. Retrieved 2020-01-22.
"What is infinite loop (endless loop)". Archived from the original on 2019-07-15. Retrieved 2020-01-22.
"What is a loop and how we can use them?". Archived from the original on 2020-07-28. Retrieved 2020-05-25.
Chapter 1. Boost.Foreach Archived 2010-01-29 at the Wayback Machine. Boost-sandbox.sourceforge.net (2009-12-19). Retrieved on 2010-11-09.
"How the heck does async/await work in Python 3.5?". Tall, Snarky Canadian. 2016-02-11. Archived from the original on 2023-01-10. Retrieved 2023-01-10.
Knuth, Donald Ervin (1997). Fundamental Algorithms (PDF). The Art of Computer Programming. Vol. 1 (3rd ed.). Addison-Wesley. Section 1.4.5: History and Bibliography, pp. 229. ISBN 978-0-201-89683-1. Archived (PDF) from the original on 2019-10-21.
Conway, Melvin E. (July 1963). "Design of a Separable Transition-diagram Compiler" (PDF). Communications of the ACM. 6 (7). ACM: 396–408. doi:10.1145/366663.366704. ISSN 0001-0782. S2CID 10559786. Archived (PDF) from the original on 2022-04-06. Retrieved 2019-10-21 – via ACM Digital Library.
Clarke, Lawrence, "We don't know where to GOTO if we don't know where we've COME FROM. This linguistic innovation lives up to all expectations.", Datamation (article), archived from the original on 2018-07-16, retrieved 2004-09-24.

worldcat.org (Global: 4^th place; English: 4^th place)

search.worldcat.org

Conway, Melvin E. (July 1963). "Design of a Separable Transition-diagram Compiler" (PDF). Communications of the ACM. 6 (7). ACM: 396–408. doi:10.1145/366663.366704. ISSN 0001-0782. S2CID 10559786. Archived (PDF) from the original on 2022-04-06. Retrieved 2019-10-21 – via ACM Digital Library.

yourdictionary.com (Global: 6,318^th place; English: 6,517^th place)

"Endless loop dictionary definition". Archived from the original on 2020-08-01. Retrieved 2020-01-22.

Control flow (English Wikipedia)

atariverse.com (Global: low place; English: low place)

seriouscomputerist.atariverse.com

books.google.com (Global: 3rd place; English: 3rd place)

c-faq.com (Global: low place; English: low place)

c2.com (Global: low place; English: low place)

wiki.c2.com

cern.ch (Global: 2,552nd place; English: 2,008th place)

cds.cern.ch

cornell.edu (Global: 308th place; English: 253rd place)

cs.cornell.edu

darkreading.com (Global: low place; English: low place)

doi.org (Global: 2nd place; English: 2nd place)

forth.com (Global: low place; English: low place)

fortran.com (Global: low place; English: low place)

geeksforgeeks.org (Global: low place; English: low place)

gnu.org (Global: 1,901st place; English: 1,743rd place)

lispworks.com (Global: low place; English: low place)

medium.com (Global: 651st place; English: 479th place)

megacpptutorials.com (Global: low place; English: low place)

melconway.com (Global: low place; English: low place)

modell.com (Global: low place; English: low place)

nebelwelt.net (Global: low place; English: low place)

okmij.org (Global: low place; English: low place)

open-std.org (Global: 7,079th place; English: 5,042nd place)

perl.org (Global: low place; English: low place)

perldoc.perl.org

php.net (Global: 8,178th place; English: 7,970th place)

prnewswire.com (Global: 546th place; English: 310th place)

psu.edu (Global: 299th place; English: 159th place)

citeseerx.ist.psu.edu

python.org (Global: 4,399th place; English: 3,941st place)

mail.python.org

ruby-lang.org (Global: low place; English: low place)

docs.ruby-lang.org

semanticscholar.org (Global: 15th place; English: 8th place)

api.semanticscholar.org

sgi.com (Global: low place; English: low place)

snarky.ca (Global: low place; English: low place)

sourceforge.net (Global: 1,842nd place; English: 1,520th place)

boost-sandbox.sourceforge.net

stackexchange.com (Global: 4,114th place; English: 3,027th place)

langdev.stackexchange.com

stackoverflow.com (Global: 9,249th place; English: 6,951st place)

stanford.edu (Global: 194th place; English: 182nd place)

cs.stanford.edu

techtarget.com (Global: 3,908th place; English: 3,051st place)

whatis.techtarget.com

tldp.org (Global: low place; English: low place)

w3schools.com (Global: low place; English: low place)

web.archive.org (Global: 1st place; English: 1st place)

worldcat.org (Global: 4th place; English: 4th place)

search.worldcat.org

yourdictionary.com (Global: 6,318th place; English: 6,517th place)

books.google.com (Global: 3^rd place; English: 3^rd place)

cern.ch (Global: 2,552^nd place; English: 2,008^th place)

cornell.edu (Global: 308^th place; English: 253^rd place)

doi.org (Global: 2^nd place; English: 2^nd place)

gnu.org (Global: 1,901^st place; English: 1,743^rd place)

medium.com (Global: 651^st place; English: 479^th place)

open-std.org (Global: 7,079^th place; English: 5,042^nd place)

php.net (Global: 8,178^th place; English: 7,970^th place)

prnewswire.com (Global: 546^th place; English: 310^th place)

psu.edu (Global: 299^th place; English: 159^th place)

python.org (Global: 4,399^th place; English: 3,941^st place)

semanticscholar.org (Global: 15^th place; English: 8^th place)

sourceforge.net (Global: 1,842^nd place; English: 1,520^th place)

stackexchange.com (Global: 4,114^th place; English: 3,027^th place)

stackoverflow.com (Global: 9,249^th place; English: 6,951^st place)

stanford.edu (Global: 194^th place; English: 182^nd place)

techtarget.com (Global: 3,908^th place; English: 3,051^st place)

web.archive.org (Global: 1^st place; English: 1^st place)

worldcat.org (Global: 4^th place; English: 4^th place)

yourdictionary.com (Global: 6,318^th place; English: 6,517^th place)