{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,2]],"date-time":"2023-08-02T11:16:13Z","timestamp":1690974973202},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,10,24]],"date-time":"2007-10-24T00:00:00Z","timestamp":1193184000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Higher-Order Symb Comput"],"published-print":{"date-parts":[[2007,11,20]]},"DOI":"10.1007\/s10990-007-9016-y","type":"journal-article","created":{"date-parts":[[2007,10,23]],"date-time":"2007-10-23T16:15:52Z","timestamp":1193156152000},"page":"237-255","source":"Crossref","is-referenced-by-count":1,"title":["The next 700 Krivine machines"],"prefix":"10.1007","volume":"20","author":[{"given":"R\u00e9mi","family":"Douence","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Fradet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,10,24]]},"reference":[{"key":"9016_CR1","volume-title":"Compiling with Continuations","author":"A.W. Appel","year":"1992","unstructured":"Appel, A.W.: Compiling with Continuations. Cambridge University Press, Cambridge (1992)"},{"issue":"1","key":"9016_CR2","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1017\/S0956796800000253","volume":"2","author":"A. Asperti","year":"1992","unstructured":"Asperti, A.: A categorical understanding of environment machines. J. Funct. Program. 2(1), 23\u201359 (1992)","journal-title":"J. Funct. Program."},{"issue":"2","key":"9016_CR3","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0167-6423(87)90020-7","volume":"8","author":"G. Cousineau","year":"1987","unstructured":"Cousineau, G., Curien, P.-L., Mauny, M.: The categorical abstract machine. Sci. Comput. Program. 8(2), 173\u2013202 (1987)","journal-title":"Sci. Comput. Program."},{"key":"9016_CR4","first-page":"333","volume-title":"Proc. of LFP\u201990","author":"P. Cr\u00e9gut","year":"1990","unstructured":"Cr\u00e9gut, P.: An abstract machine for lambda-terms normalization. In: Proc. of LFP\u201990, pp.\u00a0333\u2013340. ACM Press, New York (June 1990)"},{"key":"9016_CR5","unstructured":"Cr\u00e9gut, P.: Machines \u00e0 environnement pour la r\u00e9duction symbolique et l\u2019\u00e9valuation partielle. Th\u00e8se de l\u2019universit\u00e9 de Paris VII (1991)"},{"key":"9016_CR6","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/0304-3975(91)90230-Y","volume":"82","author":"P.-L. Curien","year":"1991","unstructured":"Curien, P.-L.: An abstract framework for environment machines. Theor. Comput. Sci. 82, 389\u2013402 (1991)","journal-title":"Theor. Comput. Sci."},{"key":"9016_CR7","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/1385-7258(72)90034-0","volume":"34","author":"N.G. Brujin De","year":"1972","unstructured":"De Brujin, N.G.: \u03bb-calculus notation with nameless dummies: a tool for automatic formula manipulation, with application to Church Rosser theorem. In Indag. Math. 34, 381\u2013392 (1972)","journal-title":"In Indag. Math."},{"issue":"6","key":"9016_CR8","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1017\/S0960129598002667","volume":"8","author":"P. Groote De","year":"1998","unstructured":"De Groote, P.: An environment machine for the lambda-mu-calculus. Math. Struct. Comput. Sci. 8(6), 637\u2013669 (1998)","journal-title":"Math. Struct. Comput. Sci."},{"key":"9016_CR9","unstructured":"Douence, R.: D\u00e9crire et comparer les mises en \u0153uvre de langages fonctionnels. Ph.D. Thesis, University of Rennes I (1996)"},{"key":"9016_CR10","doi-asserted-by":"crossref","unstructured":"Douence, R., Fradet, P.: A taxonomy of functional language implementations. Part I: call-by-value. INRIA Research Report 2783 (Jan. 1996)","DOI":"10.1007\/BFb0026812"},{"key":"9016_CR11","doi-asserted-by":"crossref","unstructured":"Douence, R., Fradet, P.: A taxonomy of functional language implementations. Part II: call-byname, call-by-need, and graph reduction. INRIA Research Report 3050 (Nov. 1996)","DOI":"10.1007\/BFb0026812"},{"issue":"2","key":"9016_CR12","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1145\/276393.276397","volume":"20","author":"R. Douence","year":"1998","unstructured":"Douence, R., Fradet, P.: A systematic study of functional language implementations. ACM Trans. Program. Lang. Syst. 20(2), 344\u2013387 (1998)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"9016_CR13","doi-asserted-by":"crossref","unstructured":"Fairbairn, J., Wray, S.: Tim: a simple, lazy abstract machine to execute supercombinators. In: Proc of FPCA\u201987. Lecture Notes in Computer Science, vol.\u00a0274, pp.\u00a034\u201345 (1987)","DOI":"10.1007\/3-540-18317-5_3"},{"issue":"1","key":"9016_CR14","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1145\/114005.102805","volume":"13","author":"P. Fradet","year":"1991","unstructured":"Fradet, P., Le M\u00e9tayer, D.: Compilation of functional languages by program transformation. ACM Trans. Program. Lang. Syst. 13(1), 21\u201351 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"9016_CR15","doi-asserted-by":"crossref","unstructured":"Hall, C.: Using Hindley-Milner type inference to optimise list representation. In: Proc. of LFP\u201994, pp.\u00a0162\u2013172 (1994)","DOI":"10.1145\/182590.156781"},{"key":"9016_CR16","doi-asserted-by":"crossref","unstructured":"Hannan, J., Miller, D.: From operational semantics to abstract machines: preliminary results. In: Proc. of LFP\u201990, Nice, France, pp.\u00a0323\u2013332 (1990)","DOI":"10.1145\/91556.91680"},{"key":"9016_CR17","doi-asserted-by":"crossref","unstructured":"Hardin, T., Maranget, L., Pagano, B.: Functional back-ends within the lambda-sigma calculus. In: Proc. of ICFP\u20191996, pp.\u00a025\u201333 (1996)","DOI":"10.1145\/232627.232632"},{"key":"9016_CR18","unstructured":"Johnsson, T.: Compiling lazy functional languages. Ph.D. Thesis, Chalmers University (1987)"},{"key":"9016_CR19","doi-asserted-by":"crossref","unstructured":"Joy, M.S., Rayward-Smith, V.J., Burton, F.W.: Efficient combinator code. Comput. Lang. 10(3) (1985)","DOI":"10.1016\/0096-0551(85)90017-7"},{"key":"9016_CR20","unstructured":"Krivine, J.-L.: Un interpr\u00e8te du lambda-calcul. Unpublished draft, available at ftp:\/\/ftp.logique.jussieu.fr\/pub\/distrib\/krivine\/interprt.pdf"},{"issue":"4","key":"9016_CR21","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/6.4.308","volume":"6","author":"P.J. Landin","year":"1964","unstructured":"Landin, P.J.: The mechanical evaluation of expressions. Comput. J. 6(4), 308\u2013320 (1964)","journal-title":"Comput. J."},{"key":"9016_CR22","unstructured":"Lang, F., Benaissa, Z., Lescanne, P.: Super-closures. In: Proc. of WPAM\u201998, as Technical Report of the University of SaarBruck, number A 02\/98 (1998)"},{"key":"9016_CR23","unstructured":"Leroy, X.: The Zinc experiment: an economical implementation of the ML language. INRIA Technical Report 117 (1990)"},{"key":"9016_CR24","doi-asserted-by":"crossref","unstructured":"Leroy, X.: Unboxed objects and polymorphic typing. In: ACM Symp. Princ. Prog. Lang., pp.\u00a0177\u2013188, 1992","DOI":"10.1145\/143165.143205"},{"key":"9016_CR25","volume-title":"Semantics with Applications: A Formal Introduction","author":"H.R. Nielson","year":"1992","unstructured":"Nielson, H.R., Nielson, F.: Semantics with Applications: A Formal Introduction. Wiley, New York (1992)"},{"key":"9016_CR26","doi-asserted-by":"crossref","unstructured":"Parigot, M.: \u03bb \u00b5-calculus: an algorithmic interpretation of classical natural deduction. In: Proc. of LPAR\u201992. Lecture Notes in Artificial Intelligence, vol.\u00a0624, pp.\u00a0190\u2013201 (1992)","DOI":"10.1007\/BFb0013061"},{"issue":"2","key":"9016_CR27","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1017\/S0956796800000319","volume":"2","author":"S.L. Peyton Jones","year":"1992","unstructured":"Peyton Jones, S.L.: Implementing lazy functional languages on stock hardware: the spineless tagless G-machine. J. Funct. Program. 2(2), 127\u2013202 (1992)","journal-title":"J. Funct. Program."},{"key":"9016_CR28","volume-title":"Implementing Functional Languages, a Tutorial","author":"S.L. Peyton Jones","year":"1992","unstructured":"Peyton Jones, S.L., Lester, D.: Implementing Functional Languages, a Tutorial. Prentice-Hall, Englewood Clips (1992)"},{"key":"9016_CR29","doi-asserted-by":"crossref","unstructured":"Peyton Jones, S.L., Partain, W., Santos, A.: Let-floating: moving bindings to give faster programs. In: Proc. of ICFP\u201996, pp.\u00a01\u201312, 1996","DOI":"10.1145\/232627.232630"},{"key":"9016_CR30","unstructured":"Sestoft, P.: Analysis and efficient implementation of functional programs. Ph.D. Thesis, DIKU, University of Copenhagen (1991)"},{"issue":"3","key":"9016_CR31","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1017\/S0956796897002712","volume":"7","author":"P. Sestoft","year":"1997","unstructured":"Sestoft, P.: Deriving a lazy abstract machine. J. Funct. Program. 7(3), 231\u2013264 (1997)","journal-title":"J. Funct. Program."},{"key":"9016_CR32","unstructured":"Shao, Z., Reppy, J., Appel, A.: Unrolling lists. In: Proc. of LFP\u201994, pp.\u00a0185\u2013195, 1994"},{"issue":"6","key":"9016_CR33","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1017\/S0956796898003141","volume":"8","author":"T. Streicher","year":"1998","unstructured":"Streicher, T., Reus, B.: Classical logic, continuation semantics and abstract machines. J. Funct. Program. 8(6), 543\u2013572 (1998)","journal-title":"J. Funct. Program."},{"key":"9016_CR34","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/spe.4380090105","volume":"9","author":"D.A. Turner","year":"1979","unstructured":"Turner, D.A.: A new implementation technique for applicative languages. Softw. Pract. Exp. 9, 31\u201349 (1979)","journal-title":"Softw. Pract. Exp."}],"container-title":["Higher-Order and Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-007-9016-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10990-007-9016-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-007-9016-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T13:38:52Z","timestamp":1684071532000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10990-007-9016-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,24]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,11,20]]}},"alternative-id":["9016"],"URL":"https:\/\/doi.org\/10.1007\/s10990-007-9016-y","relation":{},"ISSN":["1388-3690","1573-0557"],"issn-type":[{"value":"1388-3690","type":"print"},{"value":"1573-0557","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,24]]}}}