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 21:24

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 b i 1 x []

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

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.

What would happen if Trump and Putin make a Ukraine peace deal without Ukraine's consent?

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

in structures, such as:

/ \ and ⁄ / | \

3 Safe Ultra-High-Yield Dividend Stocks -- Sporting an Average Yield of 11.35% -- That Make for No-Brainer Buys in June - The Motley Fool

NOT DATA … BUT MEANING!

+ for

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

Musk Denies Ketamine Use Following New York Times Report - Bloomberg.com

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.

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

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

Which sunscreen is best for oily skin dot and key sunscreen or deconstruct gel sunscreen?

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

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