Live data from Hacker News

One instruction set computer

en.wikipedia.org

1–10 of 27 posts

Re: One instruction set computer

#3
At one point I was seriously fascinated by the lambda calculus and particularly the S and K combinators - two very simple functions that you can build any computation from:

http://en.wikipedia.org/wiki/SKI_combinator_calculus

More recently I found out about the U combinator which is a single combinator that can be used to define S & K:

http://en.wikipedia.org/wiki/Iota_and_Jot

Having a system that implemented recursion using the Y combinator in terms of S & K and have it actually compute stuff was rather amusing. I'd be fascinated to see what it would look like using just U.

Re: One instruction set computer

#4
post #3

At one point I was seriously fascinated by the lambda calculus and particularly the S and K combinators - two very simple functions that you can build any computation from: http://en.wikipedia.org/wiki/SKI_combinator_calculus More recently I found out about the U combinator which is a single combinator that can be used to define S & K: http://en.wikipedia.org/wiki/Iota_and_Jot Having a system that implemented recursi…

It would look like a very (very!) long string of U's. :-)

You might enjoy this:

http://www.flownet.com/ron/lambda-calculus.html

Re: One instruction set computer

#5
post #4
post #3

At one point I was seriously fascinated by the lambda calculus and particularly the S and K combinators - two very simple functions that you can build any computation from: http://en.wikipedia.org/wiki/SKI_combinator_calculus More recently I found out about the U combinator which is a single combinator that can be used to define S & K: http://en.wikipedia.org/wiki/Iota_and_Jot Having a system that implemented recursi…

It would look like a very (very!) long string of U's. :-) You might enjoy this: http://www.flownet.com/ron/lambda-calculus.html

Actually, one of the many things I learned from doing a final year project for my CS degree on "benchmarking" different sets of combinators was how to write a garbage collector - I was doing this in '87/'88 on a Unix mini (HLH Orion) and memory was tight and my trees were comparatively huge!

Re: One instruction set computer

#10
I'm curious, is there any real-world application for this? Or is it mostly interesting from a research perspective?

It seems like this wouldn't perform very well in the real world for most applications, but I could see it being useful for very simple architectures.

Post reply on HN