Jump to content

Graph reduction machine

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Cícero (talk | contribs) at 12:30, 3 April 2009 (+Category:Combinatory logic). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A graph reduction machine is a special-purpose computer built to perform combinator calculations by graph reduction.

Examples include the SKIM ("S-K-I machine") computer, built at the University of Cambridge Computer Laboratory, and the multiprocessor GRIP ("Graph Reduction In Parallel") computer, built at University College London.

References

  • T. J. W. Clarke, P. Gladstone, C. MacLean, A. C. Norman: SKIM - The S, K, I Reduction Machine. LISP Conference 1980: 128-135

See also