I really like SK logic, and have gone down the rabbit hole to play with: - Illative combinatory logic (equivalent to dependent type theory http://chriswarbo.ne

I really like SK logic, and have gone down the rabbit hole to play with: - Illative combinatory logic (equivalent to dependent type theory http://chriswarbo.net/blog/2012-12-01-typed_combinators.html http://chriswarbo.net/blog/2012-12-01-typed_combinators.html ) - Concatenative combinators (if SK are akin to lambda calculus, then concatenative combinators are akin to Joy) - Binary combinatory logic (a useful context for measuring kolmogorov complexity) - Linear combinatory logic (information-preserving, reversible, etc. with analogies to quantum operations) Yet I've never got an intuitive feel for Iota (or Jot). Perhaps your translation/implementation will help me to finally grok it! (Their Wikipedia descriptions look like a mess or parentheses!)