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: 24.06.2025 05:11

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?

/ \ and ⁄ / | \

NOT DATA … BUT MEANING!

in structures, such as:

Cisco Powers Secure Infrastructure for the AI Era - Cisco Newsroom

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

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.

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

NASA discovers that Earth's twin planet, Venus, is not geologically dead - Earth.com

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

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

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

How would you feel if your girlfriend had dick pics on her phone?

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

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

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.

Tune In to NAIC Get Wolfe Glick’s Incineroar and Other Special Gifts - Pokemon.com

+ for

a b i 1 x []