Graph reduction machine
≈ 1 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
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, the multiprocessor GRIP ("Graph Reduction In Parallel") computer, built at University College London, and the Reduceron, which was implemented on an FPGA with the single purpose of executing Haskell.
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, the multiprocessor GRIP ("Graph Reduction In Parallel") computer, built at University College London, and the Reduceron, which was implemented on an FPGA with the single purpose of executing Haskell.
See also
SECD machine
References
Further reading
T. J. W. Clarke, P. Gladstone, C. MacLean, A. C. Norman: SKIM — The S, K, I Reduction Machine. LISP Conference, 1980: 128–135
External links
Reduction Machines, Parallel Functional Programming: An Introduction, Kevin Hammond
Text derived from https://en.wikipedia.org/w/index.php?oldid=1353821658 under CC BY-SA 4.0; modifications have been made.