[plt-scheme] Smallest set of operators

From: Matthias Felleisen (matthias at ccs.neu.edu)
Date: Fri Feb 2 09:05:03 EST 2007

On Feb 2, 2007, at 9:02 AM, Paulo J. Matos wrote:

> On 2/2/07, Matthias Felleisen <matthias at ccs.neu.edu> wrote:
>>
>> On Feb 2, 2007, at 7:36 AM, Paulo J. Matos wrote:
>>
>> > On 2/2/07, Matthias Felleisen <matthias at ccs.neu.edu> wrote:
>> >>
>> >> 1. You need to specify what you mean with define.
>> >>
>> >
>> > define = implement.
>>
>>
>> This definition is naive. Just use ONE SINGLE combinator (X, see
>> Barendregt) and you can compile EVERY language to it. -- Matthias
>>
>>
>
> You mean you can compile Scheme to X only? continuations, side- 
> effects, etc?

Here is how it goes:

1. cps the program.

2. sps the program.

3. now you're functional.

4. compile to X now.

-- Matthias



Posted on the users mailing list.