Graph reduction machine
Jump to navigation
Jump to search
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,[1] the multiprocessor GRIP ("Graph Reduction In Parallel") computer, built at University College London,[2][3] and the Reduceron, which was implemented on an FPGA with the single purpose of executing Haskell.[4][5]
See also
[edit | edit source]References
[edit | edit source]- ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
Further reading
[edit | edit source]- 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
[edit | edit source]- Reduction Machines, Parallel Functional Programming: An Introduction, Kevin Hammond
 | This computer hardware article is a stub. You can help Wikipedia by expanding it. |