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: 23.06.2025 03:41

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?

NOT DATA … BUT MEANING!

+ for

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

What role did China play in the signing of the "Beijing Declaration" between Fatah and Hamas? What other information is worth noting for talks among Palestinian factions in Beijing?

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.

a b 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.

If You Fit Into One Of These 6 Categories, You Should Be Taking Creatine - MindBodyGreen

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

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

/ \ and ⁄ / | \

What led Megan to marry into the Royal Family despite her successful acting career in Hollywood?

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

in structures, such as:

A Biologist Spotlights The World’s Most Aggressive Bird. Hint: It’s Flightless, It’s Not The Ostrich, And It’s Been Known To Kill People - Forbes

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

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