Talk:Structured concurrency: Difference between revisions

Content deleted Content added
Implementing WP:PIQA (Task 26)
Line 11:
 
The citations for Swift and Java sound like implementations of what was already established. Perhaps there should be a separate section enumerating implementations. [[User:Lucenty|Lucenty]] ([[User talk:Lucenty|talk]]) 11:37, 3 September 2022 (UTC)
 
== Structured concurrency has existed for at least 55 years ==
 
This article claims that structured concurrency was first proposed in 2016. It seems more accurate to say that structured concurrency is a very old idea that has had a recent resurgence in popularity.
 
Chapter 15 of the [http://bitsavers.org/pdf/ibm/360/pli/GC28-8201-4_PLI_F_Language_Reference_Dec72.pdf reference manual] for PL/I (F), a programming language from 1972, presents a multitasking system where a task can spawn attached subtasks. And in particular:
 
> When a task is terminated, any of its subtasks that are still active are
abnormally terminated.
 
Ada '83 has a similar feature. To quote the [http://archive.adaic.com/standards/83lrm/html/lrm-09-04.html#9.4 reference manual]:
 
> If a task has dependent tasks, its termination takes place when the execution of the task is completed and all dependent tasks are terminated. A block statement or subprogram body whose execution is completed is not left until all of its dependent tasks are terminated.
 
This Wikipedia article doesn't mention any of this '''very similar''' prior work. This seems like a major oversight. [[Special:Contributions/157.211.234.44|157.211.234.44]] ([[User talk:157.211.234.44|talk]]) 06:15, 3 July 2024 (UTC)