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 07:00

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?

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

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.

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

23andMe Sets New Auction With $305 Million New Bid From Ex-CEO - Bloomberg

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.

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

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

What are the reasons why am I so tired before my period?

a b i 1 x []

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

/ \ and ⁄ / | \

Why does my iPhone keep on saying I can’t upload photos to iCloud and say it doesn't have enough iCloud storage when it still has space?

+ for

NOT DATA … BUT MEANING!

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

Everyone says the pet population is out of control. Everyone says you MUST spay or neuter your pets. No one wants to talk about how its almost $1,000 to spay or neuter a pet. Why is it so expensive if its so necessary? Animal shelters do it for free.

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