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 02:54

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:

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

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

US dollar falls as the MAGA takeover of the Fed takes shape - Forexlive | Forex News, Technical Analysis & Trading Tools

NOT DATA … BUT MEANING!

a b i 1 x []

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.

5 Drinks to Help You Debloat, According to Dietitians - EatingWell

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

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

+ for

What happened to the American Russell Bentley from Texas that was fighting for the pro-Russian commies?

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.

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

/ \ and ⁄ / | \

Are there any free websites or platforms where authors can promote their books and connect with readers who are interested in their work?

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

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