{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,5]],"date-time":"2023-06-05T22:27:18Z","timestamp":1686004038549},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,3,1]],"date-time":"2009-03-01T00:00:00Z","timestamp":1235865600000},"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":[[2009,3]]},"DOI":"10.1007\/s10990-009-9042-z","type":"journal-article","created":{"date-parts":[[2009,12,18]],"date-time":"2009-12-18T12:41:58Z","timestamp":1261140118000},"page":"3-66","source":"Crossref","is-referenced-by-count":3,"title":["Compilation of extended recursion in call-by-value functional languages"],"prefix":"10.1007","volume":"22","author":[{"given":"Tom","family":"Hirschowitz","sequence":"first","affiliation":[]},{"given":"Xavier","family":"Leroy","sequence":"additional","affiliation":[]},{"given":"J. B.","family":"Wells","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,12,19]]},"reference":[{"key":"9042_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\u20133","key":"9042_CR2","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0168-0072(01)00104-X","volume":"117","author":"Z.M. Ariola","year":"2002","unstructured":"Ariola, Z.M., Blom, S.: Skew confluence and the lambda calculus with letrec. Ann. Pure Appl. Log. 117(1\u20133), 95\u2013178 (2002)","journal-title":"Ann. Pure Appl. Log."},{"issue":"3","key":"9042_CR3","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1017\/S0956796803004775","volume":"14","author":"G. Boudol","year":"2004","unstructured":"Boudol, G.: The recursive record semantics of objects revisited. J.\u00a0Funct. Program. 14(3), 263\u2013315 (2004)","journal-title":"J.\u00a0Funct. Program."},{"key":"9042_CR4","unstructured":"Boudol, G., Zimmer, P.: Recursion in the call-by-value lambda-calculus. In: \u00c9sik, Z., Ing\u00f3lfsd\u00f3ttir, A. (eds.) Fixed Points in Computer Science. BRICS Notes Series, vol. NS-02-2, pp.\u00a061\u201366 (2002)"},{"key":"9042_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/3-540-13346-1_2","volume-title":"Semantics of Data Types","author":"L. Cardelli","year":"1984","unstructured":"Cardelli, L.: A semantics of multiple inheritance. In: Kahn, G., MacQueen, D., Plotkin, G. (eds.) Semantics of Data Types. Lecture Notes in Computer Science, vol.\u00a0173, pp.\u00a051\u201367. Springer, Berlin (1984)"},{"issue":"2","key":"9042_CR6","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":"9042_CR7","first-page":"50","volume-title":"Programming Language Design and Implementation","author":"K. Crary","year":"1999","unstructured":"Crary, K., Harper, R., Puri, S.: What is a recursive module? In: Programming Language Design and Implementation, pp.\u00a050\u201363. ACM Press, New York (1999)"},{"key":"9042_CR8","series-title":"Electr. Notes Theor. Comput. Sci.","first-page":"57","volume-title":"Proceedings of the 2nd Int. Workshop on Term Graph Rewriting (TERMGRAPH 2004)","author":"D.J. Dougherty","year":"2005","unstructured":"Dougherty, D.J., Lescanne, P., Liquori, L., Lang, F.: Addressed term rewriting systems: Syntax, semantics, and pragmatics: Extended abstract. In: Proceedings of the 2nd Int. Workshop on Term Graph Rewriting (TERMGRAPH 2004). Electr. Notes Theor. Comput. Sci., vol.\u00a0127(5), pp.\u00a057\u201382. Elsevier, Amsterdam (2005)"},{"key":"9042_CR9","first-page":"293","volume-title":"Principles of Programming Languages","author":"D. Dreyer","year":"2004","unstructured":"Dreyer, D.: A type system for well-founded recursion. In: Principles of Programming Languages, pp.\u00a0293\u2013305. ACM Press, New York (2004)"},{"key":"9042_CR10","first-page":"289","volume-title":"International Conference on Functional Programming","author":"D. Dreyer","year":"2007","unstructured":"Dreyer, D.: A type system for recursive modules. In: International Conference on Functional Programming, pp.\u00a0289\u2013302. ACM Press, New York (2007)"},{"key":"9042_CR11","first-page":"174","volume-title":"International Conference on Functional Programming","author":"L. Erk\u00f6k","year":"2000","unstructured":"Erk\u00f6k, L., Launchbury, J.: Recursive monadic bindings. In: International Conference on Functional Programming, pp.\u00a0174\u2013185. ACM Press, New York (2000)"},{"key":"9042_CR12","volume-title":"The Java Language Specification","author":"J. Gosling","year":"2005","unstructured":"Gosling, J., Joy, B., Steele, G., Bracha, G.: The Java Language Specification, 3rd edn. Prentice-Hall, Englewood Cliffs (2005)","edition":"3"},{"key":"9042_CR13","doi-asserted-by":"crossref","unstructured":"Hirschowitz, T.: Mixin modules, modules, and extended recursion in a call-by-value setting. Ph.D. thesis, University of Paris VII (2003)","DOI":"10.1007\/3-540-45927-8_2"},{"key":"9042_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1007\/978-3-540-24754-8_16","volume-title":"Functional and Logic Programming","author":"T. Hirschowitz","year":"2004","unstructured":"Hirschowitz, T.: Rigid mixin modules. In: Kameyama, Y., Stuckey, P. (eds.) Functional and Logic Programming. Lecture Notes in Computer Science, vol.\u00a02998, pp.\u00a0214\u2013228. Springer, Berlin (2004)"},{"issue":"5","key":"9042_CR15","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1145\/1086642.1086644","volume":"27","author":"T. Hirschowitz","year":"2005","unstructured":"Hirschowitz, T., Leroy, X.: Mixin modules in a call-by-value setting. ACM Trans. Program. Lang. Syst. 27(5), 857\u2013881 (2005)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"9042_CR16","first-page":"160","volume-title":"Principles and Practice of Declarative Programming","author":"T. Hirschowitz","year":"2003","unstructured":"Hirschowitz, T., Leroy, X., Wells, J.B.: Compilation of extended recursion in call-by-value functional languages. In: Principles and Practice of Declarative Programming, pp.\u00a0160\u2013171. ACM Press, New York (2003)"},{"key":"9042_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/978-3-540-24725-8_6","volume-title":"Programming Languages and Systems, 13th European Symposium on Programming, ESOP 2004","author":"T. Hirschowitz","year":"2004","unstructured":"Hirschowitz, T., Leroy, X., Wells, J.B. Call-by-value mixin modules: Reduction semantics, side effects, types. In: Schmidt, D.A. (ed.) Programming Languages and Systems, 13th European Symposium on Programming, ESOP 2004. Lecture Notes in Computer Science, vol.\u00a02986, pp.\u00a064\u201378. Springer, Berlin (2004)"},{"issue":"1","key":"9042_CR18","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1010051815785","volume":"11","author":"R. Kelsey","year":"1998","unstructured":"Kelsey, R., Clinger, W., Rees, J. (eds.): Revised5 report on the algorithmic language Scheme. Higher-Order Symb. Comput. 11(1), 7\u2013105 (1998)","journal-title":"Higher-Order Symb. Comput."},{"key":"9042_CR19","first-page":"219","volume-title":"Symposium on Compiler Construction","author":"D. Kranz","year":"1986","unstructured":"Kranz, D., Kelsey, R., Rees, J., Hudak, P., Philbin, J., Adams, N.: ORBIT: An optimizing compiler for Scheme. In: Symposium on Compiler Construction, pp.\u00a0219\u2013233. ACM Press, New York (1986)"},{"key":"9042_CR20","unstructured":"Leroy, X., Doligez, D., Garrigue, J., R\u00e9my, D., Vouillon, J.: The Objective Caml system release 3.11, documentation and user\u2019s manual. Available at http:\/\/caml.inria.fr\/pub\/docs\/manual-ocaml\/ (2008)"},{"key":"9042_CR21","unstructured":"Leroy, X., Doligez, D., Garrigue, J., Vouillon, J.: The Objective Caml system. Software and documentation available at http:\/\/caml.inria.fr\/ (1996\u20132009)"},{"key":"9042_CR22","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2319.001.0001","volume-title":"The Definition of Standard ML (revised)","author":"R. Milner","year":"1997","unstructured":"Milner, R., Tofte, M., Harper, R., MacQueen, D.: The Definition of Standard ML (revised). MIT Press, Cambridge (1997)"},{"issue":"4","key":"9042_CR23","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1051\/ita:2004018","volume":"38","author":"E. Moggi","year":"2004","unstructured":"Moggi, E., Sabry, A.: An abstract monadic semantics for value recursion. Theor. Inf. Appl. 38(4), 375\u2013400 (2004)","journal-title":"Theor. Inf. Appl."},{"key":"9042_CR24","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/1411304.1411309","volume-title":"ML\u201908: Proceedings of the 2008 ACM SIGPLAN workshop on ML","author":"J. Nordlander","year":"2008","unstructured":"Nordlander, J., Carlsson, M., Gill, A.: Unrestricted call-by-value recursion. In: ML\u201908: Proceedings of the 2008 ACM SIGPLAN workshop on ML, pp.\u00a023\u201334. ACM Press, New York (2008)"},{"key":"9042_CR25","volume-title":"Haskell 98 Language and Libraries, the revised report","year":"2003","unstructured":"Peyton Jones, S. (ed.): Haskell 98 Language and Libraries, the revised report. Cambridge University Press, Cambridge (2003)"},{"issue":"2","key":"9042_CR26","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"G.D. Plotkin","year":"1975","unstructured":"Plotkin, G.D.: Call-by-name, call-by-value and the \u03bb-calculus. Theor. Comput. Sci. 1(2), 125\u2013159 (1975)","journal-title":"Theor. Comput. Sci."},{"key":"9042_CR27","first-page":"50","volume-title":"International Conference on Functional Programming","author":"C.V. Russo","year":"2001","unstructured":"Russo, C.V.: Recursive structures for Standard ML. In: International Conference on Functional Programming, pp.\u00a050\u201361. ACM Press, New York (2001)"},{"issue":"4","key":"9042_CR28","first-page":"437","volume":"18","author":"P. Sewell","year":"2008","unstructured":"Sewell, P., Stoyle, G., Hicks, M., Bierman, G., Wansbrough, K.: Dynamic rebinding for marshalling and update, via redex-time and destruct-time reduction. J.\u00a0Funct. Program. 18(4), 437\u2013502 (2008)","journal-title":"J.\u00a0Funct. Program."},{"key":"9042_CR29","first-page":"164","volume-title":"Programming Language Design and Implementation","author":"O. Shivers","year":"1988","unstructured":"Shivers, O.: Control-flow analysis in Scheme. In: Programming Language Design and Implementation, pp.\u00a0164\u2013174. ACM Press, New York (1988)"},{"key":"9042_CR30","series-title":"Electronic Notes in Theoretical Computer Science","first-page":"3","volume-title":"Proceedings of the ACM-SIGPLAN Workshop on ML (ML 2005)","author":"D. Syme","year":"2006","unstructured":"Syme, D.: Initializing mutually referential abstract objects: The value recursion challenge. In: Proceedings of the ACM-SIGPLAN Workshop on ML (ML 2005). Electronic Notes in Theoretical Computer Science, vol.\u00a0148(2), pp.\u00a03\u201325. Elsevier, Amsterdam (2006)"},{"issue":"3\/4","key":"9042_CR31","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s10990-005-4878-3","volume":"18","author":"O. Waddell","year":"2005","unstructured":"Waddell, O., Sarkar, D., Dybvig, R.K.: Fixing letrec: A faithful yet efficient implementation of Scheme\u2019s recursive binding construct. Higher-Order Symb. Comput. 18(3\/4), 299\u2013326 (2005)","journal-title":"Higher-Order Symb. Comput."},{"issue":"1","key":"9042_CR32","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1006\/inco.1994.1093","volume":"115","author":"A.K. Wright","year":"1992","unstructured":"Wright, A.K., Felleisen, M.: A syntactic approach to type soundness. Inf. Comput. 115(1), 38\u201394 (1992)","journal-title":"Inf. Comput."}],"container-title":["Higher-Order and Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-009-9042-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10990-009-9042-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-009-9042-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T21:29:41Z","timestamp":1559338181000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10990-009-9042-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,3]]}},"alternative-id":["9042"],"URL":"https:\/\/doi.org\/10.1007\/s10990-009-9042-z","relation":{},"ISSN":["1388-3690","1573-0557"],"issn-type":[{"value":"1388-3690","type":"print"},{"value":"1573-0557","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,3]]}}}