{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T14:07:25Z","timestamp":1751983645435},"publisher-location":"Berlin\/Heidelberg","reference-count":16,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540579354"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0032396","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T06:30:32Z","timestamp":1134282632000},"page":"95-116","source":"Crossref","is-referenced-by-count":6,"title":["ML with first-class environments and its type inference algorithm"],"prefix":"10.1007","author":[{"given":"Shin-ya","family":"Nishizaki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"Harold Abelson and Gerald Jay Sussman. Structure and Interpretation of Computer Programs. The MIT Press, 1985."},{"key":"6_CR2","unstructured":"Pierre-Louis Curien, Th\u00e9r\u00e8se Hardin, and Jean-Jacques L\u00e9vy. Confluence Properties of Weak and Strong Calculi of Explicit Substitutions. Rapports de Recherche 1617, INRIA, February 1992."},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/S0019-9958(86)80047-X","volume":"69","author":"C. Pierre-Louis","year":"1986","unstructured":"Pierre-Louis Curien. Categorical combinators. Information and Control, 69:188\u2013254, 1986.","journal-title":"Information and Control"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/0304-3975(91)90230-Y","volume":"82","author":"C. Pierre-Louis","year":"1991","unstructured":"Pierre-Louis Curien. An abstract framework for environment machines. Theoretical Computer Science, 82:389\u2013402, 1991.","journal-title":"Theoretical Computer Science"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Olivier Danvy and Andrzej Filinski. Abstracting control. In Proceedings of the 1990 Conference on LISP and Functional Programming, pages 151\u2013160, 1990.","DOI":"10.1145\/91556.91622"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Olivier Danvy and Karoline Malmkj\u00e6r. Intensions and extensions in a reflective tower. In Proceedings of the 1988 Conference on LISP and Functional Programming, pages 327\u2013341, 1988.","DOI":"10.1145\/62678.62725"},{"key":"6_CR7","unstructured":"Matthias Felleisen, Daniel P. Friedman, Eugene Kohlbecker, and Bruce Duba. Reasoning with continuations. In Proceedings of the Symposium on Logic in Computer Science, IEEE Computer Society Press, 1986."},{"key":"6_CR8","unstructured":"Carl A. Gunter. Semantics of programming languages: structures and techniques. The MIT Press, 1992."},{"key":"6_CR9","doi-asserted-by":"crossref","first-page":"127","DOI":"10.3233\/FI-1993-191-206","volume":"19","author":"L. A. Jategaonkar","year":"1993","unstructured":"Lalita A. Jategaonkar and John C. Mitchell. Type inference with extended pattern matching and subtypes. Fundamenta Informaticae, 19:127\u2013166, 1993.","journal-title":"Fundamenta Informaticae"},{"key":"6_CR10","unstructured":"Oliver Laumann. Reference Manual for the Elk Extension Language Interpreter. 1990."},{"key":"6_CR11","unstructured":"MIT Scheme Reference Manual. MIT."},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Mart\u00edn Abadi, Luca Cardelli, Pierre-Louis Curien, and Jean-Jacques L\u00e9vy. Explicit substitutions. In proceedings of the Seventeenth Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, San Francisco, California, January 1990.","DOI":"10.1145\/96709.96712"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Shinya Nishizaki. Simply typed lambda calculus with first-class environments. Publication of Research Institute for Mathematical Sciences Kyoto University, 1994. To appear.","DOI":"10.2977\/prims\/1195164948"},{"issue":"12","key":"6_CR14","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/15042.15043","volume":"21","author":"J. Rees","year":"1986","unstructured":"J. Rees and W. Clinger. Revised3 repord on the algorithmic language scheme. SIGPLAN Notices, 21(12):37\u201379, 1986.","journal-title":"SIGPLAN Notices"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Brian Cantwell Smith. Reflection and semantics in lisp. In Conference Record of the 11th Annual ACM Symposium on Principles of Programming Languages, pages 23\u201335, 1984.","DOI":"10.1145\/800017.800513"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF01806174","volume":"1","author":"M. Wand","year":"1988","unstructured":"Mitchell Wand and Daniel P. Friedman. The mystery of the tower revealed: a nonreflective description of the reflective tower. Lisp and Symbolic Computation, 1:11\u201337, 1988.","journal-title":"Lisp and Symbolic Computation"}],"container-title":["Lecture Notes in Computer Science","Logic, Language and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0032396.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,21]],"date-time":"2021-07-21T07:32:20Z","timestamp":1626852740000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032396"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540579354"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/bfb0032396","relation":{},"subject":[]}}