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: 26.06.2025 00:10

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.

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

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

ADHD link to severe premenstrual disorder uncovered in women - Medical Xpress

NOT DATA … BUT MEANING!

+ for

in structures, such as:

Wes Anderson’s Movies Ranked From Worst to Best - The Hollywood Reporter

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.

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

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

Urban Meyer Says Big Ten's Passed SEC, Small Schools Will Be 'Feeder' Programs For Top Teams - OutKick

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

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

a b i 1 x []

Why do most atheists in debates with theists take Bible verses out of context much of the time? Are they lying maliciously or do they not understand theology enough to understand the 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

/ \ and ⁄ / | \