Conditional Example - Unlambda Typing CST Test
Loading…
Conditional Example — Unlambda Code
Uses `s` and `k` combinators to simulate a simple conditional printing 'Y' or 'N'.
`s`k.Y
`k.N
Unlambda Language Guide
Unlambda is an esoteric functional programming language based on combinatory logic. It eschews traditional variables and functions in favor of function application using only a small set of combinators, emphasizing minimalism and theoretical computation.
Primary Use Cases
- ▸Experimenting with combinatory logic and functional programming
- ▸Educational examples in theoretical computer science
- ▸Recreational programming and code-golf challenges
- ▸Demonstrating Turing-completeness in minimal languages
- ▸Exploring minimalist programming paradigms
Notable Features
- ▸Minimalistic syntax with a few combinators
- ▸No variables, loops, or traditional functions
- ▸Focus on function application
- ▸Supports input/output via special operators
- ▸Turing-complete despite extreme minimalism
Origin & Creator
Unlambda was created by David Madore in 1999 as a demonstration of functional programming concepts and minimalistic design in Turing-complete languages.
Industrial Note
Unlambda is mostly a theoretical and hobbyist language. It is used to explore the limits of functional programming, combinatory logic, and to challenge programmers with extreme minimalism.