We are currently working on new rules for what content should and shouldn't be allowed on this website, and are looking for feedback! See Esolang:2026 topicality proposal to view and give feedback on the current draft.
60
Jump to navigation
Jump to search
60, also known as sixty, is an esolang made by User:Marcus 2n2. The syntax is similar to Unlambda.
Combinators
| Combinator and arguments | Evaluation |
|---|---|
| ```sabc | ``ac`bc |
| `ia | a |
| `xa | `aa |
| ``tab | `ba |
| `ya | `a`ya |
| 6 | input |
| `0a | a (with the side effect of outputting a) |
Turing Completeness Proof
Since 60 already has an s and an i, we can use them (along with x, t, and y) to build λ-I calculus.
A combinatory system is Turing complete when it can perform the 3 fundamental operations:
- Application – ` (This really isn't a combinator but it's needed)
- Duplication – x
- Permutation – t