Content deleted Content added
→History: no need for Turing's middle initial |
m Reverted edit by 192.145.175.229 (talk) to last version by Chatul |
||
(3 intermediate revisions by 3 users not shown) | |||
Line 148:
== Features ==
{{uncited section|date=August 2025}}
In general, a callable unit is a list of instructions that, starting at the first instruction, executes sequentially except as directed via its internal logic. It can be invoked (called) many times during the [[Execution (computing)|execution]] of a program. Execution continues at the next instruction after the call instruction when it [[Return statement|returns]] control.
Line 593 ⟶ 594:
* [[Functional programming]]
* [[Fused operation]]
* [[Generator (computer programming)]]
* [[Intrinsic function]]
* [[Lambda function (computer programming)]], a function that is not bound to an identifier
|