{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:50:59Z","timestamp":1725663059968},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540184201"},{"type":"electronic","value":"9783540479635"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18420-1_49","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:34:50Z","timestamp":1330198490000},"page":"49-52","source":"Crossref","is-referenced-by-count":1,"title":["A simple abstract machine to execute supercombinators"],"prefix":"10.1007","author":[{"given":"Jon","family":"Fairbairn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"3_CR1","unstructured":"Jon Fairbairn, Ponder and its Type System, University of Cambridge Computer Laboratory Technical Report No. 31, 1983."},{"key":"3_CR2","unstructured":"Jon Fairbairn, Design and Implementation of a Simple Typed Language Based on the Lambda-Calculus, University of Cambridge Computer Laboratory Technical Report No. 75, May 1985."},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Jon Fairbairn & Stuart 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":"3_CR4","volume-title":"Strictness Detection in Non-Flat Domains","author":"J. Hughes","year":"1985","unstructured":"John Hughes, Strictness Detection in Non-Flat Domains, Institutionen f\u00f6r Informationsbehandling, Chalmers Tekniska H\u00f6gskola, G\u00f6teborg, Draft, August 1985"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Paul Hudak & Benjamin Goldberg, Serial Combinators: \u201cOptimal\u201d Grains of Parallelism, Yale University Department of Computer Science 1985","DOI":"10.1007\/3-540-15975-4_49"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Paul Hudak & David Kranz, A combinator based compiler for a functional language, 11th ACM Symposium on Principles of Programming Languages ACM Jan 1984, pp 121\u2013132","DOI":"10.1145\/800017.800523"},{"key":"3_CR7","unstructured":"Thomas Johnsson, The G-Machine: An Abstract Machine for Graph Reduction, Proceedings of SERC Declarative Programming Workshop at UCL, April 1983"},{"key":"3_CR8","unstructured":"Richard B. Kieburtz & Maria Napierala, A studied laziness\u2014strictness analysis with stuctured data types, Oregon Graduate Centre, Extended Abstract, July 1985."},{"key":"3_CR9","unstructured":"Mark Tillotson, Introduction to the Functional Programming Language \u201cPonder\u201d, University of Cambridge Computer Laboratory Technical Report No. 65, May 1985."},{"key":"3_CR10","unstructured":"Phil Wadler, Strictness Analysis on Non-Flat Domains, Programming Research Group, Oxford University, November 1985."}],"container-title":["Lecture Notes in Computer Science","Graph Reduction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18420-1_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:14:50Z","timestamp":1605644090000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18420-1_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540184201","9783540479635"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-18420-1_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}