Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!usc!zaphod.mps.ohio-state.edu!think.com!hsdndev!spdcc!iecc!compilers-sender
From: wjstaal@cs.vu.nl (Staal Wilco J)
Newsgroups: comp.compilers
Subject: SK - reduction machine wanted
Keywords: theory, SK-combinators, lambda calculus
Message-ID: <9402@star.cs.vu.nl>
Date: 21 Mar 91 16:01:47 GMT
Sender: compilers-sender@iecc.cambridge.ma.us
Reply-To: Staal Wilco J <wjstaal@cs.vu.nl>
Organization: Compilers Central
Lines: 14
Approved: compilers@iecc.cambridge.ma.us

I'm doing a project on the compilation of higher-level functional
languages into SK- expressions and the execution of them.

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).

Does anyone have such an implementation or at least a reference? Mail me
if you have.  Many thanks in advance,

	W. Staal - wjstaal@cs.vu.nl
-- 
Send compilers articles to compilers@iecc.cambridge.ma.us or
{ima | spdcc | world}!iecc!compilers.  Meta-mail to compilers-request.