von neumann programing lang; functional-level programing

von neumann programing lang; functional-level programing

Ok, today's Wikipedia learned me few things.

One is the term on neumann programnig lang http://www.yqcomputer.com/

effectively, that's those of C, C++, Java, sh, perl and the bunch of
garbage to no ends.

In short, on neumann programnig langare those modeled on computer
hardware. Namely, storage, control flow. (thus the bunch of garbage
such as memory address, pointers, file handle, (and, lisp's cons))

I find the discovery of this term very illuminating. I used to use
pages of words to describe the low-level ness that exhibit in these
stupid langs. The term on neumann programnig langgives a concise,
quotable, insight on why it is so.

Lets start to throw the jargon on neumann programnig languagein C,
C++, Java, Perl etc newsgroups. Seriously. It'll help educate society.

* * *

i also learned today, about what's called unctional-level
programing

http://www.yqcomputer.com/

hard to summarize in one sentence... but basically like functional
programing but with one characteristic formalism that sets it apart,
namely: creation of functions are limited to a particular set of
higher-order functions, and you cannot arbitrary birth functions (e.g.
the moronicity of lisp's macros).

The force of this particular formalism is that it makes it more
subject to mathematical analysis (and thus makes it more powerful and
flexible), similar to for example to the clear separation of features
in 2nd order logic from first order logic. Wikipedia said it best,
quote:

This restriction means that functions in FP are a module (generated
by the built-in functions) over the algebra of functional forms, and
are thus algebraically tractable. For instance, the general question
of equality of two functions is equivalent to the halting problem, and
is undecidable, but equality of two functions in FP is just equality
in the algebra, and thus (Backus imagines) easier.

Even today, many users of lambda style languages often misinterpret
Backus' function-level approach as a restrictive variant of the lambda
style, which is a de facto value-level style. In fact, Backus would
not have disagreed with the 'restrictive' accusation: he argued that
it was precisely due to such restrictions that a well-formed
mathematical space could arise, in a manner analogous to the way
structured programming limits programming to a restricted version of
all the control-flow possibilities available in plain, unrestricted
unstructured programs.

Xah
http://www.yqcomputer.com/

von neumann programing lang; functional-level programing

...
In short, on Neumann programnig langare those modeled on computer
hardware. Namely, storage and control flow. (thus the bunch of garbage
such as memory address, pointers, file handle (and lisp's cons).)

I find the discovery of this term very illuminating. I used to use
pages of words to describe the low-level ness that exhibit in these
stupid langs. The term on Neumann programnig langgives a concise,
quotable, insight on why it is so.
...

I have now extended a bit this essay, with a perm url at:
http://www.yqcomputer.com/

Another term similar to Von Neumann programing lang, is Imperative
programming though it captures the stupidity of these langs from a
different perspective. The concept in Von Neumann programing lang is a
better one because it gives insight on the origin of the stupidities
in this class of langs.

The opposite of Von Neumann programnig lang would be athematics
modeled languages Lisp, Haskell, Mathematica, APL, Prolog etc are
this class (in general called Declarative programinglanguages, in
contrast to imperative programing.).

A more communicative term for on Neumann programnig langshould be
computer hardware modeled languages, but of course that loses the
buzzword quality.

Lets start to throw the jargon on neumann programnig languagein C,
C++, Java, Perl etc forums. Seriously. It'll help benefit programing
community in the education aspect by raising awareness.

Xah
http://www.yqcomputer.com/

von neumann programing lang; functional-level programing

He had designs for better systems but died before he was able to impliment
them.

As for why he did it the way he did, please see:
http://www.yqcomputer.com/

http://www.yqcomputer.com/ 's_incompleteness_theorems

X

von neumann programing lang; functional-level programing

in newsgroup, one indication that the poster is some kinda of
sophomoronic idiot, is whether they mention such things as Godel's
theorem or turing complete.

Xah
http://www.yqcomputer.com/

X