Esoteric programming language

From Wikipedia, the free encyclopedia

An esoteric programming language (sometimes shortened to esolang^[1]) is a programming language designed as a test of the boundaries of computer programming language design, as a proof of concept, or as a joke. There is usually no intention of the language being adopted for real-world programming. Such languages are often popular among hackers and hobbyists. This use of esoteric is meant to distinguish these languages from more popular programming languages. Some more popular languages may appear esoteric (in the usual sense of the word) to some, and though these could arguably be called "esoteric programming languages" too, this is not what is meant.

Usability is rarely a high priority for such languages; often quite the opposite. The usual aim is to remove or replace conventional language features while still maintaining a language that is Turing-complete.

1 History
2 Esoteric programming terms
3 Internet community
4 References
5 External links

[edit] History

The earliest, and still the canonical example of an esoteric language was INTERCAL, designed in 1972 by James Lyon and Don Woods, with the stated intention of being unlike any other programming language the authors were familiar with.

More than twenty years later, Urban Müller created the now-famous brainfuck, which consist of only eight recognized characters. Along with Befunge, brainfuck is now one of the most well-supported esoteric programming languages. These are canonical examples of minimal Turing tarpits and needlessly obfuscated language features; brainfuck's minimality borders on elegant and pure language design.

[edit] Esoteric programming terms

[edit] Turing tarpit

A Turing tarpit is a Turing-complete programming language with arbitrarily few commands, operators, or the equivalent. These include brainfuck (8 commands, all with 0 operands), OISC (1 command, 3 operands), and Thue (1 command, 2 operands).

[edit] Language paradigm

The paradigm of a language can fall into a number of categories, and these categories are used to get a general understanding of the way that a specific language operates. These include imperative/despotic languages such as Brainfuck, in which instructions describe how to change data; functional languages such as Unlambda, in which data and code are more or less interchangeable and execution is the repeated application of functions to the results of other functions; and rewriting languages such as Thue, in which transformation functions are applied to an initial state.

[edit] Funges

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. Different instructions determine the direction in which the instruction pointer moves, and consequently, the sequence of instructions that is executed.

The current official standard for the behaviour of these programming languages is the Funge-98 Specification. This specification is a generalisation of the semantics of the Befunge programming language, which has a two-dimensional toroidal topology. Languages which adhere closely to this standard, such as Unefunge (one-dimensional) and Trefunge (three-dimensional), are sometimes called funges, while more "distant relatives" which differ in significant respects, such as Wierd, are referred to as fungeoids.

[edit] Nondeterministic language

For a deterministic language, if one is given the current state of a program, the next state can always be predicted. This is not true for a nondeterministic language. Most languages are deterministic, because nondeterministic languages such as Java2K often give unreliable results, and getting even trivial programs to have a reliable output is often a monumental task. Nondeterministic languages have only a certain probability (less than unity) of behaving the way that they are expected to.

[edit] Despotic language

A despotic language is a Turing tarpit with a stateful encoding, namely a language in which commands are used to select from a finite range of operations and apply these operations to the current state of the program. Examples include reMorse and Whirl, and arguably INTERCAL.

[edit] Stateful encoding

A system of encoding programs such that each substring of the encoding is an instruction to locate the next instruction in a list. An example based on reMorse or THRAT would be:

Select Next Operation in list
Perform Operation

With the list of operations either standard (as in reMorse or THRAT) or dynamic (as in reMorse4ever).

[edit] Internet community

There is a small but thriving community on the Internet of hobbyists who program in and design esoteric programming languages.

The esolang community is active sporadically, and topics of discussion range from debate as to whether a language is Turing-complete to how one would go about representing abstract and hard to visualise mathematical concepts in a programming environment. There is a mailing list, but it is nearly abandoned and most discussion happens on the wiki (see below).

Turing completeness is a favorite topic of discussion, since it is not immediately obvious whether or not a language is Turing complete, and it often takes rather large intuitive leaps to come to a solution. New languages with new features are always being created, so proof of Turing completeness is always a challenge.

A related pursuit among programming language enthusiasts is the writing of obfuscated code.