{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:22:04Z","timestamp":1725456124868},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540603597"},{"type":"electronic","value":"9783540450481"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0026812","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T10:29:45Z","timestamp":1132396185000},"page":"27-44","source":"Crossref","is-referenced-by-count":3,"title":["Towards a taxonomy of functional language implementations"],"prefix":"10.1007","author":[{"given":"R\u00e9mi","family":"Douence","sequence":"first","affiliation":[]},{"given":"Pascal","family":"Fradet","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,16]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"A. W. Appel. Compiling with Continuations. Cambridge University Press. 1992.","DOI":"10.1017\/CBO9780511609619"},{"issue":"1","key":"4_CR2","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1017\/S0956796800000253","volume":"2","author":"A. Asperti","year":"1992","unstructured":"A. Asperti. A categorical understanding of environment machines. Journal of Functional Programming, 2(1), pp.23\u201359,1992.","journal-title":"Journal of Functional Programming"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"G. Argo. Improving the three instruction machine. In Proc. of FPCA'89, pp. 100\u2013115, 1989.","DOI":"10.1145\/99370.99378"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"G. Burn, S.L. Peyton Jones and J.D. Robson. The spineless G-machine. In Proc. of LFP'88, pp. 244\u2013258, 1988.","DOI":"10.1145\/62678.62717"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"G. Burn and D. Le M\u00e9tayer. Proving the correctness of compiler optimisations based on a global analysis. Journal of Functional Programming, 1995. (to appear).","DOI":"10.1017\/S0956796800001581"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"L. Cardelli. Compiling a functional language. In Proc. of LFP'84, pp. 208\u2013217, 1984.","DOI":"10.1145\/800055.802037"},{"issue":"2","key":"4_CR7","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 and M. Mauny, The categorical abstract machine. Science of Computer Programming, 8(2), pp. 173\u2013202, 1987.","journal-title":"Science of Computer Programming"},{"key":"4_CR8","unstructured":"P. Cr\u00e9gut. Machines \u00e0 environnement pour la r\u00e9duction symbolique et l'\u00e9valuation partielle. Th\u00e8se de l'universit\u00e9 de Paris VII, 1991."},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"R. Douence and P. Fradet. A taxonomy of functional language implementations. Part I: Call-by-Value, INRIA Research Report, 1995. (to appear)","DOI":"10.1007\/BFb0026812"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"J. Fairbairn and S. Wray. Tim: a simple, lazy abstract machine to execute supercombinators. In Proc of FPCA'87, LNCS 274, pp. 34\u201345, 1987.","DOI":"10.1007\/3-540-18317-5_3"},{"issue":"1","key":"4_CR11","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1145\/942578.807077","volume":"7","author":"M. J. Fischer","year":"1972","unstructured":"M. J. Fischer. Lambda-calculus schemata. In Proc. of the ACM Conf. on Proving Properties about Programs, Sigplan Notices, Vol. 7(1), pp. 104\u2013109, 1972.","journal-title":"Sigplan Notices"},{"issue":"1","key":"4_CR12","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1145\/114005.102805","volume":"13","author":"P. Fradet","year":"1991","unstructured":"P. Fradet and D. Le M\u00e9tayer. Compilation of functional languages by program transformation. ACM Trans. on Prog. Lang. and Sys., 13(1), pp. 21\u201351, 1991.","journal-title":"ACM Trans. on Prog. Lang. and Sys."},{"issue":"4","key":"4_CR13","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1017\/S0960129500001559","volume":"2","author":"J. Hannan","year":"1992","unstructured":"J. Hannan. From operational semantics to abstract machines. Math. Struct. in Comp. Sci., 2(4), pp. 415\u2013459, 1992.","journal-title":"Math. Struct. in Comp. Sci."},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"J. Hatcliff and O. Danvy. A generic account of continuation-passing styles. In Proc. of POPL'94, pp. 458\u2013471, 1994.","DOI":"10.1145\/174675.178053"},{"key":"4_CR15","unstructured":"T. Johnsson. Compiling Lazy Functional Languages. PhD Thesis, Chalmers University, 1987."},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"M. S. Joy, V. J. Rayward-Smith and F. W. Burton. Efficient combinator code. Computer Languages, 10(3), 1985.","DOI":"10.1016\/0096-0551(85)90017-7"},{"issue":"7","key":"4_CR17","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1145\/13310.13333","volume":"21","author":"D. Kranz","year":"1986","unstructured":"D. Kranz, R. Kesley, J. Rees, P. Hudak, J. Philbin, and N. Adams. ORBIT: An optimizing compiler for Scheme. SIGPLAN Notices, 21(7), pp.219\u2013233, 1986.","journal-title":"SIGPLAN Notices"},{"issue":"4","key":"4_CR18","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. The Computer Journal, 6(4), pp.308\u2013320, 1964.","journal-title":"The Computer Journal"},{"key":"4_CR19","unstructured":"X. Leroy. The Zinc experiment: an economical implementation of the ML language. INRIA Technical Report 117, 1990."},{"key":"4_CR20","first-page":"60","volume":"274","author":"R. D. Lins","year":"1987","unstructured":"R. D. Lins. Categorical multi-combinators. In Proc. of FPCA'87, LNCS 274, pp. 60\u201379, 1987.","journal-title":"LNCS"},{"issue":"1","key":"4_CR21","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1017\/S0956796800000939","volume":"4","author":"R. Lins","year":"1992","unstructured":"R. Lins, S. Thompson and S.L. Peyton Jones. On the equivalence between CMC and TIM. Journal of Functional Programming, 4(1), pp. 47\u201363, 1992.","journal-title":"Journal of Functional Programming"},{"key":"4_CR22","unstructured":"E. Meijer and R. Paterson. Down with lambda lifting. copies available at: erik@cs.kun.nl, 1991."},{"key":"4_CR23","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","volume":"93","author":"E. Moggi","year":"1991","unstructured":"E. Moggi. Notions of computation and monads. Information and Computation, 93:55\u201392, 1991.","journal-title":"Information and Computation"},{"issue":"2","key":"4_CR24","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1017\/S0956796800000319","volume":"2","author":"S.L. Peyton Jones","year":"1992","unstructured":"S.L. Peyton Jones. Implementing lazy functional languages on stock hardware: the spineless tagless G-machine. Journal of Functional Programming, 2(2):127\u2013202, 1992.","journal-title":"Journal of Functional Programming"},{"key":"4_CR25","unstructured":"S. L. Peyton Jones and D. Lester. Implementing functional languages, a tutorial. Prentice Hall, 1992."},{"key":"4_CR26","first-page":"636","volume":"523","author":"S. L. Peyton Jones","year":"1991","unstructured":"S. L. Peyton Jones and J. Launchbury. Unboxed values as first class citizens in a non-strict functional language. In Proc. of FPCA'91, LNCS 523, pp.636\u2013666, 1991.","journal-title":"LNCS"},{"key":"4_CR27","unstructured":"P. Sestoft. Deriving a lazy abstract machine. Technical Report 1994-146, Technical University of Denmark, 1994."},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Z. Shao and A. Appel. Space-efficient closure representations. In Proc. of LFP'94, pp. 150\u2013161,1994.","DOI":"10.1145\/182409.156783"},{"key":"4_CR29","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/spe.4380090105","volume":"9","author":"D.A. Turner","year":"1979","unstructured":"D.A. Turner. A new implementation technique for applicative languages. Soft. Pract. and Exper., 9, pp. 31\u201349, 1979.","journal-title":"Soft. Pract. and Exper."},{"issue":"3","key":"4_CR30","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1145\/357172.357179","volume":"4","author":"M. Wand","year":"1982","unstructured":"M. Wand. Deriving target code as a representation of continuation semantics. ACM Trans. on Prog. Lang. and Sys., 4(3), pp. 496\u2013517, 1982.","journal-title":"ACM Trans. on Prog. Lang. and Sys."}],"container-title":["Lecture Notes in Computer Science","Programming Languages: Implementations, Logics and Programs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0026812","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T01:54:01Z","timestamp":1586570041000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0026812"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540603597","9783540450481"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/bfb0026812","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}