{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:45Z","timestamp":1725663585261},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540543961"},{"type":"electronic","value":"9783540475996"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3540543961_6","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:44:29Z","timestamp":1330209869000},"page":"102-123","source":"Crossref","is-referenced-by-count":4,"title":["GAML: A parallel implementation of lazy ML"],"prefix":"10.1007","author":[{"given":"Luc","family":"Maranget","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,6]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Andrew W. Appel, Runtime Tags Aren't Necessary, Lisp and Symbolic Computation, vol 2 1989.","DOI":"10.1007\/BF01811537"},{"key":"6_CR2","unstructured":"Andrew W. Appel, John R. Ellis, and Kai Li, Real-time Concurrent Collection on Stock Multiprocessors, PLDI'88."},{"key":"6_CR3","unstructured":"Lennart Augustsson, Compiling Lazy Functional Languages Part II, Ph. D. Thesis, Chalmers University of Technology, 1987."},{"key":"6_CR4","unstructured":"Lennart Augustsson and Thomas Johnsson, Parallel Graph Reduction with the \u2329v, G\u232a-machine, FPCA'89."},{"key":"6_CR5","unstructured":"Alain Deutsch, On determining lifetime and aliasing of dynamically allocated data in higher order functional specifications POPL'90."},{"key":"6_CR6","unstructured":"Report on the Programming Language Haskell, Version 1.0, YALEU\/DCS\/RR-77."},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Paul Hudak, A Semantic Model of Reference Counting and its Abstraction, in Abstract Interpretation of Declarative Languages, Ellis Horwood 1987.","DOI":"10.1145\/319838.319876"},{"key":"6_CR8","unstructured":"Thomas Johnsson, Compiling Lazy Functional Languages, Ph. D. Thesis, Chalmers University of Technology, 1987."},{"key":"6_CR9","unstructured":"Alain Laville, Implementation of Lazy Pattern Matching Algorithms, ESOP'88, LNCS 300."},{"key":"6_CR10","unstructured":"David Lester, Stacklessness: Compiling Recursion for a Distributed Architecture, FCPA'89."},{"key":"6_CR11","unstructured":"S. L. Peyton Jones, The Implementation of Functional Programming Languages, Prentice-Hall, 1987."},{"key":"6_CR12","unstructured":"Laurence Puel, Asc\u00e1nder Su\u00e1rez, Compiling Pattern Matching by Term Decomposition, LFP'90."},{"key":"6_CR13","unstructured":"Simon L. Peyton-Jones, John Salkild, The Spineless Tagless G-machine, FPCA'89."},{"key":"6_CR14","unstructured":"Pierre Weis, The CAML Reference manual Version 2.6.1, INRIA Technical Report 121."}],"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_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:54:00Z","timestamp":1605646440000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3540543961_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540543961","9783540475996"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3540543961_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}