For example, try thinking about what kinds of things this language would be useful for. Or if a similar visualization for an existing language would be useful. Unlock your mind and let it roam...
In case you didn't click the link in the article , here's part of what Wikipedia has to say:
"A funge is an esoteric programming language which models its programs as metric spaces with coordinate systems (often, but not necessarily, Cartesian) and which execute instructions located at points in their program space by moving an instruction pointer (a position vector which indicates the currently executing instruction) through that space."
Of note from the sample program, emphasis mine: "... this amazing program which calculates an approximation of pi literally by dividing a circular area by the radius twice. ... Naturally, a more accurate value can be obtained by using a bigger program."
There's some other amazing stuff there.
Ironically, Piet is, an RGB in the land of greyscale PICS. They broke the abstraction layers, mess up logic with implementation, introduce not just different kinds of colors but redundant and irrelevant dark colors and ruined the magic of "everything is an alpha value." Look what a classic two tone Hello World became.)
Anyone know when that's coming out?
Since when is being patented a virtue in programming language design?
Have to seen what passes for Enterprise Software Development tools? Netron Fusion uses Bassett Frame Technology to factor COBOL programs using techniques originally devised for representing knowledge ontologies in LISP-based AI systems.
COBOL + Lisp = $$$.
I don't know, MUMPS is used in production systems...
"Arrays: are created dynamically, stored as B-trees, are sparse (i.e. use almost no space for missing nodes), can use any number of subscripts, and subscripts can be strings or numeric (including floating point). Arrays are always automatically stored in sorted order, so there is never any occasion to sort, pack, reorder, or otherwise reorganize the database. Built in functions such as $DATA, $ORDER, $NEXT(deprecated) and $QUERY functions provide efficient examination and traversal of the fundamental array structure, on disk or in memory.
Local arrays: variable names not beginning with caret (i.e. "^") are stored in memory by process, are private to the creating process, expire when the creating process terminates. The available storage depends on implementation. For those implementations using partitions, it is limited to the partition size, (A small patition might be 32K). For other implementations, it may be several megabytes.
Global arrays: ^abc, ^def. These are stored on disk, are available to all processes, and are persistent when the creating process terminates. Very large globals (e.g., hundreds of gigabytes) are practical and efficient in most implementations. This is MUMPS' main "database" mechanism. It is used instead of calling on the operating system to create, write, and read files."
Kevin O'Kane was teaching MUMPS because (at the time) he had one of the only MUMPS compilers out there (translation to C++ and then compiled down)... Did a lot of work in textual indexing and searching (both medical data and genomics).
I really miss the B-Tree arrays...
It might be a punchline, but I'm writing code in it right now.