Graph reduction machine: Difference between revisions
Appearance
imported>Citation bot Removed URL that duplicated identifier. Removed parameters. | Use this bot. Report bugs. | Suggested by Dominic3203 | Category:Applicative computing systems | #UCB_Category 4/5 |
(No difference)
|
Latest revision as of 11:54, 20 November 2024
Template:Short description Template:Use dmy dates 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,<ref>Template:Cite book</ref> the multiprocessor GRIP ("Graph Reduction In Parallel") computer, built at University College London,<ref>Template:Cite web</ref><ref>Template:Cite book</ref> and the Reduceron, which was implemented on an FPGA with the single purpose of executing Haskell.<ref>Template:Cite journal</ref><ref>Template:Cite book</ref>
See also
[edit]References
[edit]Further reading
[edit]- 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]- Reduction Machines, Parallel Functional Programming: An Introduction, Kevin Hammond