{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:40:28Z","timestamp":1742913628009,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540189947"},{"type":"electronic","value":"9783642734519"}],"license":[{"start":{"date-parts":[[1988,1,1]],"date-time":"1988-01-01T00:00:00Z","timestamp":567993600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1988,1,1]],"date-time":"1988-01-01T00:00:00Z","timestamp":567993600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/978-3-642-73451-9_16","type":"book-chapter","created":{"date-parts":[[2011,12,26]],"date-time":"2011-12-26T13:37:21Z","timestamp":1324906641000},"page":"198-212","source":"Crossref","is-referenced-by-count":4,"title":["Compiled Graph Reduction on a Processor Network"],"prefix":"10.1007","author":[{"given":"Martin","family":"Raber","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Remmel","sequence":"additional","affiliation":[]},{"given":"Erwin","family":"Hoffmann","sequence":"additional","affiliation":[]},{"given":"Dieter","family":"Maurer","sequence":"additional","affiliation":[]},{"given":"Fritz","family":"M\u00fcller","sequence":"additional","affiliation":[]},{"given":"Hans-Georg","family":"Oberhauser","sequence":"additional","affiliation":[]},{"given":"Reinhard","family":"Wilhelm","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"G.L. Burn, C.L. Hankin, S. Abramsky, The Theory and Practice of Strictness Analysis for Higher Order Functions, LNCS Vol.217 Programs as Data Objects, Copenhagen 1985, Springer","DOI":"10.1007\/3-540-16446-4_3"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"G.L. Burn, Evaluation Transformers \u2014 A Model for the Parallel Evaluation of Functional Languages, 3rd Int. Conf. on Functional Prog. Lang. and Computer architecture, Portland, 1987","DOI":"10.1007\/3-540-18317-5_24"},{"issue":"12","key":"16_CR3","doi-asserted-by":"crossref","first-page":"1190","DOI":"10.1109\/TC.1985.6312218","volume":"C-34","author":"FW Burton","year":"1985","unstructured":"F. Warren Burton, Speculative computation, parallelism, and functional programming. (Short paper) IEEE Trans. Comput. C-34,12 (Dec.1985), pp. 1190\u20131193","journal-title":"IEEE Trans. Comput."},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"J. Fairbairn and S. Wray, Code Generation Techniques For Functional Languages, 1986, ACM Conference on Lisp and Functional Programming (Proceedings) pp. 95\u2013104","DOI":"10.1145\/319838.319853"},{"key":"16_CR5","unstructured":"J. Fairbairn and S. Wray, TIM: A Simple, Lazy Abstract Machine To Execute Supercombinators, Departmental Research Report CSC\/87\/R6, University of Glasgow"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"P. Hudak and D. Kranz, A combinator based compiler for a functional language, 11th ACM Symposium on Principles of Programming Languages, ACM, Jan., 1984, pp. 122\u2013132","DOI":"10.1145\/800017.800523"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"P. Hudak and B. Goldberg, Serial Combinators \u201dOptimal grains of Parallelism\u201d, LNCS Vol.201 Functional Programming Languages and Computer Architecture Nancy, September 1985, Springer","DOI":"10.1007\/3-540-15975-4_49"},{"key":"16_CR8","unstructured":"J. Hughes, Managing Reduction Graphs With Reference Counts, Departmental Research Report CSC\/87\/R2, University of Glasgow"},{"issue":"6","key":"16_CR9","first-page":"58","volume":"19","author":"T Johnsson","year":"1984","unstructured":"Th. Johnsson, Efficient Compilation of lazy Evaluation, Proceedings of the ACM SIGPLAN 84 Symposium on Compiler Construction SIGPLAN Notices Vol. 19 No. 6 pp. 58\u201369, 1984","journal-title":"Efficient Compilation of lazy Evaluation"},{"issue":"4","key":"16_CR10","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1002\/sres.3850020407","volume":"2","author":"RM Keller","year":"1985","unstructured":"R. M. Keller, Distributed Computation by Graph Reduction, Systems Research Vol. 2, no. 4, pp. 285\u2013295, 1985","journal-title":"Systems Research"},{"key":"16_CR11","series-title":"Technischer Bericht","volume-title":"Ein Simulator f\u00fcr die parallele Reduktion von Kombinatorcode","author":"D Maurer","year":"1985","unstructured":"D. Maurer and H.G. Oberhauser, Ein Simulator f\u00fcr die parallele Reduktion von Kombinatorcode, Technischer Bericht, Fachbereich 10, Universiti\u00e4t des Saarlandes, D-6600 Saarbr\u00fccken, 09\/1985"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"D. Maurer, Strictness computation using special \u03bb \u2014 expressions, LNCS Vol.217 Programs as Data Objects, Copenhagen 1985, Springer","DOI":"10.1007\/3-540-16446-4_8"},{"key":"16_CR13","unstructured":"D. Maurer, Relevanzanalyse \u2014 eine Kombination von Striktheits \u2014 und Datenflu\u00dfanalyse zur effizienten Auswertung funktionaler Programme, Dissertation, Universit\u00e4t des Saarlandes, to appear 1987"},{"key":"16_CR14","unstructured":"J. Metzger, Eine Untersuchung geeigneter Netzwerke und Arbeitsverteilungsstrategien f\u00fcr die parallele Reduktion von Kombinatorkode, Diplomarbeit, Universit\u00e4t des Saarlandes, 1987"},{"key":"16_CR15","unstructured":"M. Raber, T. Remmel et al., A Concept For A Parallel G-Machine, SFB-Bericht 06\/1987 des SFB 124-C1, Universit\u00e4t des Saarlandes"}],"container-title":["Informatik-Fachberichte","Architektur und Betrieb von Rechensystemen"],"original-title":[],"language":"de","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-73451-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T21:55:07Z","timestamp":1676757307000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-73451-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540189947","9783642734519"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-73451-9_16","relation":{},"ISSN":["0343-3005"],"issn-type":[{"type":"print","value":"0343-3005"}],"subject":[],"published":{"date-parts":[[1988]]}}}