Unlambda
Sign in to saveUnlambda is a minimal, "nearly pure" functional programming language invented by David Madore. It is based on combinatory logic, an expression system without the lambda operator or free variables. It relies mainly on two built-in functions (s and k) and an apply operator (written `, the backquote character). These alone make it Turing-complete, but there are also some input/output (I/O) functions to enable interacting with the user, some shortcut functions, and a lazy evaluation function. Variables are unsupported.
Key facts
- Programming language.name
- Unlambda
- Programming language.paradigm
- Nearly pure functional
- Programming language.designer
- David Madore
- Programming language.developer
- David Madore
- Programming language.latest release version
- 2.0.0
- Programming language.typing
- Untyped
- Programming language.programming language
- Scheme, C, Java
- Programming language.license
- GPL 2.0 or later
- Programming language.file format
- <!-- or:
- Programming language.file formats
- -->
via Wikipedia infobox
Wikidata facts
- Official website
- www.madore.org/~david/programs/unlambda
Show 1 more fact
- inception
- 1999-06-28
Sources (1)
via Wikidata · CC0
Article · 日本語
Unlambda(アンラムダ)はコンビネータ論理とラムダ計算に基づく、仕様の小さな、ほぼ純粋な関数型言語のプログラミング言語である。デビッド・マドレ(David Madore)によって設計された。
Abstract from DBpedia / Wikipedia · CC BY-SA