Befunge

Befunge

Befunge is a two-dimensional programming language — its source code is a grid, and its instruction pointer travels across that grid like a cursor with a mind of its own. Chris Pressey invented it in 1993 with a design goal that stands out even among esolangs: not merely to be hard to write, but to be as difficult to compile as possible. A language that fights the compiler, not just the programmer.^[1]

Its name is itself an artifact of the culture that produced it: "Befunge" began life as a typo for the word "before," typed by a user named Curtis Coleman at 4 AM on a BBS chat system. Pressey's community then reverse-engineered a fake etymology for it — "be-" as a corruption of "bi-" (two) plus "-funge" from fungible — "to interchange program code with data in two dimensions." A language born from a typo, retroactively dignified with a morphology. It is pronounced /biːˈfʌndʒ/.^[2]

The playfield

A Befunge-93 program lives on a fixed 80×25 toroidal grid — the size of a classic terminal screen, which wraps around at every edge. Execution is handled by an instruction pointer that starts in the top-left corner moving right and simply keeps going until something redirects it. There are no jumps in the conventional sense; control flow is achieved by pushing the pointer in a new direction:

Everything else is Forth-like stack machinery: digits push values, + - * / % ! ` ` do arithmetic and comparison, : \ $ duplicate, swap, drop, and . , & ~` handle I/O. The smallest possible Befunge program demonstrates the whole model — a four-cell infinite loop:

>v
^<

The pointer moves right, hits v, turns down, hits <, turns left, hits ^, turns up, hits >, and repeats forever — a program that is also a picture of itself running.^[3]

Self-modifying by design

The p and g commands are where Befunge stops being a curiosity and becomes a genuine machine: any program can write new instructions into its own playfield mid-execution and then steer the pointer into them. Code is data on a grid, addressable by coordinate, mutable at runtime — the von Neumann insight rendered as a party trick. This is also what makes Befunge nearly impossible to compile: a compiler cannot emit fixed machine code for a program that may rewrite itself while running. Pressey's goal was achieved structurally, not just aesthetically.

The heritage is honest, too — Pressey has cited AmigaVision, the flowchart-based multimedia tool, and Forth's stack model as the two influences. Befunge is what happens when a visual programming environment collides with a concatenative stack machine at 4 AM.

The Funge family

Befunge-93 spawned an entire dimensional family. Befunge-96 and Funge-97 were intermediate experiments; Funge-98 formalized the lineage into a proper specification, dignifying the wraparound topology with the name Lahey space and generalizing the concept: Unefunge is one-dimensional, Trefunge three, Nefunge n-dimensional, and so on — a whole geometry of cursed control flow. Today the language's most visible living artifact is fungot, an IRC bot written in Befunge whose source is small enough to fit on a T-shirt — perhaps the only production software on this site that is also wearable.^[4]

Where it sits in the wing

Each member of the early esolang canon attacked a different assumption: INTERCAL attacked seriousness, Brainfuck attacked size, Malbolge attacked the programmer, and Whitespace attacked visibility. Befunge attacked dimensionality — the assumption that a program is a line of text read top to bottom. It remains the canonical answer to a question nobody else thought to ask: why should code only go one way?

Check your understanding

• What is the playfield, and what does "toroidal" mean for the instruction pointer?
• What makes Befunge uniquely hard to compile rather than merely hard to write?
• Which two commands let a program modify itself mid-run?
• Where did the name "Befunge" actually come from?