Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Programming Language

Unlambda

Esoteric Language

Unlambda is an esoteric functional programming language created by David Madore in 1999, designed around a minimalist combinator calculus in which the only built-in functions are variants of the S, K and I combinators from combinatory logic, and in which ordinary features such as named variables are deliberately absent. Programs are written entirely as combinator applications, making even simple tasks such as printing a fixed string a nontrivial exercise, which is the language's explicit point: to demonstrate that a full, if painfully impractical, model of computation can be built from function application alone.

Facts
Significance
Unlambda's significance is that it demonstrates a minimal, nearly pure functional programming model built entirely from combinatory logic, intended as a demonstration of pure functional programming rather than for practical use. 1
Sources
1. Unlambda, Wikipedia
Lead section
Quote, Lead section
As an esoteric programming language, Unlambda is meant as a demonstration of very pure functional programming rather than for practical use.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.