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: 24.06.2025 04:07

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.

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

Decade after decade, century after century the Middle East has been a disaster for anyone thinking peace can be achieved. Would it not be better to just leave the Middle East to its own devices and everyone else stay out of it all?

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, […])

in structures, such as:

Has a psychic ever made a crazy prediction that turned out to be true?

NOT DATA … BUT MEANING!

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

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.

Can a cop pull you over walking home asking why you are out so late?

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

+ for

/ \ and ⁄ / | \

Archer Raises $850M Following White House Executive Order To Accelerate U.S. eVTOL Rollout, Cementing Its Industry-Leading Liquidity Position Of Approximately $2B - Business Wire

a b i 1 x []

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