[plt-scheme] Smallest set of operators

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

On Feb 2, 2007, at 8:52 AM, hendrik at topoi.pooq.com wrote:

> On Fri, Feb 02, 2007 at 07:48:04AM -0500, Matthias Felleisen 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
>
> Only purely functional languages, I'd say.  You might have trouble
> invoking a shell script that formats a hard disk with just X.

Think harder. It's a large program but I can do it. And you can too.

-- Matthias



Posted on the users mailing list.