Ok, today's Wikipedia learned me few things.
One is the term on neumann programnig lang
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
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,
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