Lambda the Ultimate

inactiveTopic Iota and Jot: the simplest languages?
started 9/28/2003; 3:36:18 AM - last post 9/29/2003; 6:46:49 AM
Ehud Lamm - Iota and Jot: the simplest languages?  blueArrow
9/28/2003; 3:36:18 AM (reads: 13107, responses: 1)
Iota and Jot: the simplest languages?
I don't think we discussed these 'esoteric' languages before. Iota, an unambiguous Turing-complete language with just two symbols and Jot that uses the techniques used to construct Iota to provide a particularly elegant Goedel numbering.

Zot, a related language, has some sort of support for input/output. Zot's semantics are based on continutations.


Posted to theory by Ehud Lamm on 9/28/03; 3:37:04 AM

Frank Atanassow - Re: Iota and Jot: the simplest languages?  blueArrow
9/29/2003; 6:46:49 AM (reads: 382, responses: 0)
How about:

Jeroen Fokker. The Systematic Construction of a One-combinator Basis for Lambda-Terms. Formal Aspects of Computing 4 (1992), pp. 776-780.

It's mentioned in the link also.