A graph reduction machine is a special-purpose computer built to perform

combinator Combinatory logic is a notation to eliminate the need for quantified variables in mathematical logic. It was introduced by Moses Schönfinkel and Haskell Curry, and has more recently been used in computer science as a theoretical model of compu ...

calculations by graph reduction. Examples include the SKIM ("S-K-I machine") computer, built at the

University of Cambridge Computer Laboratory The Department of Computer Science and Technology, formerly the Computer Laboratory, is the computer science department of the University of Cambridge. it employed 35 academic staff, 25 support staff, 35 affiliated research staff, and about 15 ...

, and the multiprocessor GRIP ("Graph Reduction In Parallel") computer, built at

University College London , mottoeng = Let all come who by merit deserve the most reward , established = , type = Public research university , endowment = £143 million (2020) , budget = � ...

References

*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 Applicative computing systems Functional programming University of Cambridge Computer Laboratory {{Compu-hardware-stub

See also

References

External links