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: 29.06.2025 02:10

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?

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 []

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

Can anyone show a photo with a penis in their anus?

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

/ \ and ⁄ / | \

NOT DATA … BUT MEANING!

New model helps to figure out which distant planets may host life - Space

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

in structures, such as:

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.

How do I write a character’s physical description without it feeling unnatural and clunky? I’m able to describe their hair and body relatively easily because my writing puts emphasis on small movements and fidgeting, but I can’t describe faces.

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

+ for

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

Weekend Box Office: LILO & STITCH Stays on Top as BALLERINA Opens to $25M - boxofficepro.com

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

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