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: 01.07.2025 23: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?

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

+ for

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

Here's What Happens to Your Blood Pressure When You Eat Blueberries Every Day - AOL.com

/ \ and ⁄ / | \

in structures, such as:

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

Why would my ex block me after I blocked him?

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

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.

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.

Scarlett Johansson plants a big kiss on Jonathan Bailey — this time in front of husband Colin Jost - pagesix.com

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

a b i 1 x []

NOT DATA … BUT MEANING!

How can targeted individuals protect themselves from organized stalking? Have you discovered practical strategies?

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

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