wjstaal@cs.vu.nl (Staal Wilco J) (03/22/91)
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.
gateley@rice.edu (John Gateley) (03/23/91)
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.