Lesson plan
Graph reduction machine
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.
Article summary
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.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.