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: 03.07.2025 04:53

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?

in structures, such as:

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

a b i 1 x []

Carlos Alcaraz roars all the way back to win the French Open again - The Washington Post

NOT DATA … BUT MEANING!

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.

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

Why do democrats want to believe that Trump wasnt hit by a bullet in the rally? Dont they know that you cant load a sniper rifle with glass intead of bullets?

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

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.

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

Steelers Preferred Matthew Stafford, Justin Fields To Aaron Rodgers? - NFL Rumors - ProFootballRumors.com

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

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

+ for

Why can't the ISS take a picture of Earth and prove to the Flat Earth Society that Earth is not really flat?

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 ⁄ / | \