{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T07:06:29Z","timestamp":1770275189115,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540543961","type":"print"},{"value":"9783540475996","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3540543961_30","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:44:15Z","timestamp":1330209855000},"page":"636-666","source":"Crossref","is-referenced-by-count":58,"title":["Unboxed values as first class citizens in a non-strict functional language"],"prefix":"10.1007","author":[{"given":"Simon L Peyton","family":"Jones","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Launchbury","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,6]]},"reference":[{"key":"30_CR1","unstructured":"AW Appel [1988], \u201cRuntime tags aren't necessary,\u201d CS-TR-142-88, Department of Computer Science, Princeton University."},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"AW Appel & T Jim [Jan 1989], \u201cContinuation-passing, closure-passing, style,\u201d in Proc ACM Conference on Principles of Programming Languages, ACM, 293\u2013302.","DOI":"10.1145\/75277.75303"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"TH Brus, MCJD van Eckelen, MO van Leer & MJ Plasmeijer [Sept 1987], \u201cClean \u2014 a language for functional graph rewriting,\u201d in Functional programming languages and computer architecture, Portland, G Kahn, ed., LNCS 274, Springer Verlag, 364\u2013384.","DOI":"10.1007\/3-540-18317-5_20"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"LMM Damas & R Milner [1982], \u201cPrincipal type schemes for functional programs,\u201d in POPL, 207\u2013212.","DOI":"10.1145\/582153.582176"},{"key":"30_CR5","unstructured":"P Fradet & D Le Metayer [1990], \u201cCompilation of functional languages by program transformation,\u201d IRISA, Campus de Beaulieu, Rennes."},{"key":"30_CR6","unstructured":"P Fradet & D Le Metayer [June 1988], \u201cCompilation of lambda-calculus into functional machine code,\u201d INRIA."},{"key":"30_CR7","unstructured":"[1986], in Abstract Interpretation of Declarative Languages, C Hankin & S Abramsky, eds., Ellis Horwood, Chichester, 246\u2013265."},{"key":"30_CR8","unstructured":"P Hudak, PL Wadler, Arvind, B Boutel, J Fairbairn, J Fasel, K Hammond, J Hughes, T Johnsson, R Kieburtz, RS Nikhil, SL Peyton Jones, M Reeve, D Wise & J Young [April 1990], \u201cReport on the functional programming language Haskell,\u201d Department of Computing Science, Glasgow University."},{"key":"30_CR9","unstructured":"R Kelsey [May 1989], \u201cCompilation by program transformation,\u201d YALEU\/DCS\/RR-702, PhD thesis, Department of Computer Science, Yale University."},{"key":"30_CR10","unstructured":"DA Kranz [May 1988], \u201cORBIT \u2014 an optimising compiler for Scheme,\u201d PhD thesis, Department of Computer Science, Yale University."},{"key":"30_CR11","unstructured":"X Leroy [April 1991], \u201cEfficient data representations in polymorphic languages,\u201d INRIA Research Report 1264, Rocquencourt."},{"key":"30_CR12","unstructured":"E Moggi [June 1989], \u201cComputational lambda calculus and monads,\u201d in Logic in Computer Science, California, IEEE."},{"key":"30_CR13","first-page":"89","volume-title":"Functional Programming Languages and Computer Architecture","author":"J Peterson","year":"1989","unstructured":"J Peterson [Sept 1989], \u201cUntagged data in tagged environments: choosing optimal representations at compile time,\u201d in Functional Programming Languages and Computer Architecture, London, Addison Wesley, 89\u201399."},{"key":"30_CR14","unstructured":"SL Peyton Jones [1987], The implementation of functional programming languages, Prentice Hall."},{"key":"30_CR15","unstructured":"SL Peyton Jones [Feb 1991], \u201cThe Spineless Tagless G-machine: a second attempt,\u201d Department of Computing Science, University of Glasgow."},{"key":"30_CR16","unstructured":"SL Peyton Jones & Jon Salkild [Sept 1989], \u201cThe Spineless Tagless G-machine,\u201d in Functional Programming Languages and Computer Architecture, D Mac-Queen, ed., Addison Wesley."},{"key":"30_CR17","unstructured":"DA Schmidt [1986], Denotational semantics: a methodology for language development, Allyn and Bacon."},{"key":"30_CR18","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1137\/0211062","volume":"11","author":"MB Smyth","year":"1982","unstructured":"MB Smyth & GD Plotkin [Nov 1982], \u201cThe category-theoretic solution of recursive domain equations,\u201d SIAM Journal of Computing 11, 761\u2013783.","journal-title":"SIAM Journal of Computing"},{"key":"30_CR19","unstructured":"GL Steele [1978], \u201cRabbit: a compiler for Scheme,\u201d AI-TR-474, MIT Lab for Computer Science."},{"key":"30_CR20","unstructured":"SR Thatte [1990], \u201cCoercive type equivalence,\u201d Department of Maths and Computer Science, Clarkson University NY."},{"key":"30_CR21","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0304-3975(90)90147-A","volume":"73","author":"P Wadler","year":"1990","unstructured":"P Wadler [1990], \u201cDeforestation: transforming programs to eliminate trees,\u201d Theoretical Computer Science 73, 231\u2013248.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Functional Programming Languages and Computer Architecture"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3540543961_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:17:15Z","timestamp":1742591835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3540543961_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540543961","9783540475996"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3540543961_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991]]}}}