{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T09:52:58Z","timestamp":1648720378928},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,9,1]],"date-time":"2011-09-01T00:00:00Z","timestamp":1314835200000},"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":[[2011,9]]},"DOI":"10.1007\/s10990-012-9083-6","type":"journal-article","created":{"date-parts":[[2012,8,2]],"date-time":"2012-08-02T09:57:14Z","timestamp":1343901434000},"page":"207-237","source":"Crossref","is-referenced-by-count":1,"title":["Path resolution for nested recursive modules"],"prefix":"10.1007","volume":"24","author":[{"given":"Jacques","family":"Garrigue","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keiko","family":"Nakata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,5,26]]},"reference":[{"key":"9083_CR1","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. Funct. Program. 14, 263\u2013315 (2004)","journal-title":"J. Funct. Program."},{"key":"9083_CR2","first-page":"50","volume-title":"ACM SIGPLAN Conference on Programming Language Design and Implementation","author":"K. Crary","year":"1999","unstructured":"Crary, K., Harper, R., Puri, S.: What is a recursive module? In: ACM SIGPLAN Conference on Programming Language Design and Implementation, pp.\u00a050\u201363 (1999)"},{"key":"9083_CR3","volume-title":"Int. Symposium on Mathematical Foundations of Computer Science","author":"V. Cremet","year":"2006","unstructured":"Cremet, V., Garillot, F., Lenglet, S., Odersky, M.: A\u00a0core calculus for Scala type checking. In: Int. Symposium on Mathematical Foundations of Computer Science (2006)"},{"key":"9083_CR4","volume-title":"IEEE Symposium on Logic in Computer Science","author":"M. Dauchet","year":"1990","unstructured":"Dauchet, M., Tison, S.: The theory of ground rewrite systems is decidable. In: IEEE Symposium on Logic in Computer Science (1990)"},{"key":"9083_CR5","volume-title":"ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","author":"D. Dreyer","year":"2004","unstructured":"Dreyer, D.: A\u00a0type system for well-founded recursion. In: ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (2004)"},{"key":"9083_CR6","volume-title":"ACM SIGPLAN International Conference on Functional Programming","author":"D. Dreyer","year":"2005","unstructured":"Dreyer, D.: Recursive type generativity. In: ACM SIGPLAN International Conference on Functional Programming (2005)"},{"key":"9083_CR7","unstructured":"Dreyer, D.: Post to the Caml mailing list. (2007). http:\/\/caml.inria.fr\/pub\/ml-archives\/caml-list\/2007\/03\/73e1ea81e35002046fdce6f14c1d8848.en.html"},{"key":"9083_CR8","volume-title":"ACM SIGPLAN International Conference on Functional Programming","author":"D. Dreyer","year":"2007","unstructured":"Dreyer, D.: A\u00a0type system for recursive modules. In: ACM SIGPLAN International Conference on Functional Programming (2007)"},{"key":"9083_CR9","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1145\/604131.604151","volume-title":"ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","author":"D. Dreyer","year":"2003","unstructured":"Dreyer, D., Crary, K., Harper, R.: A\u00a0type system for higher-order modules. In: ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.\u00a0236\u2013249 (2003)"},{"key":"9083_CR10","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1145\/1411204.1411248","volume-title":"ACM SIGPLAN International Conference on Functional Programming","author":"D. Dreyer","year":"2008","unstructured":"Dreyer, D., Rossberg, A.: Mixin\u2019 up the ML module system. In: ACM SIGPLAN International Conference on Functional Programming, pp.\u00a0307\u2013320 (2008)"},{"key":"9083_CR11","first-page":"341","volume-title":"ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","author":"R. Harper","year":"1990","unstructured":"Harper, R., Mitchell, J.C., Moggi, E.: Higher-order modules and the phase distinction. In: ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.\u00a0341\u2013354 (1990)"},{"key":"9083_CR12","series-title":"Springer LNCS","first-page":"6","volume-title":"European Symposium on Programming","author":"T. Hirschowitz","year":"2002","unstructured":"Hirschowitz, T., Leroy, X.: Mixin modules in a call-by-value setting. In: European Symposium on Programming. Springer LNCS, vol.\u00a02305, pp.\u00a06\u201320 (2002)"},{"key":"9083_CR13","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J. Hopcroft","year":"2001","unstructured":"Hopcroft, J., Motwani, R., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (2001)"},{"key":"9083_CR14","first-page":"993","volume-title":"ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications","author":"H. Im","year":"2011","unstructured":"Im, H., Nakata, K., Garrigue, J., Park, S.: A\u00a0syntactic type system for recursive modules. In: ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, pp.\u00a0993\u20131012 (2011)"},{"key":"9083_CR15","first-page":"22","volume-title":"Symposium of Theoretical Aspects of Computer Science","author":"G. Kahn","year":"1987","unstructured":"Kahn, G.: Natural semantics. In: Symposium of Theoretical Aspects of Computer Science, pp.\u00a022\u201339 (1987)"},{"key":"9083_CR16","first-page":"142","volume-title":"ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","author":"X. Leroy","year":"1995","unstructured":"Leroy, X.: Applicative functors and fully transparent higher-order modules. In: ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.\u00a0142\u2013153. ACM Press, New York (1995)"},{"issue":"5","key":"9083_CR17","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1017\/S0956796800001933","volume":"6","author":"X. Leroy","year":"1996","unstructured":"Leroy, X.: A\u00a0syntactic theory of type generativity and sharing. J. Funct. Program. 6(5), 667\u2013698 (1996)","journal-title":"J. Funct. Program."},{"issue":"3","key":"9083_CR18","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1017\/S0956796800003683","volume":"10","author":"X. Leroy","year":"2000","unstructured":"Leroy, X.: A\u00a0modular module system. J. Funct. Program. 10(3), 269\u2013303 (2000)","journal-title":"J. Funct. Program."},{"key":"9083_CR19","unstructured":"Leroy, X.: A proposal for recursive modules in Objective Caml. Available at http:\/\/caml.inria.fr\/pub\/papers\/xleroy-recursive_modules-03.pdf (2003)"},{"key":"9083_CR20","unstructured":"Leroy, X., Doligez, D., Garrigue, J., R\u00e9my, D., Vouillon, J.: The Objective Caml System, Release 3.11. Software and documentation available on the Web, http:\/\/caml.inria.fr\/ (2008)"},{"key":"9083_CR21","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2319.001.0001","volume-title":"The Definition of Standard ML\u2014Revised","author":"R. Milner","year":"1997","unstructured":"Milner, R., Tofte, M., Harper, R., MacQueen, D.: The Definition of Standard ML\u2014Revised. MIT Press, Cambridge (1997)"},{"key":"9083_CR22","first-page":"354","volume-title":"ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","author":"B. Montagu","year":"2009","unstructured":"Montagu, B., R\u00e9my, D.: Modeling abstract types in modules with open existential types. In: ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.\u00a0354\u2013365 (2009)"},{"key":"9083_CR23","unstructured":"Mottl, M.: OCaml bug report. http:\/\/caml.inria.fr\/mantis\/view.php?id=3476 (2005)"},{"key":"9083_CR24","unstructured":"Nakata, K.: OCaml bug report. http:\/\/caml.inria.fr\/mantis\/view.php?id=3674 . (2005)"},{"key":"9083_CR25","volume-title":"ACM SIGPLAN International Conference on Functional Programming","author":"K. Nakata","year":"2006","unstructured":"Nakata, K., Garrigue, J.: Recursive modules for programming. In: ACM SIGPLAN International Conference on Functional Programming. ACM Press, New York (2006)"},{"key":"9083_CR26","volume-title":"Int. Workshop on Termination (WST)","author":"K. Nakata","year":"2007","unstructured":"Nakata, K., Garrigue, J.: Path resolution for recursive nested modules is undecidable. In: Int. Workshop on Termination (WST), Paris, France (2007)"},{"key":"9083_CR27","volume-title":"Int. Workshop on Foundations of Object-Oriented Languages","author":"K. Nakata","year":"2005","unstructured":"Nakata, K., Ito, A., Garrigue, J.: Recursive object-oriented modules. In: Int. Workshop on Foundations of Object-Oriented Languages (2005)"},{"key":"9083_CR28","series-title":"Springer LNCS","volume-title":"European Symposium on Programming","author":"C. Russo","year":"2000","unstructured":"Russo, C.: First-class structures for standard ML. In: European Symposium on Programming. Springer LNCS, vol.\u00a01782 (2000)"},{"key":"9083_CR29","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1145\/507635.507644","volume-title":"ACM SIGPLAN International Conference on Functional Programming","author":"C. Russo","year":"2001","unstructured":"Russo, C.: Recursive structures for standard ML. In: ACM SIGPLAN International Conference on Functional Programming, pp.\u00a050\u201361. ACM Press, New York (2001)"},{"key":"9083_CR30","series-title":"Springer LNCS","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/10704567_5","volume-title":"ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming","author":"C. Russo","year":"1999","unstructured":"Russo, C.: Non-dependent types for standard ML modules. In: ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming. Springer LNCS, vol.\u00a01702, pp.\u00a080\u201397 (1999)"},{"key":"9083_CR31","unstructured":"Washburn, G.A.: Scala Mailing List. http:\/\/article.gmane.org\/gmane.comp.lang.scala\/13573\/ (2008)"}],"container-title":["Higher-Order and Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-012-9083-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10990-012-9083-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-012-9083-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,25]],"date-time":"2022-01-25T06:23:55Z","timestamp":1643091835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10990-012-9083-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,9]]}},"alternative-id":["9083"],"URL":"https:\/\/doi.org\/10.1007\/s10990-012-9083-6","relation":{},"ISSN":["1388-3690","1573-0557"],"issn-type":[{"value":"1388-3690","type":"print"},{"value":"1573-0557","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,9]]}}}