Iota and Jot

In formal language theory and computer science, Iota and Jot 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. Wikipedia

Designed by: Chris Barker
Developed by: Q28229652
Implemented in: Scheme
Aliases: Iota, Jot

Wikidata: Q3154138

Programming paradigms: esoteric programming

Language types: esoteric programming language