{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T21:08:07Z","timestamp":1764364087071},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540183174"},{"type":"electronic","value":"9783540478799"}],"license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18317-5_3","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T14:33:09Z","timestamp":1330180389000},"page":"34-45","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":59,"title":["Tim: A simple, lazy abstract machine to execute supercombinators"],"prefix":"10.1007","author":[{"given":"Jon","family":"Fairbairn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stuart","family":"Wray","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"3_CR1","unstructured":"Luca Cardelli, The Functional Abstract Machine, Bell Laboratories Computing Science Technical Report No. 107."},{"key":"3_CR2","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0167-6423(87)90020-7","volume":"8","author":"G. Cousineau","year":"1987","unstructured":"G. Cousineau, P-L. Curien, M. Mauny, The Categorical Abstract Machine, Science of Computer Programming Vol 8, pp 173\u2013202, 1987.","journal-title":"Science of Computer Programming"},{"key":"3_CR3","unstructured":"Jon Fairbairn, Ponder and its Type System, University of Cambridge Computer Laboratory Technical Report No. 31, 1983."},{"key":"3_CR4","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_CR5","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_CR6","doi-asserted-by":"crossref","unstructured":"John Hughes, Strictness Detection in Non-Flat Domains, in Proceedings of the Workshop on Programs as data objects, Copenhagen, eds H. Ganzinger and N. Jones, Springer Verlag Lecture Notes in Computer Science Vol 217, 1985","DOI":"10.1007\/3-540-16446-4_7"},{"key":"3_CR7","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_CR8","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_CR9","unstructured":"Thomas Johnsson, The G-Machine: An Abstract Machine for Graph Reduction, Proceedings of SERC Declarative Programming Workshop at UCL, April 1983"},{"key":"3_CR10","unstructured":"Richard B. Kieburtz & Maria Napierala, A studied laziness \u2014 strictness analysis with stuctured data types, Oregon Graduate Centre, Extended Abstract, July 1985."},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Richard B. Kieburtz, When chasing your tail saves time, Information Processing Letters, December 1986.","DOI":"10.1016\/0020-0190(86)90094-3"},{"issue":"4","key":"3_CR12","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/6.4.308","volume":"6","author":"P. J. Landin","year":"1964","unstructured":"P. J. Landin, The Mechanical Evaluation of Expressions, Computer Journal Volume 6 Number 4 pp 308\u2013320, 1964.","journal-title":"Computer Journal"},{"key":"3_CR13","unstructured":"Mark Tillotson, Introduction to the Functional Programming Language \u201cPonder\u201d, University of Cambridge Computer Laboratory Technical Report No. 65, May 1985."},{"key":"3_CR14","unstructured":"Phil Wadler, Strictness Analysis on Non-Flat Domains, Programming Research Group, Oxford University, November 1985."}],"container-title":["Lecture Notes in Computer Science","Functional Programming Languages and Computer Architecture"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18317-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T07:57:16Z","timestamp":1558252636000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18317-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540183174","9783540478799"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-18317-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]},"assertion":[{"value":"27 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}