| Not really. Programming is very linear in all forms I know¹. 1. There's a start point. UNLWS has none. 2. There's a mandatory canonical traversal order of the text (the compiled instruction pointer, at base). UNLWS has none. 3. Structurally — i.e. even ignoring execution — it's mainly a tree, not a graph (parent class > child class > instance > function, e.g.). There are some parts that are directed graphs, like mix-ins and some RDBs. True multigraph structure is fairly rare. UNLWS is pervasively a fully connected multigraph with some directed edges (like irrealis). … Programming is, however, similar to UNLWS in that both are isomorphic to predicate calculus (e.g. functions, like UNLWS glyphs, are n-ary predicates). I think that's what you're probably catching on. It is an important feature… but I think you're missing the more essential nature of non-linearity. (It took me several years to grasp enough to start making UNLWS, so don't feel too chastised. It's a very difficult concept. :p) I believe that complex circuits (as in wiring) and flowcharts do have the non-linear nature, though. Perhaps it'd help to think of those? ¹ I don't know functional programming or constraint satisfaction systems. It's possible those are different. |