Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!usc!wuarchive!decwrl!world!iecc!compilers-sender
From: gateley@rice.edu (John Gateley)
Newsgroups: comp.compilers
Subject: SK - reduction machine wanted
Keywords: theory, SK-combinators, lambda calculus
Message-ID: <9103222125.AA16855@titan.rice.edu>
Date: 22 Mar 91 21:25:01 GMT
References: <9402@star.cs.vu.nl>
Sender: compilers-sender@iecc.cambridge.ma.us
Reply-To: gateley@rice.edu (John Gateley)
Organization: Compilers Central
Lines: 20
Approved: compilers@iecc.cambridge.ma.us
In-Reply-To: wjstaal@cs.vu.nl's message of 21 Mar 91 16:01:47 GMT

Wilco Staal writes:
>I'm looking for an implementation of Turner's SK- reduction machine in an
>imperative language (Modula-2, c, pascal, Ada in decreasing order of
>interest).

Modula-2, C, Pascal, and Ada are all call-by-value (as opposed to
call-by-name) where Turner's combinator system (and all the following
research) are based on call-by-name. Also, you say that you are doing
a project on functional languages, and then mention a set of
imperative languages - do you really want side effects?

Bruce Duba and I are presenting a paper at MFPS on call-by-value
combinators, and Bruce has been working on combinator systems for
languages with side effects. Let me know if you want more info.

John
gateley@rice.edu
-- 
Send compilers articles to compilers@iecc.cambridge.ma.us or
{ima | spdcc | world}!iecc!compilers.  Meta-mail to compilers-request.