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: 01.07.2025 01:13

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?

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.

in structures, such as:

a b i 1 x []

Psyche keeps its date with an asteroid, but now it’s running in backup mode - Ars Technica

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

NOT DATA … BUT MEANING!

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

Fewer than 500 neurons are associated with the suppression of binge drinking, new research finds - Medical Xpress

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”.

/ \ and ⁄ / | \

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.

Nutritionists Reveal the Surprising Amount of Protein You Actually Need - AOL.com

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

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

+ for

Why is it that when the Democrats absolutely love everyone to be LGBTP, they don't even acknowledge that Barack Obama and his husband Big Mike are homosexual, and he is the first homosexual president of the USA?

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

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