(en.wikipedia.org) Graph reduction machine - Wikipedia

ROAM_REFS: https://en.wikipedia.org/wiki/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.

Local Graph

org-roam 6609041d-bcca-4cab-8f02-14195d4ee28d (en.wikipedia.org) Graph reduction ma... //en.wikipedia.org/wiki/Computer https://en.wikipedia.org/wiki/Computer 6609041d-bcca-4cab-8f02-14195d4ee28d->//en.wikipedia.org/wiki/Computer //en.wikipedia.org/wiki/Combinator https://en.wikipedia.org/wiki/Combinator 6609041d-bcca-4cab-8f02-14195d4ee28d->//en.wikipedia.org/wiki/Combinator //en.wikipedia.org/wiki/Graph_reduction https://en.wikipedia.org/wiki/Graph_reduction 6609041d-bcca-4cab-8f02-14195d4ee28d->//en.wikipedia.org/wiki/Graph_reduction //en.wikipedia.org/wiki/University_of_Cambridge_Computer_Laboratory https://en.wikipedia.org/wiki/University_of_Cambridge_Computer_Laboratory 6609041d-bcca-4cab-8f02-14195d4ee28d->//en.wikipedia.org/wiki/University_of_Cambridge_Computer_Laboratory //en.wikipedia.org/wiki/University_College_London https://en.wikipedia.org/wiki/University_College_London 6609041d-bcca-4cab-8f02-14195d4ee28d->//en.wikipedia.org/wiki/University_College_London //en.wikipedia.org/wiki/Field-programmable_gate_array https://en.wikipedia.org/wiki/Field-programmable_gate_array 6609041d-bcca-4cab-8f02-14195d4ee28d->//en.wikipedia.org/wiki/Field-programmable_gate_array //en.wikipedia.org/wiki/Haskell https://en.wikipedia.org/wiki/Haskell 6609041d-bcca-4cab-8f02-14195d4ee28d->//en.wikipedia.org/wiki/Haskell