Re: transpiling to low level C

Janis Papanagnou <janis_papanagnou+ng@hotmail.com> writes:

On 21.12.2024 02:28, Tim Rentsch wrote:

Janis Papanagnou <janis_papanagnou+ng@hotmail.com> writes:
 

On 16.12.2024 00:53, BGB wrote:
>

[...]
>
Pretty much all higher level control flow can be expressed via goto.

>
A 'goto' may be used but it isn't strictly *necessary*. What *is*
necessary, though, that is an 'if' (some conditional branch), and
either 'goto' or recursive functions.

 
Conditional branches, including 'if', '?:', etc., are not strictly
necessary either.

>
No? - Can you give an example of your statement?

I don't want to speak for Tim, but as far as I am concerned, it all
boils down to what you take to be a model of (effective) computation.
In some purely theoretical sense, models like the pure lambda calculus
and combinator calculus are "complete" and they have no specific
conditional "branches".

Going into detail (such as examples of making a "choice" in pure lambda
calculus) are way off topic here.

This is exactly what comp.theory should be used for, so I will cross
post there and set the followup-to header.  comp.theory has been trashed
by cranks but maybe a topical post will help it a but.

--
Ben.