| Paradigms | Formal language, Turing tarpit, esoteric |
|---|---|
| Designed by | Chris Barker |
| Developer | Chris Barker |
| First appeared | 2001 |
| Final release | 2001
/ 2001 |
| Implementation language | Scheme, JavaScript |
| Platform | Scheme interpreter, Web browser (JavaScript) |
| License | Public domain |
| Website | www |
| Influenced | |
| Zot | |
In formal language theory and computer science, Iota and Jot (from Greek iota ι, Hebrew yodh י, the smallest letters in those two alphabets) are languages, extremely minimalist formal systems, designed to be even simpler than other more popular alternatives, such as lambda calculus and SKI combinator calculus. Thus, they can also be considered minimalist computer programming languages, or Turing tarpits, esoteric programming languages designed to be as small as possible but still Turing-complete. Both systems use only two symbols and involve only two operations. Both were created by professor of linguistics Chris Barker in 2001. Zot (2002) is a successor to Iota that supports input and output.[1]
Note that this article uses Backus-Naur form to describe syntax.