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: 02.07.2025 09:19

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?

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

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

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.

Charlize Theron Calls Out Immigration Policies That Have “Destroyed the Lives of Families, Not Criminals” - The Hollywood Reporter

in structures, such as:

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.

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

Why are Republican politicians so afraid to oppose Trump?

+ for

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

/ \ and ⁄ / | \

What should I be looking for when trying out running shoes? Local store lets me try the shoe and jog up and down the block, but they mostly feel the same to me. Is there some feeling or anything else specific I should be looking for?

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

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

Astronomers discover 15 new giant radio galaxies — the largest single objects in the universe - Space

NOT DATA … BUT MEANING!

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