What are your thoughts on a future where code is represented as a structured model, rather than text? Do you think that AI-powered coding assistants benefit from that?

Last Updated: 30.06.2025 19:15

What are your thoughts on a future where code is represented as a structured model, rather than text? Do you think that AI-powered coding assistants benefit from that?

These structures are made precisely to allow programs to “reason” about some parts of lower level meaning, and in many cases to rearrange the structure to preserve meaning but to make the eventual code that is generated more efficient.

+ for

Most coding assistants — with or without “modern “AI” — also do reasoning and manipulation of structures.

JPMorgan's Jamie Dimon Says U.S. Should Stockpile Missiles, Not Bitcoin - CoinDesk

NOT DATA … BUT MEANING!

A slogan that might help you get past the current fads is:

plus(a, b) for(i, 1, x, […])

Can I study a master’s in travel and tourism in Sweden within a budget of 5 lakhs INR?

Another canonical form could be Lisp S-expressions, etc.

a b i 1 x []

Long ago in the 50s this was even thought of as a kind of “AI” and this association persisted into the 60s. Several Turing Awards were given for progress on this kind of “machine reasoning”.

Why does having a college degree no longer carry the same prestige as before? People don't have the same respect for the educated.

It’s important to realize that “modern “AI” doesn’t understand human level meanings any better today (in many cases: worse!). So it is not going to be able to serve as much of a helper in a general coding assistant.

i.e. “operator like things” at the nodes …

/ \ and ⁄ / | \

At what point does trespassing become self defense? What are the necessary conditions for this line to be crossed from trespassing to self defense?

in structures, such as:

First, it’s worth noting that the “syntax recognition” phase of most compilers already does build a “structured model”, often in what used to be called a “canonical form” (an example of this might be a “pseudo-function tree” where every elementary process description is put into the same form — so both “a + b” and “for i := 1 to x do […]” are rendered as