Befunge is a stack-based esoteric programminglanguage which differs from conventional languages in that programs are arranged on a two-dimensional grid.
Program execution which exceeds these limits "wraps around" to a corresponding point on the other side of the grid; a Befunge program is in this manner topologically equivalent to a torus.
Since a Befunge-93 program can only have a single stack and its storage array is bounded, the Befunge-93 language is, like most machine languages, not Turing-complete.
Befreak is a purely reversible two-dimensional programminglanguage.
This is a natural phenomenon in reversible programming, since if we were running the loop backwards, we need to know at what point we are done so we can "exit" the loop (through the entrance).
Befreak also has "l", which checks to see if the second item is less than the first item, and if so toggles the top item on the control stack.
Befunge is a two-dimensional esoteric programminglanguage invented in 1993 by Chris Pressey with the goal of being as difficult to compile as possible.
Because Befunge-93 programs are given an explicit limit of 80x25 cells on the size of their playfield, but are also given a working stack, any Befunge-93 program should be simulatable by a push-down automaton.
Most of the languages are not similar enough to be called direct descendants, but often the author mentions the influence of Befunge in the accompanying commentary.
Befunge is a stack-based, reflective, esoteric programminglanguage.
The Befunge-93 specification restricts each valid program to a grid of 80 instructions horizontally by 25 instructions vertically.
The later Funge-98 specification provides Turing-completeness by removing the size restrictions on the program; rather than wrapping around at a fixed limit, the movement of a Funge-98 instruction pointer follows a model dubbed "Lahey-space" after its originator, Chris Lahey.
Befunge(Site not responding. Last check: 2007-10-11)
Thus, since a Befunge-93 program can only have a single stack and its storage array is bounded, the original Befunge-93 language is not Turing-complete.
The later Funge-98 extensions provide Turing-completeness by adding the concept of "modes," including a "queue mode" in which certain instructions are redefined to make the data stack into a queue.
Funge-98 programs can also be of unbounded extent; rather than wrapping around at the 80-column mark, a Funge-98 instruction pointer will obey the wrapping rules of what Chris Pressey has dubbed "Lahey-space," a model in which the grid behaves like a torus but still allows arbitrary expansion of the "active" grid area.
To break away from that argument and return to the idea of non-traditional-text-based programming, another semi-interesting possibility that is to have a 2D version of emoticon (another recent addition to the esolang webring) - a sort of ascii-art language where 2D pictures of size {x,y} processed a certain function.
The language is still self-modifiable, and to account for this, the syntax for reading and writing code to the program space has been altered.
Modular programming is all well and good for the Real World, but some of the most interesting esolangs (IMHO) are ones which specifically make modularity difficult (LazyK, Malbolge, HomeSpring) because they focus on a method of program writing so fundamentally different from the standard that it's a damn near psychedelic experience learning to program them.
TYPO3developer: CMS Development and Consulting: Wiki(Site not responding. Last check: 2007-10-11)
designed as a proof of concept, to test the boundaries of computer language definition, or as jokes, and not with the intention of being adopted for real-world programming).
(http://c-p-l.sourceforge.net/), a language in which a non-comment is a syntax error (but on the plus side, all styles of comments are supported, and comments may be arbitrarily nested).
a minimalistic programminglanguage where all data manipulation is done with stacks of integers
[No title](Site not responding. Last check: 2007-10-11)
Befreak is a two-dimensional reversible programminglanguage invented by Brent Kerby and Hilton Campbell.
The Befreak instructions are contained in the matrix X. is a two column matrix of instruction characters.
If reverse mode is 0, then we execute the function corresponding to X[;0;0]?t, else we execute the function corresponding to X[;0;1]?t, where t is the current instruction token.
Note that languages intended predominantly as jokes are located in the joke language list.
Esoteric programminglanguages on C2 WikiWeb (http://c2.com/cgi/wiki?EsotericProgrammingLanguage) has some decent material.
Open Directory Project's Obfuscated ProgrammingLanguages section (http://dmoz.org/Computers/Programming/Languages/Obfuscated/) is another collection of links to esoteric programming pages.
B is for Blog » 2005 December(Site not responding. Last check: 2007-10-11)
Whenever a programmer is learning a new language, it is traditional to present a short program which does nothing but display “Hello, world!” on the screen.
My initial experience with programming was a little different from most, however.
It seems silly to teach basic clipboard use in a programming book, but I guess in those days it was a newfangled feature.
But one big gripe that I have with the current usages of types as are found in today's (statically) typed languages is that they tend to be somewhat ad hoc 12:44:02
E is both not a vector-processing language, and does not use linked lists.