Trying to remember .... : Scheme
This is a discussion on Trying to remember .... within the Scheme forums in Programming Languages category; I was talking to a friend earlier today, and we ended up talking about s-expressions, scheme, lisp etc. I remember reading in a book, a few years ago, that the basic operations of scheme and lisp could be reduced to a very small (four or so) basic operators. These were represented as single letters (in capitals). I distinctly remember this as I wrote a simple (non-lambda) s-expression parser in Java about the same time. For the life of me I cannot remember what these letters were or what operations they represented. Google has failed me, and as for the book ...
![]() |
| | LinkBack | Thread Tools |
|
#1
| |||
| |||
| s-expressions, scheme, lisp etc. I remember reading in a book, a few years ago, that the basic operations of scheme and lisp could be reduced to a very small (four or so) basic operators. These were represented as single letters (in capitals). I distinctly remember this as I wrote a simple (non-lambda) s-expression parser in Java about the same time. For the life of me I cannot remember what these letters were or what operations they represented. Google has failed me, and as for the book - its somewhere in the deepest regions of my parents' garage. Could anyone please help me rediscover this info ? |
|
#2
| |||
| |||
| oPless writes: > I remember reading in a book, a few years ago, that the basic > operations of scheme and lisp could be reduced to a very small (four > or so) basic operators. These were represented as single letters (in > capitals). I distinctly remember this as I wrote a simple You may be thinking of S and K, which together with I are four or so. The keyword for search is "combinatory logic", though I suspect that "lambda calculus" would also lead there. See: <http://en.wikipedia.org/wiki/Combinatory_logic> |
|
#3
| |||
| |||
| On May 2, 10:08 am, Jussi Piitulainen <jpiit...@ling.helsinki.fi> wrote: > oPless writes: > > I remember reading in a book, a few years ago, that the basic > > operations of scheme and lisp could be reduced to a very small [snip] > You may be thinking of S and K, which together with I are four or so. > The keyword for search is "combinatory logic", though I suspect that > "lambda calculus" would also lead there. See: > > <http://en.wikipedia.org/wiki/Combinatory_logic> Fabulous! Many Thanks. |
![]() |
« Previous Thread
|
Next Thread »
| Thread Tools | |
| |
| ||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| shouldn't the DIV remember this? | usenet | DOTNET | 4 | 10-13-2007 04:56 PM |
| Anyone remember an ado.net cheatsheet on the web? | usenet | ADO DAO RDO RDS | 0 | 03-19-2007 01:02 PM |
| i remember... | usenet | awk | 2 | 12-14-2006 10:20 AM |
| Something to remember | usenet | ADO DAO RDO RDS | 0 | 03-08-2006 11:57 AM |
| OWA Does not Remember PAssword | usenet | Microsoft Exchange | 0 | 08-27-2004 10:50 AM |
All times are GMT -5. The time now is 08:50 AM.


