Logo

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: 27.06.2025 01:14

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?

/ \ and ⁄ / | \

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

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

Bill Oram: Seriously, who is going to beat the Beavers? - OregonLive.com

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.

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

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.

5 symptoms of colon cancer that should not be ignored - Times of India

NOT DATA … BUT MEANING!

a b i 1 x []

in structures, such as:

Cooper Flagg has ‘the whole basketball world here at the tip of his fingers.’ Newport, Maine, couldn’t be prouder. - The Boston Globe

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

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

+ for

Should You Do Cardio or Weights First? We Finally Have an Answer. - ScienceAlert

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

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