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 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?

+ for

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 slogan that might help you get past the current fads is:

How viral 'limitless pill' affects the brain after doctors issue major warning over substance used by celebrities - LADbible

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

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

a b i 1 x []

Why does my narcissistic ex told me that he f*cked and sleep with other woman and then at the end says that it also happened because of me?

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.

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

NOT DATA … BUT MEANING!

What are some of the innovative strategies or "hacks" companies are using in 2024 to attract and hire top UI designers?

in structures, such as:

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

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

37 Hidden Gems On Amazon That’ll Make You Think “Where Have You Been All My Life?” - BuzzFeed

/ \ and ⁄ / | \

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