iota

Iota is a ridiculously small "programming language" using only one combinator. I'm interested in understanding how it works, but it would be helpful to see the implementation in a language I'm familiar with. I found an implementation of the Iota programming language written in Scheme. I've been having a little trouble translating it to Haskell though. It's rather simple, but I'm relatively new to both Haskell and Scheme. How would you write an equivalent Iota implementation in Haskell? (let iota () (if (eq? #\* (read-char)) ((iota)(iota)) (lambda (c) ((c (lambda (x) (lambda (y) (lambda (z) ((x

I'm reading the recently released The Go Programming Language , and it's been a joy so far (with Brian Kernighan being one of the authors, I wouldn't expect anything other than excellence anyway). I've came across the following exercise on chapter 3: Exercise 3.13 Write const declarations for KB, MB, up through YB as compactly as you can. ( NOTE : in this context, KB, MB, etc, denote powers of 1000) This is preceded by a section where iota is introduced as a useful constants generator mechanism; in particular, the previous paragraph shows a nice and compact way to define the powers of 1024 as