{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T23:05:37Z","timestamp":1779836737583,"version":"3.53.1"},"reference-count":30,"publisher":"Cambridge University Press (CUP)","issue":"4-5","license":[{"start":{"date-parts":[[2012,7,10]],"date-time":"2012-07-10T00:00:00Z","timestamp":1341878400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Funct. Prog."],"published-print":{"date-parts":[[2012,9]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>A new version of a special-purpose processor for running lazy functional programs is presented. This processor \u2013 the Reduceron \u2013 exploits parallel memories and dynamic analyses to increase evaluation speed, and is implemented using reconfigurable hardware. Compared to a more conventional functional language implementation targeting a standard RISC processor running on the same reconfigurable hardware, the Reduceron offers a significant improvement in run-time performance.<\/jats:p>","DOI":"10.1017\/s0956796812000214","type":"journal-article","created":{"date-parts":[[2012,7,10]],"date-time":"2012-07-10T07:46:30Z","timestamp":1341906390000},"page":"574-613","source":"Crossref","is-referenced-by-count":5,"title":["The Reduceron reconfigured and re-evaluated"],"prefix":"10.1017","volume":"22","author":[{"given":"MATTHEW","family":"NAYLOR","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"COLIN","family":"RUNCIMAN","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2012,7,10]]},"reference":[{"key":"S0956796812000214_ref28","volume-title":"Supercombinator Soft Machines","author":"Ward","year":"2000"},{"key":"S0956796812000214_ref4","unstructured":"Dijkstra E. W. (1980) A mild variant of Combinatory Logic [online]. EWD735. Available at: http:\/\/www.cs.utexas.edu\/users\/EWD\/ewd07xx\/EWD735.PDF. Accessed 26 June 2012."},{"key":"S0956796812000214_ref3","doi-asserted-by":"publisher","DOI":"10.1145\/62678.62717"},{"key":"S0956796812000214_ref17","unstructured":"Naylor M. (2009b) Design of the Octostack, Reduceron memo 27 [online]. Available at: http:\/\/www.cs.york.ac.uk\/fp\/reduceron\/memos\/Memo27.lhs."},{"key":"S0956796812000214_ref14","unstructured":"Longbottom R. (November 2009) Dhrystone Benchmark Results On PCs [online]. Available at: http:\/\/www.roylongbottom.org.uk\/dhrystone%20results.htm. Accessed 26 June 2012."},{"key":"S0956796812000214_ref23","doi-asserted-by":"publisher","DOI":"10.1145\/319838.319864"},{"key":"S0956796812000214_ref27","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380090105"},{"key":"S0956796812000214_ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-692-6"},{"key":"S0956796812000214_ref22","volume-title":"The Implementation of Functional Programming Languages","author":"Peyton Jones","year":"1987"},{"key":"S0956796812000214_ref13","doi-asserted-by":"publisher","DOI":"10.1145\/48022.48026"},{"key":"S0956796812000214_ref30","unstructured":"Xilinx (April 2009) MicroBlaze Soft Processor v7.20 [online].\u00a0. Available at: http:\/\/www.xilinx.com\/tools\/microblaze.htm. Accessed 26 June 2012."},{"key":"S0956796812000214_ref26","unstructured":"Stoye W. (1985) The Implementation of Functional Languages Using Custom Hardware. PhD Thesis, University of Cambridge, Cambridge, UK."},{"key":"S0956796812000214_ref8","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796809007175"},{"key":"S0956796812000214_ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-3196-0_3"},{"key":"S0956796812000214_ref25","unstructured":"Sharp R. (2002) Higher-Level Hardware Synthesis. PhD Thesis, University of Cambridge, Cambridge, UK."},{"key":"S0956796812000214_ref29","doi-asserted-by":"publisher","DOI":"10.1145\/358274.358283"},{"key":"S0956796812000214_ref11","first-page":"157","article-title":"Efficient Interpretation by transforming data types and patterns to functions","volume":"7","author":"Jansen","year":"2007","journal-title":"Trends Funct. Program."},{"key":"S0956796812000214_ref24","volume-title":"A System of Functional Abstraction","author":"Scott","year":"1968"},{"key":"S0956796812000214_ref5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-18420-1"},{"key":"S0956796812000214_ref18","first-page":"129","volume-title":"Implementation and Application of Functional Languages (IFL 2007, Revised Selected Papers)","author":"Naylor","year":"2008"},{"key":"S0956796812000214_ref9","volume-title":"Computer Architecture; A Quantitative Approach","author":"Hennessy","year":"1992"},{"key":"S0956796812000214_ref12","volume-title":"Garbage Collection: Algorithms for Automatic Dynamic Memory Management","author":"Jones","year":"1996"},{"key":"S0956796812000214_ref6","doi-asserted-by":"publisher","DOI":"10.1145\/155090.155113"},{"key":"S0956796812000214_ref16","unstructured":"Naylor M. (2009a) An algorithm for arity-reduction, Reduceron memo 12 [online]. Available at: http:\/\/www.cs.york.ac.uk\/fp\/reduceron\/memos\/Memo12.lhs). Accessed 26 June 2012."},{"key":"S0956796812000214_ref2","first-page":"54","volume-title":"Implementation and Application of Functional Languages (IFL 2010, Revised Selected Papers)","author":"Boeijink","year":"2011"},{"key":"S0956796812000214_ref15","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45022-X_5"},{"key":"S0956796812000214_ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1863543.1863556"},{"key":"S0956796812000214_ref20","unstructured":"Naylor M. , Runciman C. & Reich J. (2009) Reduceron home page [online]. Available at: http:\/\/www.cs.york.ac.uk\/fp\/reduceron\/. Accessed 26 June 2012."},{"key":"S0956796812000214_ref10","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796801004300"},{"key":"S0956796812000214_ref7","unstructured":"Frankau S. (2004) Hardware Synthesis from a Stream-Processing Functional Language. PhD Thesis, University of Cambridge, Cambridge, UK."}],"container-title":["Journal of Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0956796812000214","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T22:36:04Z","timestamp":1779834964000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0956796812000214\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,10]]},"references-count":30,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["S0956796812000214"],"URL":"https:\/\/doi.org\/10.1017\/s0956796812000214","relation":{},"ISSN":["0956-7968","1469-7653"],"issn-type":[{"value":"0956-7968","type":"print"},{"value":"1469-7653","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7,10]]}}}