Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Numbers? Memory addresses? Subleq is rather baroque compared to the ascetic world of combinators... ;-)

NB: As a final year project on my CS course in the 80s I did benchmarking on the efficiency of different sets of combinators for executing a toy functional programming language - the simplest set of combinators I used was SK and that was quite impressively awful to do something like multiplication. Quite interested to see how bad a single combinator scheme would be....



Here's the simplest one I can find, the Binary Lambda Calculus:

BLC Syntax

    <term> ::= 00 | 01 | 1 <term> <term> 
BLC Semantics (as string-rewriting rules for any terms x, y, z)

    1100xy --> x
    11101xyz --> 11xz1yz 
http://homepages.cwi.nl/~tromp/cl/cl.html




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: