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[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
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
 | This computer hardware article is a stub. You can help Wikipedia by expanding it. |
- ^ Clarke, T. J.W.; Gladstone, P. J.S.; MacLean, C. D.; Norman, A. C. (1980-08-25). "SKIM - The S, K, I reduction machine". Proceedings of the 1980 ACM conference on LISP and functional programming. LFP '80. New York, NY, USA: Association for Computing Machinery: 128–135. doi:10.1145/800087.802798. ISBN 978-1-4503-7396-8.
- ^ "Reduction Machines". web.archive.org. 2002-07-31. Retrieved 2023-07-01.
- ^ Jones, Simon L. Peyton; Clack, Chris; Salkild, Jon; Hardie, Mark (1987). Kahn, Gilles (ed.). "GRIP — a high-performance architecture for parallel graph reduction". Functional Programming Languages and Computer Architecture. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer: 98–112. doi:10.1007/3-540-18317-5_7. ISBN 978-3-540-47879-9.
- ^ Naylor, Matthew; Runciman, Colin (2012). "The Reduceron reconfigured and re-evaluated". Journal of Functional Programming. 22 (4–5): 574–613. doi:10.1017/S0956796812000214. ISSN 1469-7653.
- ^ Naylor, Matthew; Runciman, Colin (2008). Chitil, Olaf; Horváth, Zoltán; Zsók, Viktória (eds.). "The Reduceron: Widening the von Neumann Bottleneck for Graph Reduction Using an FPGA". Implementation and Application of Functional Languages. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer: 129–146. doi:10.1007/978-3-540-85373-2_8. ISBN 978-3-540-85373-2.