Implementation of an SK reduction machine

This project was done by Stefan Berg and Frédéric Pighin during the fall quarter of 1994 for CSE505: "Concepts of Programming Languages".

We implemented a symbolic desk calculator using a reduction machine based on combinators as exposed by D. A. Turner. Our goal was not to provide an efficient tool for scientific computation but rather to provide a tool showing both the processes of combinator graph reduction and lazy evaluation. Along with this pedagogic goal we built a Graphical User Interface allowing an easy access to the various information needed. The desk calculator interprets infix arithmetic expressions and uses a pure functional language.

Through the following links, you can get:

Please, send us mail for any comments ( {sgberg, pighin}@cs.washington.edu ).